Open Access
June, 1958 Exact Probabilities and Asymptotic Relationships for Some Statistics from $m$-th Order Markov Chains
Leo A. Goodman
Ann. Math. Statist. 29(2): 476-490 (June, 1958). DOI: 10.1214/aoms/1177706623

Abstract

An exact formula is presented for the probability of a specified frequency count of $m$-tuples $(m \geqq 1)$ in a sequence $X_1, X_2, \cdots, X_N$ from a Markov chain of order $m - 1$ having a denumerable number $a \leqq \infty$ of states. An exact expression is also obtained for the conditional probability of a specified $m$-tuple count, given the $n$-tuple count, when the chain is of order $n - 1 (n < m).$ If $a < \infty,$ then this conditional probability, when regarded as a statistic computed from the observed sequence, is shown to be asymptotically equivalent to the product of the probabilities (regarded as a statistic) associated with a corresponding set of $a^{n - 1}$ contingency tables with assigned marginals (each table having $a^{m - n}$ row and $a$ columns), where in each table the two attributes described by the table are independent. This fact leads to several simplified tests, related to standard tests of independence in contingency tables, for the null hypothesis $H_{n - 1}$ that the Markov chain is of order $n - 1$ within the alternate hypothesis $H_{m - 1}.$ Analogous results are also obtained for circular sequences.

Citation

Download Citation

Leo A. Goodman. "Exact Probabilities and Asymptotic Relationships for Some Statistics from $m$-th Order Markov Chains." Ann. Math. Statist. 29 (2) 476 - 490, June, 1958. https://doi.org/10.1214/aoms/1177706623

Information

Published: June, 1958
First available in Project Euclid: 27 April 2007

zbMATH: 0086.12203
MathSciNet: MR94847
Digital Object Identifier: 10.1214/aoms/1177706623

Rights: Copyright © 1958 Institute of Mathematical Statistics

Vol.29 • No. 2 • June, 1958
Back to Top