Glauber dynamics for the hard-core model on bounded-degree $H$-free graphs
Abstract: The hard-core model has as its configurations the independent sets of some graph instance $G$. The probability distribution on independent sets is controlled by a `fugacity' $\lambda>0$, with higher $\lambda$ leading to denser configurations. We investigate the mixing time of Glauber (single-site) dynamics for the hard-core model on restricted classes of bounded-degree graphs in which a particular graph $H$ is excluded as an induced subgraph. If $H$ is a subdivided claw then, for all $\lambda$, the mixing time is $O(n\log n)$, where $n$ is the order of $G$. This extends a result of Chen and Gu for claw-free graphs. When $H$ is a path, the set of possible instances is finite. For all other $H$, the mixing time is exponential in $n$ for sufficiently large $\lambda$, depending on $H$ and the maximum degree of $G$.
- Polynomial-time algorithm for maximum independent set in bounded-degree graphs with no long induced claws. In Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1448–1470. [Society for Industrial and Applied Mathematics (SIAM)], Philadelphia, PA, 2022.
- V. E. Alekseev. Polynomial algorithm for finding the largest independent sets in graphs without forks. Discrete Appl. Math., 135(1-3):3–16, 2004. Russian translations. II.
- N. Alon. Eigenvalues and expanders. Combinatorica, 6(2):83–96, 1986. Theory of computing (Singer Island, Fla., 1984).
- Log-concave polynomials II: High-dimensional walks and an FPRAS for counting bases of a matroid. Ann. of Math. (2), 199(1):259–299, 2024.
- L. A. Bassalygo. Asymptotically optimal switching circuits. Problemy Peredachi Informatsii, 17(3):81–88, 1981.
- Ferenc Bencs. Graphs, Groups and Measures. PhD thesis, Central European University, 2019.
- Fast sampling of b𝑏bitalic_b-matchings and b𝑏bitalic_b-edge covers. In Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 4972–4987. SIAM, Philadelphia, PA, 2024.
- Optimal mixing of Glauber dynamics: entropy factorization via high-dimensional expansion. In STOC ’21—Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, pages 1537–1550. ACM, New York, [2021] ©2021.
- Rapid mixing of Glauber dynamics up to uniqueness via contraction. SIAM J. Comput., 52(1):196–237, 2023.
- Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in H𝐻Hitalic_H-Free Graphs. SIAM J. Comput., 53(1):47–86, 2024.
- Modified log-Sobolev inequalities for strongly log-concave distributions. Ann. Probab., 49(1):506–525, 2021.
- Counting weighted independent sets beyond the permanent. SIAM J. Discrete Math., 35(2):1503–1524, 2021.
- S. Friedli and Y. Velenik. Statistical mechanics of lattice systems. Cambridge University Press, Cambridge, 2018. A concrete mathematical introduction.
- A general lower bound for mixing of single-site dynamics on graphs. Ann. Appl. Probab., 17(3):931–952, 2007.
- Mark Jerrum. Counting, sampling and integrating: algorithms and complexity. Lectures in Mathematics ETH Zürich. Birkhäuser Verlag, Basel, 2003.
- Markov chains and mixing times. American Mathematical Society, Providence, RI, 2009. With a chapter by James G. Propp and David B. Wilson.
- Vadim V. Lozin. Bipartite graphs without a skew star. Discrete Math., 257(1):83–100, 2002.
- James Matthews. Markov Chains for Sampling Matchings. PhD thesis, School of Informatics, University of Edinburgh, 2008. http://hdl.handle.net/1842/3072.
- Allan Sly. Computational transition at the uniqueness threshold. In 2010 IEEE 51st Annual Symposium on Foundations of Computer Science—FOCS 2010, pages 287–296. IEEE Computer Soc., Los Alamitos, CA, 2010.
- J. van den Berg and R. Brouwer. Random sampling for the monomer-dimer model on a lattice. J. Math. Phys., 41(3):1585–1597, 2000. Probabilistic techniques in equilibrium and nonequilibrium statistical physics.
- Dror Weitz. Counting independent sets up to the tree threshold. In STOC’06: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, pages 140–149. ACM, New York, 2006.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
