Document Open Access Logo

Rapid Mixing for the Hardcore Glauber Dynamics and Other Markov Chains in Bounded-Treewidth Graphs

Authors David Eppstein, Daniel Frishberg

PDF
Thumbnail PDF

File

LIPIcs.ISAAC.2023.30.pdf
  • Filesize: 0.71 MB
  • 13 pages

Document Identifiers

Author Details

David Eppstein
  • Department of Computer Science, University of California, Irvine, CA, USA
Daniel Frishberg
  • Department of Computer Science and Software Engineering, California Polytechnic State University, San Luis Obispo, CA, USA

Acknowledgements

The authors wish to acknowledge a number of helpful conversations on this topic with Milena Mihail, Ioannis Panageas, Eric Vigoda, Charlie Carlson, and Zongchen Chen, as well as with Karthik Gajulapalli, Hadi Khodabande, and Pedro Matias.

Cite AsGet BibTex

David Eppstein and Daniel Frishberg. Rapid Mixing for the Hardcore Glauber Dynamics and Other Markov Chains in Bounded-Treewidth Graphs. In 34th International Symposium on Algorithms and Computation (ISAAC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 283, pp. 30:1-30:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
https://doi.org/10.4230/LIPIcs.ISAAC.2023.30

Abstract

We give a new rapid mixing result for a natural random walk on the independent sets of a graph G. We show that when G has bounded treewidth, this random walk - known as the Glauber dynamics for the hardcore model - mixes rapidly for all fixed values of the standard parameter λ > 0, giving a simple alternative to existing sampling algorithms for these structures. We also show rapid mixing for analogous Markov chains on dominating sets, b-edge covers, b-matchings, maximal independent sets, and maximal b-matchings. (For b-matchings, maximal independent sets, and maximal b-matchings we also require bounded degree.) Our results imply simpler alternatives to known algorithms for the sampling and approximate counting problems in these graphs. We prove our results by applying a divide-and-conquer framework we developed in a previous paper, as an alternative to the projection-restriction technique introduced by Jerrum, Son, Tetali, and Vigoda. We extend this prior framework to handle chains for which the application of that framework is not straightforward, strengthening existing results by Dyer, Goldberg, and Jerrum and by Heinrich for the Glauber dynamics on q-colorings of graphs of bounded treewidth and bounded degree.

Subject Classification

ACM Subject Classification
  • Theory of computation → Random walks and Markov chains
Keywords
  • Glauber dynamics
  • mixing time
  • projection-restriction
  • multicommodity flow

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. Nima Anari, Kuikui Liu, Shayan Oveis Gharan, and Cynthia Vinzant. Log-concave polynomials II: High-dimensional walks and an FPRAS for counting bases of a matroid. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (STOC 2019), New York, NY, USA, 2019. Association for Computing Machinery. URL: https://doi.org/10.1145/3313276.3316385.
  2. Nima Anari, Shayan Oveis Gharan, and Cynthia Vinzant. Log-concave polynomials, entropy, and a deterministic approximation algorithm for counting bases of matroids. In 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), pages 35-46, 2018. URL: https://doi.org/10.1109/FOCS.2018.00013.
  3. Noam Berger, Claire Kenyon, Elchanan Mossel, and Yuval Peres. Glauber dynamics on trees and hyperbolic graphs. Probability Theory and Related Fields, 131:311-340, 2005. URL: https://doi.org/s00440-004-0369-4.
  4. Hans L. Bodlaender. Fixed-parameter tractability of treewidth and pathwidth. In The Multivariate Algorithmic Revolution and Beyond: Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday, volume 7370 of Lecture Notes in Computer Science, pages 196-227. Springer, 2012. URL: https://doi.org/10.1007/978-3-642-30891-8_12.
  5. David Eppstein and Daniel Frishberg. Rapid mixing of the hardcore Glauber dynamics and other Markov chains in bounded-treewidth graphs. arXiv preprint, 2021. URL: https://doi.org/10.48550/arXiv.2111.03898.
  6. David Eppstein and Daniel Frishberg. Improved Mixing for the Convex Polygon Triangulation Flip Walk. In 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023), volume 261, pages 56:1-56:17, 2023. URL: https://doi.org/10.4230/LIPIcs.ICALP.2023.56.
  7. Jeff Erickson. Computational topology: Treewidth. Lecture Notes, 2009. URL: http://jeffe.cs.illinois.edu/teaching/comptop/2009/notes/treewidth.pdf.
  8. F. Graham and P. Tetali. Isoperimetric inequalities for cartesian products of graphs. Comb. Probab. Comput., 7:141-148, 1998. Google Scholar
  9. Venkatesan Guruswami. Rapidly mixing markov chains: A comparison of techniques (a survey). arXiv, 2016. URL: https://arxiv.org/abs/1603.01512.
  10. Marc Heinrich. Glauber dynamics for colourings of chordal graphs and graphs of bounded treewidth, 2020. URL: https://arxiv.org/abs/2010.16158.
  11. Mark Jerrum, Jung-Bae Son, Prasad Tetali, and Eric Vigoda. Elementary bounds on Poincaré and log-Sobolev constants for decomposable Markov chains. The Annals of Applied Probability, 14(4):1741-1765, 2004. URL: http://www.jstor.org/stable/4140446.
  12. David A Levin, Elizabeth Wilmer, and Yuval Peres. Markov chains and mixing times, volume 107. American Mathematical Society, 2009. URL: https://bookstore.ams.org/mbk-58.
  13. Neal Madras and Dana Randall. Markov chain decomposition for convergence rate analysis. The Annals of Applied Probability, 12(2):581-606, 2002. URL: https://doi.org/10.1214/aoap/1026915617.
  14. Fabio Martinelli, Alistair Sinclair, and Dror Weitz. Fast mixing for independent sets, colorings, and other models on trees. Random Structures & Algorithms, 31(2):134-172, 2007. URL: https://doi.org/10.1002/rsa.20132.
  15. Lisa McShine and P. Tetali. On the mixing time of the triangulation walk and other catalan structures. In Randomization Methods in Algorithm Design, 1997. Google Scholar
  16. Milena Mihail and Umesh Vazirani. On the expansion of 0-1 polytopes. Journal of Combinatorial Theory, Series B, 1989. Google Scholar
  17. Ben Morris and Alistair Sinclair. Random walks on truncated cubes and sampling 0-1 knapsack solutions. SIAM journal on computing, 34(1):195-226, 2004. Google Scholar
  18. Neil Robertson and P.D Seymour. Graph minors. ii. algorithmic aspects of tree-width. Journal of Algorithms, 7(3):309-322, 1986. URL: https://doi.org/10.1016/0196-6774(86)90023-4.
  19. Alistair Sinclair. Improved bounds for mixing rates of Markov chains and multicommodity flow. Combinatorics, Probability and Computing, 1(4):351-370, 1992. URL: https://doi.org/10.1017/S0963548300000390.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact