Rigidity of proper colorings of \(\mathbb{Z}^d \)
From MaRDI portal
Publication:2689658
DOI10.1007/s00222-022-01164-3OpenAlexW2886985140MaRDI QIDQ2689658
Publication date: 13 March 2023
Published in: Inventiones Mathematicae (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.03597
Related Items (2)
Subshifts and colorings on ascending HNN-extensions of finitely generated abelian groups ⋮ Proper -colorings of are Bernoulli
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Odd cutsets and the hard-core model on \(\mathbb{Z}^{d}\)
- \(H\)-colouring bipartite graphs
- Gibbs measures and phase transitions.
- \(H\)-coloring tori
- Some intersection theorems for ordered sets and graphs
- On the ratio of optimal integral and fractional covers
- Improved Peierls argument for high-dimensional Ising models
- Absence of phase transition for antiferromagnetic Potts models via the Dobrushin uniqueness theorem
- Generalized rank functions and an entropy argument
- On homomorphisms from the Hamming cube to \(\mathbb{Z}\)
- Uniqueness of uniform random colorings of regular trees
- Rigidity of 3-colorings of the discrete torus
- Quite weak Bernoulli with exponential rate and percolation for random fields
- High-dimensional Lipschitz functions are typically flat
- The number of 4-colorings of the Hamming cube
- Random walk with long-range constraints
- Counting regions with bounded surface area
- Long-range order in the 3-state antiferromagnetic Potts model in high dimensions
- Sampling 3-colourings of regular bipartite graphs
- The lace expansion and its application. École d'Été de Probabilités de Saint-Flour XXXIV -- 2004.
- Bounding the partition function of spin-systems
- Entropy-driven phase transition in low-temperature antiferromagnetic Potts models
- The problem of uniqueness of a Gibbsian random field and the problem of phase transitions
- An Entropy Approach to the Hard-Core Model on Bipartite Graphs
- Improved bounds for sampling colorings
- On independence and entropy for high-dimensional isotropic subshifts
- Torpid Mixing of Local Markov Chains on 3-Colorings of the Discrete Torus
- On replica symmetry of large deviations in random graphs
- On the number of antichains in multilevelled ranked posets
- Sampling independent sets in the discrete torus
- The Theory of Information and Coding
- The Growth Constant of Odd Cutsets in High Dimensions
- On weighted graph homomorphisms
- On Phase Transition in the Hard-Core Model on ${\mathbb Z}^d$
- Boundary-connectivity via graph theory
- Mixing properties of colourings of the ℤd lattice
- Information Inequalities for Joint Distributions, With Interpretations and Applications
- Statistical Mechanics of Lattice Systems
- Strong Spatial Mixing with Fewer Colors for Lattice Graphs
- Slow mixing of Glauber dynamics for the hard‐core model on regular bipartite graphs
- Phase coexistence and torpid mixing in the 3-coloring model on ${\mathbb Z}^d$
- On Ising's model of ferromagnetism
- Range of cube-indexed random walk
- Observables at infinity and states with short range correlations in statistical mechanics
This page was built for publication: Rigidity of proper colorings of \(\mathbb{Z}^d \)
