Uniqueness vs. non-uniqueness for complete connections with modified majority rules
From MaRDI portal
Publication:267022
DOI10.1007/s00440-015-0622-zzbMath1336.60142arXiv1309.7550OpenAlexW2083408179WikidataQ105583442 ScholiaQ105583442MaRDI QIDQ267022
Publication date: 7 April 2016
Published in: Probability Theory and Related Fields (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.7550
Markov chainsphase transitionlong-range interactionsmajority rulenon-uniqueness\(g\)-functioncomplete connections
Discrete-time Markov processes on general state spaces (60J05) Transition functions, generators and resolvents (60J35)
Related Items
Dynamic uniqueness for stochastic chains with unbounded memory, Gaussian concentration bounds for stochastic chains of unbounded memory, Non-uniqueness for specifications in, Entropic repulsion and lack of the \(g\)-measure property for Dyson models, A note on the Bramson-Kalikow process
Cites Work
- Random fields
- Nonuniqueness in \(g\)-functions
- Square summability of variations of \(g\)-functions and uniqueness of \(g\)-measures
- A note on the Bramson-Kalikow process
- Explicit estimates in the Bramson–Kalikow model
- Uniqueness and ergodic properties of attractive g-measures
- Probability with Martingales
- Non-uniqueness for specifications in
- An example of non-unique g -measures
- Sur des chaînes à liaisons complètes