✦ LIBER ✦

On Some Criteria for Estimating the Order of a Markov Chain

✍ Scribed by Katz, Richard W.

Book ID: 111878654
Publisher: American Statistical Association
Year: 1981
Tongue: English
Weight: 263 KB
Volume: 23
Category: Article
ISSN: 0040-1706
DOI: 10.2307/1267787

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On model order estimation for partially

On model order estimation for partially observed Markov chains

✍ R.G. Whiting; E.E. Pickett 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 406 KB

On Ergodicity and Stability Estimates fo

On Ergodicity and Stability Estimates for Some Nonhomogeneous Markov Chains

✍ D. B. Andreev; M. A. Elesin; E. A. Krylov; A. V. Kuznetsov; A. I. Zeifman 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 106 KB

On the estimation of the order of a Mark

On the estimation of the order of a Markov chain and universal data compression

✍ Merhav, N.; Gutman, M.; Ziv, J. 📂 Article 📅 1989 🏛 IEEE 🌐 English ⚖ 543 KB

On the First-Order Edgeworth Expansion f

On the First-Order Edgeworth Expansion for a Markov Chain

✍ S. Datta; W.P. Mccormick 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 474 KB

We consider the first-order Edgeworth expansion for summands related to a homogeneous Markov chain. Certain inaccuracies in some earlier results by Nagaev are corrected and the expansion is obtained under relaxed conditions. An application of our result to the distribution of the mle of a transition

On Determination of the Order of a Marko

On Determination of the Order of a Markov Chain

✍ L. C. Zhao; C. C. Y. Dorea; C. R. Gonçalves 📂 Article 📅 2001 🏛 Springer Netherlands 🌐 English ⚖ 90 KB

On the conductance of order Markov chain

On the conductance of order Markov chains

✍ Alexander Karzanov; Leonid Khachiyan 📂 Article 📅 1991 🏛 Springer Netherlands 🌐 English ⚖ 425 KB

Let Q be a convex solid in R", partitioned mto two volumes u and t' by an area s. We show that s > min(u, o)/diam Q, and use this inequality to obtain the lower bound n -'/' on the conductance of order Markov chains, which describe nearly uniform generators of linear extensions for posets of size n.