2019
DOI: 10.1007/s00440-019-00913-5
|View full text |Cite
|
Sign up to set email alerts
|

Polynomial mixing time of edge flips on quadrangulations

Abstract: We establish the first polynomial upper bound for the mixing time of random edge flips on rooted quadrangulations: we show that the spectral gap of the edge flip Markov chain on quadrangulations with n faces admits, up to constants, an upper bound of n −5/4 and a lower bound of n −11/2 . In order to obtain the lower bound, we also consider a very natural Markov chain on plane trees -or, equivalently, on Dyck paths -and improve the previous lower bound for its spectral gap by Shor and Movassagh.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
33
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
3
2

Relationship

4
1

Authors

Journals

citations
Cited by 7 publications
(33 citation statements)
references
References 29 publications
(49 reference statements)
0
33
0
Order By: Relevance
“…We provide the first polynomial upper bound for the mixing time of this "edge rotation" chain on planar maps: we show that the spectral gap of the edge rotation chain is bounded below by an appropriate constant times n −11/2 . In doing so, we provide a partially new proof of the fact that the same bound applies to the spectral gap of edge flips on quadrangulations as defined in [8], which makes it possible to generalise the result of [8] to a variant of the edge flip chain related to edge rotations via Tutte's bijection.…”
mentioning
confidence: 92%
See 4 more Smart Citations
“…We provide the first polynomial upper bound for the mixing time of this "edge rotation" chain on planar maps: we show that the spectral gap of the edge rotation chain is bounded below by an appropriate constant times n −11/2 . In doing so, we provide a partially new proof of the fact that the same bound applies to the spectral gap of edge flips on quadrangulations as defined in [8], which makes it possible to generalise the result of [8] to a variant of the edge flip chain related to edge rotations via Tutte's bijection.…”
mentioning
confidence: 92%
“…But triangulations of the n-gon are not the only structures that are well-suited to supporting an edge flip chain, though they provide perhaps the simplest possible example; edge flip dynamics have been considered for example on lattice triangulations [6,7,13] and rectangular dissections [5,4]. Recently, Alexandre Stauffer and the author proved a polynomial upper bound for the mixing time of edge flips on quadrangulations of the sphere [8].…”
Section: Introductionmentioning
confidence: 99%
See 3 more Smart Citations