pith. sign in

arxiv: 0711.0472 · v1 · submitted 2007-11-03 · 🧮 math.PR · cs.IT· math.IT

Order estimation of Markov chains

classification 🧮 math.PR cs.ITmath.IT
keywords markovorderprocessalmostalphabetappliedcasechain
0
0 comments X
read the original abstract

We describe estimators $\chi_n(X_0,X_1,...,X_n)$, which when applied to an unknown stationary process taking values from a countable alphabet ${\cal X}$, converge almost surely to $k$ in case the process is a $k$-th order Markov chain and to infinity otherwise.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.