Slow mixing of Glauber dynamics for the hard‐core model on regular bipartite graphs
From MaRDI portal
Publication:5486322
DOI10.1002/rsa.20094zbMath1105.05064arXiv1206.3165OpenAlexW2952032359MaRDI QIDQ5486322
Publication date: 6 September 2006
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1206.3165
Random graphs (graph-theoretic aspects) (05C80) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial probability (60C05)
Related Items
Hitting time asymptotics for hard-core interactions on grids, A Spectral Independence View on Hard Spheres via Block Dynamics, Note on the number of balanced independent sets in the Hamming cube, Fast algorithms at low temperatures via Markov chains†, Approximately counting independent sets in bipartite graphs via graph containers, Homomorphisms from the torus, Unnamed Item, Rigidity of proper colorings of \(\mathbb{Z}^d \), Probability and algorithmics: a focus on some recent developments, Independent sets in the middle two layers of Boolean lattice, Independent sets in the hypercube revisited, A general lower bound for mixing of single-site dynamics on graphs, The Growth Constant of Odd Cutsets in High Dimensions, GIBBS MEASURES ON CAYLEY TREES: RESULTS AND OPEN PROBLEMS, \(H\)-coloring tori, Sampling independent sets in the discrete torus, A Threshold Phenomenon for Random Independent Sets in the Discrete Hypercube, Tunneling of the hard‐core model on finite triangular lattices
Cites Work
