Additive Markov chain
An additive Markov chain is a Markov chain with the additive condition probability function.
Formal definition
An additive Markov chain of order m is a sequence of random variables X1, X2, X3, ..., possessing the following property: the probability of variable Xn to have a certain value under the condition that the values of all previous variables are fixed depends on the values of m previous variables only, and the influence of previous variables on a generated one is additive,
for all n>m.
Binary case
A binary additive Markov chain is where the state space of the chain consists on two values only, Xn ∈ { x1, x2 }. For example, Xn ∈ { 0, 1 }. The conditional probability function of a binary additive Markov chain can be presented as
- ,
- .
Here is the probability to find Xn=1 in the sequence;
is referred to as the memory function.
Relation between the memory function and the correlation function
See also
References
- A.A. Markov. "Rasprostranenie zakona bol'shih chisel na velichiny, zavisyaschie drug ot druga". Izvestiya Fiziko-matematicheskogo obschestva pri Kazanskom universitete, 2-ya seriya, tom 15, pp. 135–156, 1906.
- A.A. Markov. "Extension of the limit theorems of probability theory to a sum of variables connected in a chain". reprinted in Appendix B of: R. Howard. Dynamic Probabilistic Systems, volume 1: Markov Chains. John Wiley and Sons, 1971.
- S. Hod and U. Keshet. "Phase transition in random walks with long-range correlations", Phys. Rev. E, Vol. 70, p. 015104, 2004.
- S.L. Narasimhan, J.A. Nathan, and K.P.N. Murthy. "Can coarse-graining introduce long-range correlations in a symbolic sequence?", Europhys. Lett. Vol. 69 (1), p. 22, 2005.
- S.S. Melnyk, O.V. Usatenko, and V.A. Yampol’skii. "Memory functions of the additive Markov chains: applications to complex dynamic systems", Physica A, Vol. 361, I. 2, pp. 405-415, 2006.