Finitely additive markov chains

S. Ramakrishnan

doi:10.1090/S0002-9947-1981-0607119-3

Finitely additive markov chains

S. Ramakrishnan

Mathematics

Research output: Contribution to journal › Article › peer-review

13 Scopus citations

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.

Original language	English (US)
Pages (from-to)	247-272
Number of pages	26
Journal	Transactions of the American Mathematical Society
Volume	265
Issue number	1
DOIs	https://doi.org/10.1090/S0002-9947-1981-0607119-3
State	Published - May 1981

Keywords

Finitely additive probabilities
Markov chain
Markov strategy
Stationary initial distribution
Stationary transition
Strategy

ASJC Scopus subject areas

Mathematics(all)
Applied Mathematics

Access to Document

10.1090/S0002-9947-1981-0607119-3

Fingerprint Dive into the research topics of 'Finitely additive markov chains'. Together they form a unique fingerprint.

Cite this

@article{1668d4eb16fd42c28124bfbf3425bbdf,

title = "Finitely additive markov chains",

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.",

keywords = "Finitely additive probabilities, Markov chain, Markov strategy, Stationary initial distribution, Stationary transition, Strategy",

author = "S. Ramakrishnan",

year = "1981",

month = may,

doi = "10.1090/S0002-9947-1981-0607119-3",

language = "English (US)",

volume = "265",

pages = "247--272",

journal = "Transactions of the American Mathematical Society",

issn = "0002-9947",

publisher = "American Mathematical Society",

number = "1",

}

TY - JOUR

T1 - Finitely additive markov chains

AU - Ramakrishnan, S.

PY - 1981/5

Y1 - 1981/5

N2 - 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.

AB - 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.

KW - Finitely additive probabilities

KW - Markov chain

KW - Markov strategy

KW - Stationary initial distribution

KW - Stationary transition

KW - Strategy

UR - http://www.scopus.com/inward/record.url?scp=84968464910&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84968464910&partnerID=8YFLogxK

U2 - 10.1090/S0002-9947-1981-0607119-3

DO - 10.1090/S0002-9947-1981-0607119-3

M3 - Article

AN - SCOPUS:84968464910

VL - 265

SP - 247

EP - 272

JO - Transactions of the American Mathematical Society

JF - Transactions of the American Mathematical Society

SN - 0002-9947

IS - 1

ER -