Odd cutsets and the hard-core model on \(\mathbb{Z}^{d}\)
From MaRDI portal
Publication:405503
DOI10.1214/12-AIHP535zbMath1305.82019arXiv1106.3594MaRDI QIDQ405503
Publication date: 5 September 2014
Published in: Annales de l'Institut Henri Poincaré. Probabilités et Statistiques (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1106.3594
Interacting random processes; statistical mechanics type models; percolation theory (60K35) Combinatorial probability (60C05) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)
Related Items (8)
Rigidity of 3-colorings of the discrete torus ⋮ Algorithmic Pirogov-Sinai theory ⋮ Homomorphisms from the torus ⋮ Rigidity of proper colorings of \(\mathbb{Z}^d \) ⋮ Strongly correlated random interacting processes. Abstracts from the workshop held January 28 -- February 3, 2018 ⋮ The Growth Constant of Odd Cutsets in High Dimensions ⋮ Birthday inequalities, repulsion, and hard spheres ⋮ Finitary codings for spatial mixing Markov random fields
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Loss networks
- Percolation and the hard-core lattice gas model
- Agreement percolation and phase coexistence in some Gibbs systems.
- A uniqueness condition for Gibbs measures, with application to the 2- dimensional Ising antiferromagnet
- Nonmonotonic behavior in hard-core and Widom-Rowlinson models
- The problem of uniqueness of a Gibbsian random field and the problem of phase transitions
- Sampling independent sets in the discrete torus
- Exact sampling from anti‐monotone systems
- On Phase Transition in the Hard-Core Model on ${\mathbb Z}^d$
- Boundary-connectivity via graph theory
This page was built for publication: Odd cutsets and the hard-core model on \(\mathbb{Z}^{d}\)