Order estimation of Markov chains

Gusztáv Morvai; Benjamin Weiss

doi:10.1109/TIT.2005.844093

Order estimation of Markov chains

Gusztáv Morvai^*, Benjamin Weiss

^*Corresponding author for this work

Einstein Institute of Mathematics

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

21 Scopus citations

Abstract

Estimators x_n(X_o, X₁,..., X_n), are described which, when applied to an unknown stationary process taking values from a countable alphabet X, converge almost surely to k in case the process is a kth-order Markov chain and to infinity otherwise.

Original language	English
Pages (from-to)	1496-1497
Number of pages	2
Journal	IEEE Transactions on Information Theory
Volume	51
Issue number	4
DOIs	https://doi.org/10.1109/TIT.2005.844093
State	Published - Apr 2005

Keywords

Markov chains
Order estimation
Stationary processes

Access to Document

10.1109/TIT.2005.844093

Cite this

@article{4bba049240b04aba82d6951a8220dad3,

title = "Order estimation of Markov chains",

abstract = "Estimators xn(Xo, X1,..., Xn), are described which, when applied to an unknown stationary process taking values from a countable alphabet X, converge almost surely to k in case the process is a kth-order Markov chain and to infinity otherwise.",

keywords = "Markov chains, Order estimation, Stationary processes",

author = "Guszt{\'a}v Morvai and Benjamin Weiss",

year = "2005",

month = apr,

doi = "10.1109/TIT.2005.844093",

language = "אנגלית",

volume = "51",

pages = "1496--1497",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "4",

}

TY - JOUR

T1 - Order estimation of Markov chains

AU - Morvai, Gusztáv

AU - Weiss, Benjamin

PY - 2005/4

Y1 - 2005/4

N2 - Estimators xn(Xo, X1,..., Xn), are described which, when applied to an unknown stationary process taking values from a countable alphabet X, converge almost surely to k in case the process is a kth-order Markov chain and to infinity otherwise.

AB - Estimators xn(Xo, X1,..., Xn), are described which, when applied to an unknown stationary process taking values from a countable alphabet X, converge almost surely to k in case the process is a kth-order Markov chain and to infinity otherwise.

KW - Markov chains

KW - Order estimation

KW - Stationary processes

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

U2 - 10.1109/TIT.2005.844093

DO - 10.1109/TIT.2005.844093

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:17644396340

SN - 0018-9448

VL - 51

SP - 1496

EP - 1497

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 4

ER -

Order estimation of Markov chains

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this