Document Open Access Logo

Rapid Mixing of the Flip Chain over Non-Crossing Spanning Trees

Authors Konrad Anand , Weiming Feng , Graham Freifeld , Heng Guo , Mark Jerrum , Jiaheng Wang

PDF

File

Thumbnail PDF
PDF
LIPIcs.SoCG.2025.8.pdf
  • Filesize: 1.89 MB
  • 18 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Random walks and Markov chains
  • Theory of computation → Computational geometry
Keywords
  • non-crossing spanning trees
  • Markov chain
  • mixing time

Metrics

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

Abstract

We show that the flip chain for non-crossing spanning trees of n+1 points in convex position mixes in time O(n⁸log n). We use connections between Fuss-Catalan structures to construct a comparison argument with a chain similar to Wilson’s lattice path chain (Wilson 2004).

Cite As Get BibTex

Konrad Anand, Weiming Feng, Graham Freifeld, Heng Guo, Mark Jerrum, and Jiaheng Wang. Rapid Mixing of the Flip Chain over Non-Crossing Spanning Trees. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 8:1-8:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.SoCG.2025.8

Author Details

Konrad Anand
  • School of Informatics, Informatics Forum, University of Edinburgh, UK
Weiming Feng
  • School of Computing and Data Science, The University of Hong Kong, China
Graham Freifeld
  • School of Informatics, Informatics Forum, University of Edinburgh, UK
Heng Guo
  • School of Informatics, Informatics Forum, University of Edinburgh, UK
Mark Jerrum
  • School of Mathematical Sciences, Queen Mary University of London, UK
Jiaheng Wang
  • Faculty of Informatics and Data Science, University of Regensburg, Germany

Funding

This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No. 947778). Views and opinions expressed are those of the author(s) only and do not necessarily reflect those of the European Union or the European Research Council Executive Agency. Neither the European Union nor the granting authority can be held responsible for them.
  • Feng, Weiming: Weiming Feng acknowledges the support of Dr. Max Rössler, the Walter Haefner Foundation, and the ETH Zürich Foundation during his affiliation at ETH Zürich.
  • Wang, Jiaheng: Jiaheng Wang also acknowledges support from ERC (grant agreement No. 101077083, CountHom).

