Memory functions and correlations in additive binary Markov chains
From MaRDI portal
Abstract: A theory of additive Markov chains with long-range memory, proposed earlier in Phys. Rev. E 68, 06117 (2003), is developed and used to describe statistical properties of long-range correlated systems. The convenient characteristics of such systems, a memory function, and its relation to the correlation properties of the systems are examined. Various methods for finding the memory function via the correlation function are proposed. The inverse problem (calculation of the correlation function by means of the prescribed memory function) is also solved. This is demonstrated for the analytically solvable model of the system with a step-wise memory function.
Recommendations
- Additive \(N\)-step Markov chains as prototype model of symbolic stochastic dynamical systems with long-range correlations
- HIGH-ORDER CORRELATION FUNCTIONS OF BINARY MULTI-STEP MARKOV CHAINS
- Long-memory continuous-time correlation models
- Correlation models with long-range dependence
- Memory equations as reduced Markov processes
Cited in
(6)- Renewal model for dependent binary sequences
- Markov-breaking and the emergence of long memory in Ornstein–Uhlenbeck systems
- Entropy of high-order Markov chains beyond the pair correlations
- Extremal driving as a mechanism for generating long-term memory
- HIGH-ORDER CORRELATION FUNCTIONS OF BINARY MULTI-STEP MARKOV CHAINS
- Long-range memory and non-Markov statistical effects in human sensorimotor coordination
This page was built for publication: Memory functions and correlations in additive binary Markov chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3419316)