arXiv · math/0506080
Two new Markov order estimators
Abstract
We present two new methods for estimating the order (memory depth) of a finite alphabet Markov chain from observation of a sample path. One method is based on entropy estimation via recurrence times of patterns, and the other relies on a comparison of empirical conditional probabilities. The key to both methods is a qualitative change that occurs when a parameter (a candidate for the order) passes the true order. We also present extensions to order estimation for Markov random fields.
Explore related subjects
Keep this discovery
Yuval Peres, Paul Shields. 2005-06-04. Two new Markov order estimators. https://arxiv.org/abs/math/0506080
Cite the original work for its findings. Save a collection to share your selection of sources.