If you need an accessible version of this item please contact JSTOR User Support

Finitely Additive Markov Chains

S. Ramakrishnan
Transactions of the American Mathematical Society
Vol. 265, No. 1 (May, 1981), pp. 247-272
DOI: 10.2307/1998493
Stable URL: http://www.jstor.org/stable/1998493
Page Count: 26
  • Download PDF
  • Cite this Item

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If you need an accessible version of this item please contact JSTOR User Support
Finitely Additive Markov Chains
Preview not available

Abstract

In this paper we develop the theory of Markov chains with stationary transition probabilities, where the transition probabilities and the initial distribution are assumed only to be finitely additive. We prove a strong law of large numbers for recurrent chains. The problem of existence and uniqueness of finitely additive stationary initial distributions is studied and the ergodicity of recurrent chains under a stationary initial distribution is proved.

Page Thumbnails

  • Thumbnail: Page 
247
    247
  • Thumbnail: Page 
248
    248
  • Thumbnail: Page 
249
    249
  • Thumbnail: Page 
250
    250
  • Thumbnail: Page 
251
    251
  • Thumbnail: Page 
252
    252
  • Thumbnail: Page 
253
    253
  • Thumbnail: Page 
254
    254
  • Thumbnail: Page 
255
    255
  • Thumbnail: Page 
256
    256
  • Thumbnail: Page 
257
    257
  • Thumbnail: Page 
258
    258
  • Thumbnail: Page 
259
    259
  • Thumbnail: Page 
260
    260
  • Thumbnail: Page 
261
    261
  • Thumbnail: Page 
262
    262
  • Thumbnail: Page 
263
    263
  • Thumbnail: Page 
264
    264
  • Thumbnail: Page 
265
    265
  • Thumbnail: Page 
266
    266
  • Thumbnail: Page 
267
    267
  • Thumbnail: Page 
268
    268
  • Thumbnail: Page 
269
    269
  • Thumbnail: Page 
270
    270
  • Thumbnail: Page 
271
    271
  • Thumbnail: Page 
272
    272