A polynomial upper bound for the mixing time of edge rotations on planar maps
From MaRDI portal
Publication:2024501
DOI10.1214/20-EJP519zbMath1469.60227arXiv2001.04166MaRDI QIDQ2024501
Publication date: 4 May 2021
Published in: Electronic Journal of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.04166
Interacting random processes; statistical mechanics type models; percolation theory (60K35) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Tilings in (2) dimensions (aspects of discrete geometry) (52C20)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dynamics of lattice triangulations on thin rectangles
- A Lyapunov function for Glauber dynamics on lattice triangulations
- Polynomial mixing time of edge flips on quadrangulations
- Random lattice triangulations: structure and algorithms
- Logarithmic Sobolev inequalities for finite Markov chains
- Triangulating the Circle, at Random
- Mixing Time for a Markov Chain on Cladograms
- Phase Transitions in Random Dyadic Tilings and Rectangular Dissections
- Polynomial Mixing of the Edge-Flip Markov Chain for Unbiased Dyadic Tilings
This page was built for publication: A polynomial upper bound for the mixing time of edge rotations on planar maps