Order estimation of Markov chains
Abstract
We describe estimators n(X0,X1,...,Xn), 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 k-th order Markov chain and to infinity otherwise.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.