Odd cutsets and the hard-core model on Z^d
From MaRDI portal
Publication:405503
Combinatorial probability (60C05) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41)
Abstract: We consider the hard-core lattice gas model on Z^d and investigate its phase structure in high dimensions. We prove that when the intensity parameter exceeds Cd^{-1/3}(log d)^2, the model exhibits multiple hard-core measures, thus improving the previous bound of Cd^{-1/4}(log d)^{3/4} given by Galvin and Kahn. At the heart of our approach lies the study of a certain class of edge cutsets in Z^d, the so-called odd cutsets, that appear naturally as the boundary between different phases in the hard-core model. We provide a refined combinatorial analysis of the structure of these cutsets yielding a quantitative form of concentration for their possible shapes as the dimension d tends to infinity. This analysis relies upon and improves previous results obtained by the first author.
Recommendations
- The growth constant of odd cutsets in high dimensions
- Cut sets and normed cohomology with applications to percolation
- scientific article; zbMATH DE number 6963517
- The \(k\)-cut model in deterministic and random trees
- Odd Minimum Cut Sets and b-Matchings Revisited
- Dimension, Halfspaces, and the Density of Hard Sets
- Dimension, halfspaces, and the density of hard sets
- On the \(f\)-vectors of cutsets in the Boolean lattice
- On random \(\alpha\)-cuts
Cites work
- A uniqueness condition for Gibbs measures, with application to the 2- dimensional Ising antiferromagnet
- Agreement percolation and phase coexistence in some Gibbs systems.
- Boundary-connectivity via graph theory
- Exact sampling from anti‐monotone systems
- scientific article; zbMATH DE number 4160792 (Why is no real title available?)
- scientific article; zbMATH DE number 3951995 (Why is no real title available?)
- scientific article; zbMATH DE number 48085 (Why is no real title available?)
- Loss networks
- Nonmonotonic behavior in hard-core and Widom-Rowlinson models
- On Phase Transition in the Hard-Core Model on ${\mathbb Z}^d$
- Percolation and the hard-core lattice gas model
- Sampling independent sets in the discrete torus
- The problem of uniqueness of a Gibbsian random field and the problem of phase transitions
Cited in
(11)- Rigidity of 3-colorings of the discrete torus
- Strongly correlated random interacting processes. Abstracts from the workshop held January 28 -- February 3, 2018
- Algorithmic Pirogov-Sinai theory
- Rigidity of proper colorings of \(\mathbb{Z}^d \)
- Birthday inequalities, repulsion, and hard spheres
- The growth constant of odd cutsets in high dimensions
- On Phase Transition in the Hard-Core Model on ${\mathbb Z}^d$
- Homomorphisms from the torus
- A refined graph container lemma and applications to the hard-core model on bipartite expanders
- High-density hard-core model on triangular and hexagonal lattices
- Finitary codings for spatial mixing Markov random fields
This page was built for publication: Odd cutsets and the hard-core model on \(\mathbb{Z}^{d}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q405503)
