Entropic independence: optimal mixing of down-up random walks

DOI10.1145/3519935.3520048OpenAlexW4282003860MaRDI QIDQ6083597FDOQ6083597

Authors: Nima Anari, Vishesh Jain, Frederic Koehler, Huy-Tuan Pham, Thuy Duong Vuong 

Publication date: 8 December 2023

Published in: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3519935.3520048

zbMATH Keywords

Markov chainIsing modelmixing timehardcore modelhigh-dimensional expandersmodified log-Sobolev inequalityentropy contraction

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited In (3)

• The threshold energy of low temperature Langevin dynamics for pure spherical spin glasses
• Mixing k-Fold Independent Processes of Zero Entropy
• Complexity theory. Abstracts from the workshop held June 2--7, 2024

This page was built for publication: Entropic independence: optimal mixing of down-up random walks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6083597)