Abstract
In this paper we discuss random walks in the finitely additive strategic setup.
Similar content being viewed by others
REFERENCES
Chen, R. (1976a). A finitely additive version of Kolmogorov's law of iterated logarithm. Israel J. Math. 23, 209–220.
Chen, R. (1976b). Some finitely additive versions of the strong law of large numbers. Israel J. Math. 24, 244–259.
Dubbins, L. E., and Savage, L. J. (1965). How to Gamble if you Must: Inequalities for Stochustic Processes. McGraw Hill, New York.
Dunford, N., and Schwarz, J. T. (1966). Linear Operators, Part I, Interscience, New York.
Feller, W. (1965). An Introduction to Probability Theory and Its Applications, Vol. II, John Wiley, New York.
Karandikar, R. L. (1982). A general principle for limit theorems in finitely additive probability. Trans. Am. Math. Soc. 273, 541–550.
Karandikar, R. L. (1988). A general principle for limit theorems in finitely additive probability: the dependent case. J. Mult. Anal. 24, 189–206.
Purves, R. A., and Sudderth, W. D. (1976). Some finitely additive probability. Ann. Prob. 4, 259–276.
Ramakrishnan, S. (1980). Finitely additive Markov chains. Ph.D. Thesis, Indian Statistical Institute.
Ramakrishnan, S. (1981). Finitely additive Markov chains. Trans. Am. Math. Soc. 265, 247–272.
Ramakrishnan, S. (1984). Central limit theorem in a finitely additive setting. Ill. J. Math. 28, 139–161.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Gangopadhyay, S., Rao, B.V. Some Finitely Additive Probability: Random Walks. Journal of Theoretical Probability 10, 643–657 (1997). https://doi.org/10.1023/A:1022649627106
Issue Date:
DOI: https://doi.org/10.1023/A:1022649627106