Sampling independent sets in the discrete torus

DOI10.1002/rsa.20223zbMath1219.60083arXiv1007.4822OpenAlexW4229677283MaRDI QIDQ3608300

David Galvin

Publication date: 4 March 2009

Published in: Random Structures and Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1007.4822

zbMATH Keywords

Glauber dynamicsmixing timeindependent setsdiscrete torushard-core modelconductancePeierl's argument

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Related Items (10)

Hitting time asymptotics for hard-core interactions on grids ⋮ Odd cutsets and the hard-core model on \(\mathbb{Z}^{d}\) ⋮ Homomorphisms from the torus ⋮ Rigidity of proper colorings of \(\mathbb{Z}^d \) ⋮ The Growth Constant of Odd Cutsets in High Dimensions ⋮ \(H\)-coloring tori ⋮ Phase Coexistence for the Hard-Core Model on ℤ² ⋮ Spatio-spectral limiting on discrete tori: adjacency invariant spaces ⋮ Tunneling of the hard‐core model on finite triangular lattices ⋮ Phase coexistence and torpid mixing in the 3-coloring model on ${\mathbb Z}^d$

Cites Work

• Unnamed Item
• Loss networks
• Percolation and the hard-core lattice gas model
• Counting independent sets up to the tree threshold
• On Counting Independent Sets in Sparse Graphs
• Investigation of Gibbsian States for Three-Dimensional Lattice Systems
• Fast convergence of the Glauber dynamics for sampling independent sets
• On Phase Transition in the Hard-Core Model on ${\mathbb Z}^d$
• On Markov Chains for Independent Sets
• Slow mixing of Glauber dynamics for the hard‐core model on regular bipartite graphs
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

This page was built for publication: Sampling independent sets in the discrete torus