Non-regular g-measures and variable length memory chains
From MaRDI portal
Publication:5136519
DOI10.1088/1361-6544/aba0c5zbMath1456.60079arXiv1907.02442OpenAlexW2955346343MaRDI QIDQ5136519
Frederic Paccaut, Sandro Gallo, Ricardo Felipe Ferreira
Publication date: 26 November 2020
Published in: Nonlinearity (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.02442
Stationary stochastic processes (60G10) Discrete-time Markov processes on general state spaces (60J05) Dynamical systems involving maps of the interval (37E05)
Related Items (2)
Variable length memory chains: characterization of stationary probability measures ⋮ On a family of singular continuous measures related to the doubling map
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Regular \(g\)-measures are not always Gibbsian
- Conditional ergodicity in infinite dimension
- Approximate group context tree
- Random Markov processes and uniform martingales
- Basic properties of strong mixing conditions. A survey and some open questions
- Transformations of Gibbs measures
- Square summability of variations of \(g\)-functions and uniqueness of \(g\)-measures
- Dynamic uniqueness for stochastic chains with unbounded memory
- Persistent random walks. II. Functional scaling limits
- Persistent random walks. I. Recurrence versus transience
- Chains with complete connections: general theory, uniqueness, loss of memory and mixing properties
- Entropic repulsion and lack of the \(g\)-measure property for Dyson models
- Existence of a phase-transition in a one-dimensional Ising ferromagnet
- Perfect simulation for locally continuous chains of infinite order
- Context tree selection and linguistic rhythm retrieval from written texts
- Regularity properties and pathologies of position-space renormalization-group transformations: scope and limitations of Gibbsian theory
- Strongly mixing g-measures
- Backward Coalescence Times for Perfect Simulation of Chains with Infinite Memory
- Context Trees, Variable Length Markov Chains and Dynamical Sources
- Stochastic Processes With Random Contexts: A Characterization and Adaptive Estimators for the Transition Probabilities
- Chains with unbounded variable length memory: perfect simulation and a visible regeneration scheme
- Uniqueness and ergodic properties of attractive g-measures
- A universal data compression system
- Ruelle's Operator Theorem and g-Measures
- [https://portal.mardi4nfdi.de/wiki/Publication:4766476 Principe variationnel et syst�mes dynamiques symboliques]
- On non-regularg-measures
- Perfect simulation of processes with long memory: A “coupling into and from the past” algorithm
- On the relation between Gibbs and -measures
- Stationary Processes and Prediction Theory. (AM-44)
- Sur des chaînes à liaisons complètes
This page was built for publication: Non-regular g-measures and variable length memory chains
