Phase coexistence and slow mixing for the hard-core model on Z^2
DOI10.1007/978-3-642-40328-6_27zbMATH Open1405.68224arXiv1211.6182OpenAlexW2963577722MaRDI QIDQ2851872FDOQ2851872
Authors: Antonio Blanca, David Galvin, Dana Randall, Prasad Tetali
Publication date: 4 October 2013
Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1211.6182
Recommendations
Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)
Cited In (12)
- Hitting time asymptotics for hard-core interactions on grids
- Percolation games, probabilistic cellular automata, and the hard-core model
- Title not available (Why is that?)
- Tunneling of the hard-core model on finite triangular lattices
- Spectral independence in high-dimensional expanders and applications to the hardcore model
- Algorithms to approximately count and sample conforming colorings of graphs
- Correlation decay for hard spheres via Markov chains
- Sampling weighted perfect matchings on the square-octagon lattice
- Correlation decay and the absence of zeros property of partition functions
- Phase coexistence for the hard-core model on \(\mathbb{Z}^2\)
- Algorithms and Computation
- Slow Mixing of Markov Chains Using Fault Lines and Fat Contours
This page was built for publication: Phase coexistence and slow mixing for the hard-core model on \(\mathbb Z^{2}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2851872)