Document Open Access Logo

Improved Mixing for the Convex Polygon Triangulation Flip Walk

Authors David Eppstein, Daniel Frishberg

PDF

File

Thumbnail PDF
PDF
LIPIcs.ICALP.2023.56.pdf
  • Filesize: 1.05 MB
  • 17 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Approximation algorithms analysis
Keywords
  • associahedron
  • mixing time
  • mcmc
  • Markov chains
  • triangulations
  • quadrangulations
  • k-angulations
  • multicommodity flow
  • projection-restriction

Metrics

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

Abstract

We prove that the well-studied triangulation flip walk on a convex point set mixes in time O(n³ log³ n), the first progress since McShine and Tetali’s O(n⁵ log n) bound in 1997. In the process we give lower and upper bounds of respectively Ω(1/(√n log n)) and O(1/√n) - asymptotically tight up to an O(log n) factor - for the expansion of the associahedron graph K_n. The upper bound recovers Molloy, Reed, and Steiger’s Ω(n^(3/2)) bound on the mixing time of the walk. To obtain these results, we introduce a framework consisting of a set of sufficient conditions under which a given Markov chain mixes rapidly. This framework is a purely combinatorial analogue that in some circumstances gives better results than the projection-restriction technique of Jerrum, Son, Tetali, and Vigoda. In particular, in addition to the result for triangulations, we show quasipolynomial mixing for the k-angulation flip walk on a convex point set, for fixed k ≥ 4.

Cite As Get BibTex

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). Leibniz International Proceedings in Informatics (LIPIcs), Volume 261, pp. 56:1-56:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023) https://doi.org/10.4230/LIPIcs.ICALP.2023.56

Author Details

David Eppstein
  • Department of Computer Science, University of California, Irvine, CA, USA
Daniel Frishberg
  • Department of Computer Science, University of California, Irvine, CA, USA