References

  1. Oswin Aichholzer, Brad Ballinger, Therese Biedl, Mirela Damian, Erik D. Demaine, Matias Korman, Anna Lubiw, Jayson Lynch, Josef Tkadlec, and Yushi Uno. Reconfiguration of non-crossing spanning trees. arXiv, abs/2206.03879, 2022. URL: https://doi.org/10.48550/arXiv.2206.03879.
  2. Victor Alvarez, Karl Bringmann, Radu Curticapean, and Saurabh Ray. Counting triangulations and other crossing-free structures via onion layers. Discret. Comput. Geom., 53(4):675-690, 2015. URL: https://doi.org/10.1007/S00454-015-9672-3.
  3. Victor Alvarez, Karl Bringmann, Saurabh Ray, and Raimund Seidel. Counting triangulations and other crossing-free structures approximately. Comput. Geom., 48(5):386-397, 2015. URL: https://doi.org/10.1016/J.COMGEO.2014.12.006.
  4. Konrad Anand, Weiming Feng, Graham Freifeld, Heng Guo, Mark Jerrum, and Jiaheng Wang. Rapid mixing of the flip chain over non-crossing spanning trees. arXiv, abs/2409.07892, 2024. URL: https://doi.org/10.48550/arXiv.2409.07892.
  5. Nima Anari, Kuikui Liu, and Shayan Oveis Gharan. Spectral independence in high-dimensional expanders and applications to the hardcore model. In FOCS, pages 1319-1330. IEEE, 2020. URL: https://doi.org/10.1109/FOCS46700.2020.00125.
  6. 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 STOC, pages 1-12. ACM, 2019. URL: https://doi.org/10.1145/3313276.3316385.
  7. Federico Ardila. The Catalan matroid. J. Comb. Theory, Ser. A, 104(1):49-62, 2003. URL: https://doi.org/10.1016/S0097-3165(03)00121-3.
  8. David Avis and Komei Fukuda. Reverse search for enumeration. Discret. Appl. Math., 65(1-3):21-46, 1996. URL: https://doi.org/10.1016/0166-218X(95)00026-N.
  9. Elia Bisi, Piotr Dyszewski, Nina Gantert, Samuel G. G. Johnston, Joscha Prochno, and Dominik Schmid. Random planar trees and the Jacobian conjecture. arXiv, abs/2301.08221, 2023. URL: https://arxiv.org/abs/2301.08221.
  10. Håvard Bakke Bjerkevik, Linda Kleist, Torsten Ueckerdt, and Birgit Vogtenhuber. Flipping non-crossing spanning trees. In SODA, pages 2313-2325. SIAM, 2025. URL: https://doi.org/10.1137/1.9781611978322.77.
  11. Nicolas Bousquet, Lucas de Meyer, Théo Pierron, and Alexandra Wesolek. Reconfiguration of plane trees in convex geometric graphs. In SoCG, volume 293 of LIPIcs, pages 22:1-22:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. URL: https://doi.org/10.4230/LIPICS.SOCG.2024.22.
  12. Nicolas Bousquet, Valentin Gledel, Jonathan Narboni, and Théo Pierron. A note on the flip distance between non-crossing spanning trees. Comput. Geom. Topol., 2(1):8:1-8:7, 2023. URL: https://www.cgt-journal.org/index.php/cgt/article/view/36.
  13. Sergey Bravyi, Libor Caha, Ramis Movassagh, Daniel Nagaj, and Peter W. Shor. Criticality without frustration for quantum spin-1 chains. Physical review letters, 109(20):207202, 2012. Google Scholar
  14. Thomas Budzinski. On the mixing time of the flip walk on triangulations of the sphere. C. R. Math. Acad. Sci. Paris, 355(4):464-471, 2017. URL: https://doi.org/10.1016/j.crma.2017.02.011.
  15. Pietro Caputo, Fabio Martinelli, Alistair Sinclair, and Alexandre Stauffer. Random lattice triangulations: structure and algorithms. Ann. Appl. Probab., 25(3):1650-1685, 2015. URL: https://doi.org/10.1214/14-AAP1033.
  16. Alessandra Caraceni and Alexandre Stauffer. Polynomial mixing time of edge flips on quadrangulations. Probab. Theory Related Fields, 176(1-2):35-76, 2020. Google Scholar
  17. Swee Hong Chan and Igor Pak. Computational complexity of counting coincidences. Theor. Comput. Sci., 1015:114776, 2024. URL: https://doi.org/10.1016/J.TCS.2024.114776.
  18. Emma Cohen. Problems in Catalan mixing and matchings in regular hypergraphs. PhD thesis, Georgia Institute of Technology, 2016. Google Scholar
  19. Mary Cryan, Heng Guo, and Giorgos Mousa. Modified log-Sobolev inequalities for strongly log-concave distributions. Ann. Probab., 49(1):506-525, 2021. Google Scholar
  20. Dimitrios I. Dais. Resolving 3-dimensional toric singularities. In Geometry of toric varieties, volume 6 of Sémin. Congr., pages 155-186. Soc. Math. France, Paris, 2002. Google Scholar
  21. Jesús A. De Loera, Jörg Rambau, and Francisco Santos. Triangulations, volume 25 of Algorithms and Computation in Mathematics. Springer-Verlag, Berlin, 2010. Structures for algorithms and applications. Google Scholar
  22. Mehmet Demirtas, Liam McAllister, and Andres Rios-Tascon. Bounding the Kreuzer-Skarke landscape. Fortschr. Phys., 68(11-12):2000086, 13, 2020. URL: https://doi.org/10.1002/prop.202000086.
  23. Persi Diaconis and Laurent Saloff-Coste. Comparison theorems for reversible Markov chains. Ann. Appl. Probab., 3(3):696-730, 1993. Google Scholar
  24. Martin E. Dyer, Alan M. Frieze, and Ravi Kannan. A random polynomial time algorithm for approximating the volume of convex bodies. J. ACM, 38(1):1-17, 1991. URL: https://doi.org/10.1145/102782.102783.
  25. David Eppstein. Counting polygon triangulations is hard. Discret. Comput. Geom., 64(4):1210-1234, 2020. URL: https://doi.org/10.1007/S00454-020-00251-7.
  26. David Eppstein and Daniel Frishberg. Improved mixing for the convex polygon triangulation flip walk. In ICALP, volume 261 of LIPIcs, pages 56:1-56:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. URL: https://doi.org/10.4230/LIPICS.ICALP.2023.56.
  27. I. M. Gelfand, M. M. Kapranov, and A. V. Zelevinsky. Discriminants, resultants and multidimensional determinants. Modern Birkhäuser Classics. Birkhäuser Boston, Inc., Boston, MA, 2008. Reprint of the 1994 edition. Google Scholar
  28. M. Carmen Hernando, Ferran Hurtado, Alberto Márquez, Mercè Mora, and Marc Noy. Geometric tree graphs of points in convex position. Discret. Appl. Math., 93(1):51-66, 1999. URL: https://doi.org/10.1016/S0166-218X(99)00006-2.
  29. Vishesh Jain, Marcus Michelen, Huy Tuan Pham, and Thuy-Duong Vuong. Optimal mixing of the down-up walk on independent sets of a given size. In FOCS, pages 1665-1681. IEEE, 2023. URL: https://doi.org/10.1109/FOCS57990.2023.00101.
  30. Mark Jerrum and Alistair Sinclair. Approximating the permanent. SIAM J. Comput., 18(6):1149-1178, 1989. URL: https://doi.org/10.1137/0218077.
  31. Mark Jerrum and Alistair Sinclair. Polynomial-time approximation algorithms for the Ising model. SIAM J. Comput., 22(5):1087-1116, 1993. URL: https://doi.org/10.1137/0222066.
  32. J. Jurkiewicz, A. Krzywicki, and B. Petersson. A numerical study of discrete Euclidean Polyakov surfaces. Physics Letters B, 168(3):273-278, 1986. URL: https://doi.org/10.1016/0370-2693(86)90978-0.
  33. Volker Kaibel and Günter M. Ziegler. Counting lattice triangulations. In Surveys in combinatorics, 2003 (Bangor), volume 307 of London Math. Soc. Lecture Note Ser., pages 277-307. Cambridge Univ. Press, Cambridge, 2003. Google Scholar
  34. Marek Karpinski, Andrzej Lingas, and Dzmitry Sledneu. A QPTAS for the base of the number of crossing-free structures on a planar point set. Theor. Comput. Sci., 711:56-65, 2018. URL: https://doi.org/10.1016/J.TCS.2017.11.003.
  35. V.A. Kazakov, I.K. Kostov, and A.A. Migdal. Critical properties of randomly triangulated planar random surfaces. Physics Letters B, 157(4):295-300, 1985. URL: https://doi.org/10.1016/0370-2693(85)90669-0.
  36. David A. Levin and Yuval Peres. Markov Chains and Mixing Times. American Mathematical Society, 2017. Google Scholar
  37. Russell A. Martin and Dana Randall. Sampling adsorbing staircase walks using a new Markov chain decomposition method. In FOCS, pages 492-502. IEEE Computer Society, 2000. URL: https://doi.org/10.1109/SFCS.2000.892137.
  38. Lisa McShine and Prasad Tetali. On the mixing time of the triangulation walk and other Catalan structures. In Randomization Methods in Algorithm Design, volume 43 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 147-160. DIMACS/AMS, 1997. URL: https://doi.org/10.1090/DIMACS/043/09.
  39. Michael Molloy, Bruce Reed, and William Steiger. On the mixing rate of the triangulation walk. In Randomization Methods in Algorithm Design, volume 43 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 179-190. DIMACS/AMS, 1997. URL: https://doi.org/10.1090/DIMACS/043/11.
  40. Ramis Movassagh. The gap of Fredkin quantum spin chain is polynomially small. Ann. Math. Sci. Appl., 3(2):531-562, 2018. URL: https://doi.org/10.4310/AMSA.2018.v3.n2.a5.
  41. Ramis Movassagh and Peter W. Shor. Supercritical entanglement in local systems: Counterexample to the area law for quantum matter. Proceedings of the National Academy of Sciences, 113(47):13278-13282, 2016. URL: https://doi.org/10.1073/pnas.1605716113.
  42. Marc Noy. Enumeration of noncrossing trees on a circle. Discret. Math., 180(1-3):301-313, 1998. URL: https://doi.org/10.1016/S0012-365X(97)00121-0.
  43. Micha Sharir and Adam Sheffer. Counting triangulations of planar point sets. Electron. J. Comb., 18(1), 2011. URL: https://doi.org/10.37236/557.
  44. Micha Sharir, Adam Sheffer, and Emo Welzl. On degrees in random triangulations of point sets. J. Comb. Theory, Ser. A, 118(7):1979-1999, 2011. URL: https://doi.org/10.1016/J.JCTA.2011.04.002.
  45. Richard P. Stanley. Enumerative combinatorics. Vol. 2, volume 62 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, 1999. Google Scholar
  46. Richard P. Stanley. Catalan numbers. Cambridge University Press, New York, 2015. Google Scholar
  47. O. Ya. Viro. Real plane algebraic curves: constructions with controlled topology. Algebra i Analiz, 1(5):1-73, 1989. Google Scholar
  48. David Bruce Wilson. Mixing times of Lozenge tiling and card shuffling Markov chains. Ann. Appl. Probab., 14(1):274-325, 2004. URL: https://doi.org/10.1214/aoap/1075828054.
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