Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model
Nima Anari, Kuikui Liu, Shayan Oveis Gharan
Abstract
We say a probability distribution is spectrally independent if an associated pairwise influence matrix has a bounded largest eigenvalue for the distribution and all of its conditional distributions. We prove that if is spectrally independent, then the corresponding high-dimensional simplicial complex is a local spectral expander. Using a line of recent works on mixing time of high-dimensional walks on simplicial complexes [T. Kaufman and D. Mass, Proceedings of ITCS, 2017, pp. 4:1–4:27; I. Dinur and T. Kaufman, Proceedings of the IEEE 58th Annual Symposium on Foundations of Computer Science, 2017, pp. 974–985; T. Kaufman and I. Oppenheim, Proceedings of APPROX/RANDOM, 2018, pp. 47:1–47:17; V. L. Alev and L. C. Lau, Proceedings of the 52nd Annual ACM Symposium on Theory of Computing, 2020], this implies that the corresponding Glauber dynamics mixes rapidly and generates (approximate) samples from . As an application, we show that natural Glauber dynamics mixes rapidly (in polynomial time) to generate a random independent set from the hardcore model up to the uniqueness threshold. This improves the quasi-polynomial running time of Weitz's deterministic correlation decay algorithm [D. Weitz, Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006, pp. 140–149] for estimating the hardcore partition function, also answering a long-standing open problem of mixing time of Glauber dynamics [M. Luby and E. Vigoda, Proceedings of the 29th Annual ACM Symposium on Theory of Computing, 1997, pp. 682–687; M. Luby and E. Vigoda, Random Structures Algorithms, 15 (1999), pp. 229–241; M. Dyer and C. Greenhill, J. Algorithms, 35 (2000), pp. 17–49; E. Vigoda, Electron. J. Combin., 8 (2001); C. Efthymiou et al., Proceedings of FOCS, 2016, pp. 704–713].
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers58
- Good Quantum LDPC Codes with Linear Time DecodersIrit Dinur, Min-Hsiu Hsieh, Ting-Chun Lin, Thomas VidickSTOC 2023 · 83 citations
- Optimal mixing of Glauber dynamics: entropy factorization via high-dimensional expansionZongchen Chen, Kuikui Liu, Eric VigodaSTOC 2021 · 61 citations
- Localization Schemes: A Framework for Proving Mixing Bounds for Markov Chains (extended abstract)Yuansi Chen, Ronen EldanFOCS 2022 · 42 citations
- On Mixing of Markov Chains: Coupling, Spectral Independence, and Entropy FactorizationAntonio Blanca, Pietro Caputo, Zongchen Chen, Daniel Parisi et al.SODA 2022 · 41 citations
- Rapid Mixing of Glauber Dynamics up to Uniqueness via ContractionZongchen Chen, Kuikui Liu, Eric VigodaFOCS 2020 · 38 citations
Builds on4
- Rapid Mixing of Glauber Dynamics up to Uniqueness via ContractionZongchen Chen, Kuikui Liu, Eric VigodaFOCS 2020 · 38 citations
- Rapid Mixing for Colorings via Spectral IndependenceZongchen Chen, Andreas Galanis, Daniel Stefankovic, Eric VigodaSODA 2021 · 37 citations
- Rapid Mixing from Spectral Independence beyond the Boolean DomainWeiming Feng, Heng Guo, Yitong Yin, Chihao ZhangSODA 2021 · 18 citations
- Improved analysis of higher order random walks and applicationsVedat Levi Alev, Lap Chi LauSTOC 2020 · 6 citations
Related papers
- Rapid mixing of Glauber dynamics via spectral independence for all degreesXiaoyu Chen, Weiming Feng, Yitong Yin, Xinyuan ZhangFOCS 2021 · 16 citations
- On sampling two spin models using the local connective constantCharilaos EfthymiouSODA 2026
- A Matrix Trickle-Down Theorem on Simplicial Complexes and Applications to Sampling ColoringsDorna Abdolazimi, Kuikui Liu, Shayan Oveis GharanFOCS 2021 · 4 citations
- Rapid Mixing on Random Regular Graphs beyond UniquenessXiaoyu Chen, Zejia Chen, Zongchen Chen, Yitong Yin et al.FOCS 2025 · 1 citation
- Uniqueness and Rapid Mixing in the Bipartite Hardcore Model (extended abstract)Xiaoyu Chen, Jingcheng Liu, Yitong YinFOCS 2023 · 1 citation