References

  1. Nima Anari, Kuikui Liu, and Shayan Oveis Gharan. Spectral independence in high-dimensional expanders and applications to the hardcore model. In 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), pages 1319-1330, 2020. URL: https://doi.org/10.1109/FOCS46700.2020.00125.
  2. 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.
  3. 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.
  4. Emile E. Anclin. An upper bound for the number of planar lattice triangulations. Journal of Combinatorial Theory, Series A, 103(2):383-386, 2003. URL: https://doi.org/10.1016/S0097-3165(03)00097-9.
  5. Pietro Caputo, Fabio Martinelli, Alistair Sinclair, and Alexandre Stauffer. Dynamics of lattice triangulations on thin rectangles. Electronic Journal of Probability, 21, May 2015. URL: https://doi.org/10.1214/16-EJP4321.
  6. Pietro Caputo, Fabio Martinelli, Alistair Sinclair, and Alexandre Stauffer. Random lattice triangulations: structure and algorithms. Annals of Applied Probability, 25:1650-1685, 2015. Google Scholar
  7. Alessandra Caraceni and Alexandre Stauffer. Polynomial mixing time of edge flips on quadrangulations. Probability Theory and Related Fields, 176(1):35-76, February 2020. URL: https://doi.org/10.1007/s00440-019-00913-5.
  8. Zongchen Chen, Andreas Galanis, Daniel Štefankovič, and Eric Vigoda. Rapid mixing for colorings via spectral independence. In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1548-1557, 2021. URL: https://doi.org/10.1137/1.9781611976465.94.
  9. Zongchen Chen, Kuikui Liu, and Eric Vigoda. Rapid mixing of Glauber dynamics up to uniqueness via contraction, 2020. URL: https://arxiv.org/abs/2004.09083.
  10. Zongchen Chen, Kuikui Liu, and Eric Vigoda. Optimal mixing of glauber dynamics: Entropy factorization via high-dimensional expansion. In Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, pages 1537-1550, 2021. Google Scholar
  11. Christopher M De Sa, Ce Zhang, Kunle Olukotun, and Christopher Ré. Rapidly Mixing Gibbs Sampling for a Class of Factor Graphs Using Hierarchy Width. In C. Cortes, N. Lawrence, D. Lee, M. Sugiyama, and R. Garnett, editors, Advances in Neural Information Processing Systems, volume 28. Curran Associates, Inc., 2015. URL: https://proceedings.neurips.cc/paper/2015/file/b29eed44276144e4e8103a661f9a78b7-Paper.pdf.
  12. Persi Diaconis and Laurent Saloff-Coste. Comparison theorems for reversible markov chains. The Annals of Applied Probability, 3(3):696-730, 1993. Google Scholar
  13. Persi Diaconis and Daniel Stroock. Geometric Bounds for Eigenvalues of Markov Chains. The Annals of Applied Probability, 1(1):36-61, 1991. URL: https://doi.org/10.1214/aoap/1177005980.
  14. Martin Dyer, Leslie Ann Goldberg, and Mark Jerrum. Matrix norms and rapid mixing for spin systems. The Annals of Applied Probability, 19(1):71-107, 2009. URL: http://www.jstor.org/stable/30243572.
  15. David Eppstein and Daniel Frishberg. Rapid mixing of the hardcore Glauber dynamics and other Markov chains in bounded-treewidth graphs. CoRR, 2021. URL: https://doi.org/10.48550/arXiv.2111.03898.
  16. David Eppstein and Daniel Frishberg. Improved mixing for the convex polygon triangulation flip walk. CoRR, abs/2207.09972, 2022. URL: https://doi.org/10.48550/arXiv.2207.09972.
  17. F. Graham and P. Tetali. Isoperimetric inequalities for cartesian products of graphs. Comb. Probab. Comput., 7:141-148, 1998. Google Scholar
  18. Marc Heinrich. Glauber dynamics for colourings of chordal graphs and graphs of bounded treewidth, 2020. URL: https://arxiv.org/abs/2010.16158.
  19. Peter J. Hilton and Jean J. Pedersen. Catalan numbers, their generalization, and their uses. The Mathematical Intelligencer, 13:64-75, 1991. Google Scholar
  20. Mark Jerrum and Alistair Sinclair. Conductance and the rapid mixing property for Markov chains: The approximation of permanent resolved. In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, STOC '88, 1988. URL: https://doi.org/10.1145/62212.62234.
  21. 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.
  22. V. Kaibel and G. Ziegler. Counting lattice triangulations. arXiv: Combinatorics, 2002. Google Scholar
  23. Volker Kaibel. On the expansion of graphs of 0/1-polytopes. In The Sharpest Cut: The Impact of Manfred Padberg and His Work, pages 199-216. SIAM, 2004. Google Scholar
  24. Tali Kaufman and Izhar Oppenheim. High order random walks: Beyond spectral gap. Combinatorica, 40(2):245-281, 2020. Google Scholar
  25. David A. Klarner. Correspondences between plane trees and binary sequences. Journal of Combinatorial Theory, 9(4):401-411, 1970. URL: https://doi.org/10.1016/S0021-9800(70)80093-X.
  26. Vedat Levi Alev and Lap Chi Lau. Improved analysis of higher order random walks and applications. arXiv e-prints, 2020. URL: https://arxiv.org/abs/2001.02827.
  27. David A Levin, Yuval Peres, and Elizabeth Wilmer. Markov chains and mixing times, volume 107. American Mathematical Soc., 2017. Google Scholar
  28. J. Loday. The multiple facets of the associahedron. In Proc. 2005 Academy Coll. Series, 2005. Google Scholar
  29. 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
  30. Milena Mihail and Umesh Vazirani. On the expansion of 0-1 polytopes. Journal of Combinatorial Theory, Series B, 1989. Google Scholar
  31. Michael Molloy, Bruce Reed, and William Steiger. On the mixing rate of the triangulation walk. In Randomization Methods in Algorithm Design, 1997. Google Scholar
  32. Dana Randall and Prasad Tetali. Analyzing glauber dynamics by comparison of markov chains. In Latin American Symposium on Theoretical Informatics, pages 292-304. Springer, 1998. Google Scholar
  33. 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.
  34. Daniel D Sleator, Robert E Tarjan, and William P Thurston. Rotation distance, triangulations, and hyperbolic geometry. Journal of the American Mathematical Society, 1(3):647-681, 1988. Google Scholar
  35. Alexandre Stauffer. A Lyapunov function for Glauber dynamics on lattice triangulations. Probability Theory and Related Fields, 169:469-521, 2015. Google Scholar
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-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact