2013
DOI: 10.1016/j.physa.2012.12.017
|View full text |Cite
|
Sign up to set email alerts
|

Markov chain order estimation with conditional mutual information

Abstract: We introduce the Conditional Mutual Information (CMI) for the estimation of the Markov chain order. For a Markov chain of K symbols, we define CMI of order m, I c (m), as the mutual information of two variables in the chain being m time steps apart, conditioning on the intermediate variables of the chain. We find approximate analytic significance limits based on the estimation bias of CMI and develop a randomization significance test of I c (m), where the randomized symbol sequences are formed by random permut… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
26
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 25 publications
(26 citation statements)
references
References 25 publications
0
26
0
Order By: Relevance
“…The order of the process is then estimated to be the smallest value of r which produces a nonsignificant test statistics [18,19]. Tables II and III for the first row of Table II and subsequently for the second raw to a value 0.392362 × 10 1 , smaller than the χ 2 value of 5.99 at 5% level.…”
Section: Markov Chain Analysismentioning
confidence: 99%
“…The order of the process is then estimated to be the smallest value of r which produces a nonsignificant test statistics [18,19]. Tables II and III for the first row of Table II and subsequently for the second raw to a value 0.392362 × 10 1 , smaller than the χ 2 value of 5.99 at 5% level.…”
Section: Markov Chain Analysismentioning
confidence: 99%
“…see Miller (1955) and Roulston (1999). In Papapetrou and Kugiumtzis (2013), the significance of I C (m) is tested using randomization to form the null distribution ofÎ C (m). The Markov chain order estimation from the scheme of randomization CMI testing for increasing orders m was found to perform consistently well for different scenarios of correlation structure and order of Markov chains, and it was favorably compared to other known order estimation methods, such as the AIC and BIC criteria (Tong, 1975;Katz, 1981;Guttorp, 1995;Csiszár and Shields, 2000), the Peres-Shields estimator (Peres and Shields, 2005), and the likelihood ratio test using a -divergence measure (Menéndez et al, 2001(Menéndez et al, , 2011.…”
Section: Background and Previous Workmentioning
confidence: 99%
“…Apparently, for sequences with LRC the estimation fails as there is no characteristic order, and one expects that increasing the length of the symbol sequence the order estimate increases as well. However, this idea is met with practical limitations, mainly due to the inefficiency of the current methods in estimating high orders (Dalevi et al, 2006;Lu et al, 2012;Papapetrou and Kugiumtzis, 2013). We deal with this problem here and propose a method that can assess whether a given symbol sequence has a characteristic order (the Markov chain order) found by saturation of the estimated order with the increase of the subsequence length (up to the actual sequence length), or alternatively the symbol sequence has LRC structure or a high Markov chain order that cannot be estimated on the basis of the given symbol sequence length.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations