Polynomial mixing time of edge flips on quadrangulations

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\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n^{-5/4}$$\end{document} and a lower bound of n-11/2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n^{-11/2}$$\end{document}. 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.


Introduction
Our work on quadrangulation edge flips places itself in the midst of a developing area of research whose origin can be partly traced back to a question of Aldous about triangulations of the n-gon [2]. The question concerns a discrete time edge flip Markov chain analogous to the one we will introduce, defined on the state space of triangulations of the regular n-gon (i.e. on the possible sets of diagonals which partition the n-gon into triangular regions). A single step of the Markov chain, given a triangulation, consists of picking a diagonal at random, deleting it and replacing it with the opposite diagonal in the quadrilateral created by its absence. One would wish to analyse the growth of the mixing time of this chain (which is sometimes referred to as the triangulation walk) as a function of the size n of the triangulation (or, equivalently, of the size of the state space, which is exponential in n). Aldous conjectures an upper bound of n 3/2 (up to logarithmic factors in n) for the order of the relaxation time of this chain. In connection to this problem, he conjectures the same upper bound for a chain defined on n-cladograms, a type of binary tree structure with labelled leaves whose relevance also lies in its role as a formalisation of phylogenetic trees from systematic biology, which model evolutionary relationships between species [3].
An important feature of triangulations of the n-gon is the fact that they are counted by Catalan numbers: more precisely, there are C n−2 triangulations of the n-gon, where C n = 1 n+1 2n n . In fact, there is an extreme abundance of combinatorial structures which are counted by Catalan numbers, from Dyck paths to strings of matched parentheses to plane trees and beyond, with a thriving net of explicit bijections weaved between them, which often highlight surprising connections between the geometric features of different objects.
It seems therefore natural to attempt a systematic study of Markov chains defined on Catalan structures, but this task has proved very hard. For one thing, the natural notion of adjacency for different Catalan structures does not always translate well via sensible bijections, which gives rise to a rich panorama of different chains one might consider. But even concentrating on a single Markov chain has proved challenging so far, as attested by the relative scarceness of tight bounds for their mixing times, one notable exception being Wilson's result [29] for adjacent transpositions on Dyck paths.
Twenty years after a serious effort was started problems of this kind, we still do not have tight bounds for the mixing of the triangulation walk proposed by Aldous. Molloy, Reed and Steiger showed an (n 3 2 ) lower bound for its mixing time [24], while the best upper bound to date is McShine and Tetali's O(n 5 log n) obtained in [21], where they analyse Markov chains on a number of other Catalan structures. As for n-cladograms, while the conjecture Aldous made in conjunction to the triangulation walk remains open, some chains have proved easier to analyse: Aldous himself showed an upper bound of O(n 3 ) for the relaxation time of a particular chain [3], improved to O(n 2 ), which is tight, by Schweinsberg [27]; also note Löhr, Mytnik and Winter's work on the chain in the diffusion limit [20] as well as Forman, Pal, Rizzolo and Winkel's in a similar vein [17]. Furthermore, recent results for the mixing of a very natural chain on Dyck paths were obtained by Cohen, Tetali and Yeliussizov [12] by rephrasing it as a basis exchange walk on a balanced matroid.
On the other hand, for many natural chains on Catalan structures, triangulations and related objects not even a polynomial upper bound for the mixing time is known. One such example is that of lattice triangulations, where polynomial bounds are only known for biased versions of the chain [9,10,28]; see also works on rectangular dissections, for which polynomial bounds were obtained very recently [7,8].
One may also consider edge flip Markov chains on planar maps, and in particular on the set of p-angulations of the sphere of size n (with p ≥ 3), that is the set of spherically embedded connected planar multigraphs with n faces of degree p (considered equivalent under orientation-preserving homeomorphisms of the sphere). An edge flip Markov chain on this state space can be defined as follows: at each step, an edge is selected uniformly at random, erased and replaced with one of the edges that can be drawn within the face of perimeter 2 p − 2 left behind in order to form two faces of degree p. The only result shown so far for this chain pertains to the case of triangulations of the sphere ( p = 3), where the mixing time is known to be of order at least n 5 4 [6]. No polynomial upper bound on the mixing time was known, prior to this work, for any p ≥ 3.
In this paper we consider the case of rooted quadrangulations with n faces (i.e. the case p = 4, where maps are endowed with a distinguished oriented edge) and derive the first polynomial upper bound on the mixing time.
Note that quadrangulations in particular occupy a privileged position within the panorama of planar maps, mainly thanks to the famous bijections first developed by Cori, Vanquelin and Schaeffer [11,13], which encode them with (different classes of) labelled plane trees, thus placing them within the framework of (generalised) Catalan structures.
The relation with trees has been exploited to obtain both scaling and local limit results which have led to the definition and subsequent investigation of objects such as the Brownian map [18,23] and the UIPQ [14,22], providing very rich insights into the geometric structure of uniform random large quadrangulations. In fact, it has been shown that a number of classes of uniform random planar maps converge to the Brownian map, whose universality makes quadrangulations of the sphere a very useful model for a random surface. Quadrangulations and, in general, planar maps are also very much studied in physics, in the context of quantum gravity, where the edge flip Markov chain is extensively applied in simulations.
Our contribution within this paper will consist in estimating the mixing time of the edge flip Markov chain F n on the set of rooted quadrangulation of the sphere with n faces, as described above and much more thoroughly in Sect. 2. In particular, we shall prove the following.
Theorem 1 Let ν n be the spectral gap of the edge flip Markov chain F n on the set Q n of rooted quadrangulations with n faces. There are positive constants C 1 , C 2 independent of n such that C 1 n − 11 2 ≤ ν n ≤ C 2 n − 5 4 .
Consequently, the mixing time for F n is O(n 13/2 ).
The upper bound for the spectral gap is the same as Budzinski's lower bound for the mixing time of flips on triangulations (which indeed it implies for our case p = 4); the strategy by which we obtain it is quite general and would apply in a much broader context (cf. Remark 4.1).
As for the lower bound, we obtain it through a comparison (achieved with techniques developed by Diaconis and Saloff-Coste [16]) to a chain on labelled trees which arises via the aforementioned Schaeffer bijection. This chain, which has very natural interpretations on a number of Catalan structures, is a coloured generalisation of a chain on plane trees with n edges whose steps are as follows. Given a tree, pick an edge uniformly at random, and if it is a leaf, then choose one among the following three options with equal probabilities: leave the leaf intact, slide it one step to the left or slide it one step to the right (see Fig. 6). If the chosen edge is not a leaf, then do nothing. This chain is also natural in the context of Dyck paths: it is essentially equivalent to picking a vertex of the path uniformly at random and, if the vertex is a peak, translating the peak one position to the right or to the left, with equal probabilities (Fig. 7).
Though apparently not yet analysed within the scope of existing mathematical research about chains on Catalan structures, this 'leaf translation' chain is mentioned in the physics literature under the name of Fredkin spin chain, and a first lower bound of order n − 11 2 for its spectral gap is given by Movassagh [25], based on work by himself and Shor [26]. We shall partially follow their argument, which is based on the method of building canonical paths to estimate the conductance, to produce an improved lower bound of order n − 9 2 (see Theorem 4), which will be instrumental to obtain our result for flips on quadrangulations.
The paper is organised as follows. Sections 2 and 3 will provide the reader with all relevant definitions and recall some details of the Schaeffer bijection, since they will be relevant to our subsequent constructions. In Sect. 4 we give an upper bound of order n − 5 4 for the spectral gap of F n by considering the Dirichlet form evaluated at the function that gives the radius of a quadrangulation. Section 5 will acquaint the reader with the leaf translation Markov chain on plane trees (and a "leaf replanting" variant) and prove our lower bound for its spectral gap. Finally, a large portion of the paper-namely, Sect. 6-will be devoted to showing our lower bound for the spectral gap of F n via a comparison with a chain on pointed rooted quadrangulations, which bridges the gap between F n and the leaf translation Markov chain on labelled plane trees.

Edge flips on quadrangulations
Throughout this paper we shall be dealing with certain Markov chains whose configuration space is the set of quadrangulations with a fixed number of faces; in order to introduce them, let us first discuss some notation.
First and foremost, we shall be adopting some of the language of planar maps, with which we assume some familiarity: we will be referring to maps and their vertices, edges, faces, as well as corners and face contours; we shall not review any definitions but the basic one, that is: Definition 2.1 A planar map is a connected, locally finite planar multigraph endowed with a cellular embedding in the sphere S 2 , considered up to orientation-preserving homeomorphisms of the sphere itself. We will call a rooted planar map of size n a planar map with n faces, endowed with one distinguished oriented edge.
One can now define a quadrangulation of size n, or of area n, as a rooted planar map of size n all of whose faces have four corners (see Fig. 1); we shall denote the set of all quadrangulations of size n by Q n . It follows from Euler's polyhedral formula that a quadrangulation q ∈ Q n has 2n edges and n + 2 vertices; it is also worth noting that a quadrangulation is automatically bipartite, which implies that it has no loops (that is, it has no edges with only one endpoint). It may, however, have multiple edges between the same two endpoints, and edges which are adjacent to a single face; we call the latter double edges of the face they belong to, and the face which contains Fig. 1 On the left, a quadrangulation q in Q 8 ; notice that we may choose to embed it in the plane (rather than the sphere) in a canonical way by having the external face be the one lying directly to the right of the root edge. The origin of q is marked in red. To the right, the two kinds of faces in a quadrangulation-nondegenerate and degenerate-with marked corners in clockwise order. The double edge in the degenerate face is the one adjacent to c 3 , which is drawn with a thicker line (color figure online)

Fig. 2
Clockwise and counterclockwise flips for a simple and a double edge in a quadrangulation; if the edge is the root, its orientation is "preserved" as in the figure them a degenerate face. We shall often refer to the vertex that the root edge is issued from as the origin of the quadrangulation.
Given a quadrangulation q ∈ Q n and an edge e of q, we will denote by q e,+ (resp. q e,− ), the quadrangulation obtained from q by flipping edge e clockwise (resp. counterclockwise); more formally, we mean the quadrangulation given by the following procedure: • if e is adjacent to two distinct faces of q, erase e from q (thus obtaining a new face with exactly 6 corners) and replace it with the edge obtained by rotating e clockwise (resp. counterclockwise) by one corner (see Fig. 2). • if e is a double edge within a degenerate face, let v be the vertex of that face that is not an endpoint of e and let w be the endpoint of e having degree 1; erase e and replace it with an edge within the same face having endpoints v, w. If e is the root edge of q, let the newly drawn edge be the root of q e,+ (resp. q e,− ), oriented in the same way as before (with respect to w).
Throughout this paper, we will consider the Markov chain F n of quadrangulation edge flips on the state space Q n , whose transition probabilities are of the form 1 q =q e,+ + 1 q =q e,− + 1 q=q ; in other words, conditionally on F n k = q, F n k+1 can be determined by choosing an edge e of q uniformly at random and setting either F n k+1 = q, or F n k+1 = q e,+ , or F n k+1 = q e,− , with equal probabilities. Notice that, given a pair (q, q ) of distinct quadrangulations in Q n , there are at most four distinct pairs (e, s) in E(q) × {+, −} such that q = q e,s . In fact, assuming e is not the root edge of q then e is uniquely determined by the pair (q, q ), and either s is determined as well or, in the case where e is a double edge, we have q = q e,+ = q e,− . In addition, if e is not the root edge, it is possible that flipping the root edge might transform q into q ; in other words, that q = q η,+ or q = q η,− , where η = e is the root edge of q. Consequently, we have for all q, q ∈ Q n such that p(q, q ) = 0 and q = q . Notice that, given q ∈ Q n , e ∈ E(q), s ∈ {+, −}, we can naturally identify vertices of q with vertices of q e,s , and edges of q with edges of q e,s (where the edge e corresponds to the edge redrawn by the flip procedure in q e,s ); we will therefore often refer to vertices or edges using the same notation in q and q e,s , when we wish to implicitly exploit such a correspondence. This, of course, will need to be done with some care, since the correspondence is not necessarily unique when the quadrangulations q and q e,s are given, but e and s are not known.

Remark 2.1
The Markov chain F n is reversible and aperiodic: indeed, we have q = q e,+ if and only if q = (q ) e,− , so p(q, q ) = p(q , q); furthermore, we have trivially that p(q, q) ≥ 1 3 .

Lemma 2.1 The Markov chain F n is irreducible.
Proof Let q 0 be the quadrangulation with n degenerate faces and such that the origin has the maximum possible degree (that is 2n, all edges being incident to it)-see Fig. 3. We show that, given any quadrangulation q ∈ Q n , one can obtain q 0 from q with a sequence of edge flips. Indeed, given any quadrangulation q, unless the degree of the origin ρ is 2n, one can increase it via an edge flip. Suppose not all edges have ρ as an endpoint and let v be a neighbour of ρ that has at least one neighbour different from ρ; then, if you consider edges issued from v in clockwise order around v, there must be an edge e with second endpoint w = ρ, followed by one with endpoints v and ρ. Remark that q e,− has an origin with degree increased by one with respect to q. The quadrangulation q 0 in Q 6 , with 6 degenerate faces arranged so that the degree of the origin is 12; to the right, the pointed version from Lemma 2. 2 We may therefore suppose that q is a quadrangulation in Q n whose origin ρ has degree 2n. Let v be the second endpoint of the root edge in q; we will show that, unless deg v = n, there is an edge flip of q increasing the degree of v and not decreasing the degree of ρ. Indeed, notice that flipping any edge which is not a double edge inside a degenerate face does not change the degree of ρ; this is because every quadrangulation is bipartite, and in particular the bipartition of q's vertices has one class consisting of ρ only, and one consisting of V (q)\{ρ}. The bipartition can be changed only by flips of degenerate edges, so any other flip will transform an edge having ρ as an endpoint to another edge having ρ as an endpoint. Consider now all edges adjacent to v; if v has strictly less than n adjacent edges, then it must be part of a face that is not degenerate (if it is only adjacent to degenerate faces, then the fact that all edges have ρ as an endpoint implies q = q 0 ). Consider any edge e of such a face not having v as an endpoint: then either q e,− or q e,+ has the degree of v increased by one, and the degree of ρ unchanged. Now, if q ∈ Q n has root edge (ρ, v) with deg ρ = 2n and deg v = n, then q = q 0 , as desired. Then reversibility (cf. Remark 2.1) implies that F n is irreducible.
As a consequence of Lemma 2.1 and Remark 2.1, F n admits the uniform measure on Q n as its (unique) stationary distribution.
We will see later how, rather than the set Q n , it will be convenient to consider the set Q • n of all pointed quadrangulations with n faces, that is the set {(q, v) : q ∈ Q n , v ∈ V (q)}. The Markov chain F n can be easily extended to a Markov chain F •,n with state space Q • n , by redefining the (clockwise and counterclockwise) flips so that the distinguished vertex is preserved, thanks to the natural identification between V (q e,s ) and V (q). Notice that, if F : Q • n → Q n is the forgetful map that rids quadrangulations of the pointing, for a quadrangulation q • in Q • n we have F(q e,s • ) = F(q • ) e,s , where we are treating e both as an edge of q • and as an edge of F(q • ), since F does induce a natural identification for both vertices and edges.
Reversibility is of course still true, but one has to go a little further to prove irreducibility of F •,n . Lemma 2.2 Let q 0 ∈ Q • n be the quadrangulation with n degenerate faces, rooted in an oriented edge (ρ, v) such that ρ has degree 2n and v has degree n, pointed in ρ (see Fig. 3). Then any quadrangulation q ∈ Q • n can be turned into q 0 with a sequence of flips. In particular, F •,n is irreducible.
Proof Turning q into q 0 can be done with a very similar procedure to Lemma 2.1. First, if δ is the one distinguished vertex of q, one can apply flips until they obtain a quadrangulation q , similar to q 0 but where δ has degree 2n. If δ turns out to be the origin, then we are done. Otherwise, if the root edge e of q is not a double edge within a degenerate face, all we need to do is reverse its orientation by taking (((q ) e,+ ) e,+ ) e,+ : this will make δ the origin and preserve its degree deg δ = 2n. However, if e is a double edge of q , one only needs to flip clockwise the edge e that comes before e in the clockwise contour of the degenerate face containing e. Then one can flip e clockwise three times, then e counterclockwise, to have δ as the origin and preserve its degree. Note that, at this point, the root edge is a double edge. We can then proceed as in Lemma 2.1 to increase the degree of the second endpoint v = δ of the root edge until it is n. Notice that this only entails flipping edges that do not already have v as an endpoint, so the root edge will not be flipped and the final quadrangulation will be correctly rooted in an edge issued from δ.
As a consequence of the lemma above, the stationary distribution for F •,n is the uniform measure on Q • n . Our aim in this paper will be to prove upper and lower bounds for the spectral gap ν n of the Markov chain F n ; we will rely on the Markov chain F •,n for the known bijections available between the set Q • n and certain sets of labelled trees, which we will briefly discuss in the next section. Dealing with F •,n will still provide information about F n : any lower bound for ν • n will serve as a lower bound for ν n , as per the following lemma.

Lemma 2.3
For the spectral gap ν • n of F •,n and the spectral gap ν n of F n , we have ν • n ≤ ν n .
Proof The proof is quite immediate, since we can write for some function f : Q n → R such that E π ( f ) = 0 and V π ( f ) = 1 (where π is the uniform measure on Q n ). Now, setting F : Q • n → Q n to be the forgetful function which rids a quadrangulation of its distinguished vertex, consider the function f • F : as claimed.

The Schaeffer bijection
In order to obtain lower bounds for the spectral gap of F n , we will find it convenient to compare it to the spectral gap of a certain Markov chain on the state space of (labelled) trees.
A key ingredient to set up this comparison will be a well-known bijection often referred to as the Schaeffer correspondence [11,13]. Although this bijection and its variants have been described in a number of papers, we shall still give a very brief presentation of the construction of labelled trees from rooted, pointed quadrangulations and vice-versa, since part of it will be heavily relied upon in the rest of the paper. Definition 3.1 A plane tree is a rooted planar map with a single face.
We will often find it convenient to see the root of a plane tree as a distinguished corner rather than a distinguished oriented edge; in what follows, we shall refer to the clockwise contour of a tree (see Fig. 4) as the cyclic sequence (c i ) 2n i=1 of its corners (where n is the number of its edges); we number the corner in such a way that c 1 is the root corner, that is the corner of the origin lying immediately to the left of the root Fig. 4 A plane tree with 9 edges, whose 18 corners are labelled according to their order in the clockwise contour; the tree is rooted in the marked oriented edge, or equivalently has the corner labelled 1 as a distinguished corner. Leaves are marked in green and are defined as vertices other than the origin having degree 1, i.e. only one corner (color figure online) edge. Given a vertex v of a plane tree other than the origin, we shall write p(v) for its parent; notice that each edge of a tree may be univocally written in the form (v, p(v)), where v is a vertex of the tree other than the origin. Vertices of degree 1, with the exception of the origin, will be called leaves.
We shall call T n the set of all plane trees with n edges; trees with zero edges do not conform to the definition above, but we will still find it convenient to define T 0 to be {•} by convention, where "•" is the graph with one vertex and no edges. Definition 3.2 A labelled tree is a plane tree t endowed with a labelling l : We shall call LT n the set of all labelled trees with n edges, and set LT 0 = {•}.
Notice that, equivalently, a labelled tree could simply be presented as a plane tree whose edges are three-coloured (the colours being {1, −1, 0}); if c(e) is the colour of the edge e, labels of vertices could be recovered by setting where P(v) is the one simple path leading from v to the origin (or the empty path if v is the origin itself). Throughout the paper, we will use both points of view; it will therefore be useful to introduce a more general notation for plane trees whose edges are r -coloured (r being some fixed positive integer); we will write T (r ) n for the set For convenience, we will often refer to a labelled or r -coloured tree with a single symbol such as t, and consider the labelling or colouring to be implicit; in the case of labelled trees, we will usually call the labelling l without further comment, and sometimes naturally extend it to corners, thus writing l(c) when we mean l(v), where v is the vertex of t that c is adjacent to.
The reason for our definition of LT n is the fact that the sets Q • n and LT n ×{−1, 1} have the same cardinality; moreover, pointed quadrangulations can be interpreted as pairs (t, ε), where t is a labelled tree and ε ∈ {−1, 1}, in a rather natural way. As promised, we give here a description of how to construct an element of Q • n from an element of LT n and a sign ε ∈ {−1, 1} via the (unconstrained) Schaeffer correspondence; we include a brief description of the inverse construction for completeness and clarity, but this will not be explicitly used in the proofs to come.

Construction of a mapping φ from LT
i=1 of τ , started at the distinguished corner, and let be the minimal label appearing on vertices of τ ; • for each corner c i labelled at least join c i to c i+k with an edge (so that edges being drawn do not cross, see Fig. 5); • draw a new vertex δ within the unbounded face of the tree and join each corner labelled to δ with a new edge (again, so as not to cross any previously drawn edges); • root the map thus obtained in the newly drawn edge issued from the distinguished corner of τ , oriented away from the origin of τ if ε = −1, towards it if ε = 1; make δ the distinguished vertex; • erase all edges of τ and forget all labels.

Construction of a mapping
• label all vertices in q with their graph distance to the distinguished vertex δ, thus defining a labelling l : V (q) → N; for each face of q, read the labels of the vertices adjacent to its four corners cyclically according to a clockwise contour. Given two successive corners c i and c i+1 in a clockwise contour of a face f , we say c i is a down-step corner of f if the label of c i+1 is strictly smaller than that of c i (notice that, since the map is bipartite, the label of c i+1 is either one more or one less than that of c i , hence each face has exactly 2 down-step corners); • draw a new edge within each face of q, joining its two down-step corners; • consider the root edge (e − , e + ) of q, and let f l and f r be the faces lying left and right of (e − , e + ) respectively (of course, the two may coincide); if l(e − ) < l(e + ), set ε = 1 and choose as new root the edge being drawn between a corner adjacent to e + and the other down-step corner of f l , oriented away from e + ; if l(e − ) > l(e + ), set ε = −1 and root in the edge drawn between a corner of e − and a down-step corner of f r , oriented away from e − ; • subtract l(e − ) (if ε = −1) or l(e + ) (if ε = 1) from all labels: this way the label of the new origin is 0; • erase all original edges and the distinguished vertex δ.

above is a bijection and φ −1 is its inverse; given t ∈ LT n and ε ∈ {−1, 1}, the mapping φ naturally induces an identification between vertices of t and vertices of φ(t, ε) such that, if l is the labelling of t, we have l
where v is interpreted as a vertex of t in the left hand side of the equation and as a vertex of φ(t, ε) in the right hand side, ρ is the origin of φ(t, ε) and δ its distinguished vertex.

An upper bound for the spectral gap of F n
We will first show our upper bound for the spectral gap of F n , which will be achieved by evaluating the Dirichlet form for F n in a function related to the radius of a quadrangulation. The same bound arises by considering many other natural functions relating to the metric structure of quadrangulations, constructed from graph distances, volumes of balls, lengths of separating cycles, etc.
Note that our proof will essentially rely on the fact that edge flips change distances by at most a constant and that the scaling limit of the radius of random quadrangulations is a known random variable (i.e. the radius of the Brownian map). The same upper bound would thus extend to analogous edge flip chains for other classes of random planar maps which converge to the Brownian Map when rescaled by n 1/4 ; in particular, it implies the lower bound given by Budzinski in [6] for the mixing time of random triangulations.

Proposition 4.1 For the spectral gap ν n of the Markov chain F n of flips on quadrangulations of size n we have
where C is some positive constant independent of n.
Proof Let r : Q n → N be the mapping sending a quadrangulation q to its radius, that is the maximum possible distance of a vertex of q to the origin. Consider the function f n : Q n → R defined as where d q gr (v, ρ) is the distance of v to the origin of q and d q e,s gr (v, ρ q e,s ) is the distance to the origin of q e,s of the vertex that corresponds to v via the natural identification induced by flipping the edge e. Indeed, removing e can only increase the distance of v to ρ by at most 2, while reintroducing a rotated edge can only decrease it by at most 2; if e is not the root edge of q, then ρ is still the origin in q e,s ; otherwise, ρ q e,s is a vertex adjacent to the previous origin ρ. As a consequence, we have | r(q) − r(q e,s )| ≤ 3.
Let us now evaluate the Dirichlet form E F n ( f n , f n ); we have and therefore where X : Q n → N maps q to the number of edges e in E(q) such that r(q) < r(q e,s ) for some s ∈ {+, −}, and π is the uniform probability measure on Q n . We intend to show that E π (n − 1 4 X ) is bounded above by a constant independent of n.
Given q ∈ Q n , consider the set S(q) = (B r(q)−2 ) c of all vertices v of q such that d gr (v, ρ) ≥ r(q) − 1, where ρ is the origin of q. Also, for each v in S(q), consider a simple path P v in q with endpoints ρ and v and length d gr (ρ, v).
Flipping an edge e that is not the root of q and does not belong to v∈S(q) P v cannot increase the radius of the quadrangulation; in fact, since all paths P v and the origin are preserved, the distance to the root of vertices in S(q) cannot increase, and the distance to the root of any vertex outside of S(q) becomes at most r(q) − 2 + 2 = r(q). We thus have, for all q ∈ Q n , X (q) ≤ |S(q)| r(q) + 1.
We shall now show that the law of |S(q)| under π is the same as the law of |B 2 (q)|−1 under π , where |B 2 (q)| is the number of vertices having distance at most 2 from the origin in q.
This can be shown by a rerooting argument on the labelled tree φ −1 (P(q)), where P(q) is the quadrangulation q, pointed in its origin ρ. The mapping φ −1 • P is a well known variant of the Schaeffer construction, and is a bijection between the set Q n and the set LT + n × {1}, where LT + n is the set of all labelled trees with n edges such that no negative labels appear on them. The quantity |S(q)| represents the number of vertices labelled r(q) − 1 or r(q) − 2 (r(q) − 1 being the maximum label appearing on vertices of φ −1 (P(q))).
Consider the following bijection of the set LT + n to itself: given a tree t ∈ LT + n and, among the corners of vertices bearing the maximum appearing label (say, M = max v l(v)), consider the leftmost one according to the clockwise contour; reroot t in that corner and relabel each vertex v of t with the label M −l(v). This correspondence is clearly a bijection, since its inverse consists in rerooting a tree from LT + n in its rightmost corner labelled with its maximum label and performing the same relabelling as the one described.
Looking at vertices labelled M or M − 1, the above correspondence relabels them with 0 or 1; since π corresponds to the uniform measure on LT + n , the law of |S(q)| under π is the same as the law of the number of vertices at distance 1 or 2 from the origin in a uniform random quadrangulation from Q n , that is the law of |B 2 (q)| − 1 under π , which has exponential tails (see for example the proof of Proposition 9 in [4]).
Thanks to the Cauchy-Schwarz inequality, we can write But now E π (|B 2 (q)| 2 ) has a finite limit as n → ∞. Furthermore, the random variable f n (q) (considered under π ) converges weakly to the range of a Brownian snake driven by a Brownian excursion, whose variance is positive, and all of its moments converge (see [11,Corollary 3]); thus the right hand side of is bounded by a constant independent of n, which proves the proposition.
Remark 4.1 Note that the above proof essentially relies on the fact that each edge flip changes the radius of the quadrangulation by a constant, as in (1), and that n − 1 4 X converges to a non-trivial random variable (for which we needed both the convergence properties of the radius in the scaling limit and some kind of control over the quantity S(q)). The proof above then yields a lower bound of n 5 4 on the mixing time of the edge flip chains on any p-angulations provided the above two properties hold.

A Markov chain on labelled trees
Our main results about the Markov chain F n will be achieved via a comparison to a very natural Markov chain on labelled plane trees, which we will introduce presently.
Given a plane tree t ∈ T n with contour c 1 , . . . , c 2n and a leaf v ∈ V (t), suppose the corner of v is c l (i.e. c l is the one corner adjacent to the vertex v), with l < 2n; build a new tree t v,→ ∈ T n as follows: draw a new leaf v attached to the tree via the corner c l+2 (the corner Notice that, given a pair of trees t, t ∈ T n , there is at most one leaf v of t such that t = t v,→ ; this induces (when there is such a leaf) a natural identification between vertices of t and vertices of t which sends v to the "shifted" leaf v in t and is a tree isomorphism between the trees τ and τ obtained from t and t by erasing v and v . This is why, given two trees of the form t, t v,x , we will automatically identify their vertices and denote them in the same way, including vertices v and v , thus taking "vertex v in t v,x " to mean the newly drawn leaf v .
Given t ∈ T n , we can define analogously a tree t v,← ∈ T n as the one tree such that When t v,→ = t, we say that the tree t v,→ has been constructed from t by translating the leaf v to the right (and t v,← differs from t by a leaf translation to the left, see Fig. 6); notice that, given two trees t, t which differ by a leaf translation, there is a unique leaf v of t and a unique direction d, either → or ←, such that t can be expressed as t v,d .
One could define a Markov chain X on the set of plane trees with n edges so that, given X k = t, X k+1 is determined by selecting an edge (v, p(v)) of t uniformly at random and, if v is a leaf of t, setting X k+1 = t or X k+1 = t v,→ or X k+1 = t v,← with equal probabilities, while X k+1 = t if v is not a leaf. We shall need a coloured variant of this chain, which can easily be defined on the set of plane trees with coloured edges T (r ) n exactly as before, by additionally ensuring that all edge colours are preserved. We can also introduce appropriate "recolouring" moves: n has transition probability ; the above picture shows an example with i = 5. An analogous interpretation for the leaf translations can be given on strings of balanced parentheses, where one selects an open parenthesis at random and, if it is immediately followed by a closed parenthesis, then the pair "()" may remain untouched or move one place to the right or to the left if t, t do not differ by a leaf translation or recolouring we have p X (t, t ) = 0, and p X (t, t) ≥ 1 r +2 since for each leaf v, if c is the color of v in t we have that t v,c = t. Notice that the case r = 3 corresponds to a Markov chain on the state space LT n of labelled trees with n vertices. We shall call this the leaf translation Markov chain and will be estimating its spectral gap as well as comparing it to the spectral gap of F •,n .
The leaf translation Markov chain on T (r ) n (including the simpler variant introduced at the beginning of this section for r = 1) is a very natural chain, worthy in fact of study independently of our efforts with regards to F n . We have chosen to present it as a chain on T (r ) n , but its transitions appear very natural for a number of different interpretations of the state space via classical bijections between Catalan structures (see Fig. 7). Indeed, variants of this chain have been discussed in the physics literature under the name of Fredkin spin models, and have been investigated by Movassagh and Shor [25,26], relying on work by Bravyi et al. [5].
In particular, Movassagh and Shor prove a lower bound of Cn − 11 2 for the spectral gap of a chain on T (r ) n closely related to X , from which a bound for the spectral gap of X can be gleaned; we shall partially follow their argument for estimating the spectral gap, but will improve their results and will therefore provide a complete proof of our lower bounds in the next section. In order to do this, we will now introduce a variant of the leaf translation Markov chain which is closer to the one originally considered by Movassagh and Shor in their proofs; even though bounding its spectral gap is not strictly speaking necessary for achieving our results for X and therefore F n , we believe our improved bound to be of independent interest, and the proof-which is somewhat simpler than the one for X -to provide a handy way to more naturally introduce some of the necessary notation and showcase the basic argument.
We shall introduce this chain on the set T

(r )
n and refer to [25] for a presentation as a chain on the set of (coloured) Dyck paths. Given t ∈ T (r ) n , a leaf v ∈ V (t), an integer k ∈ {1, . . . , 2n − 1} and a colour c ∈ {1, . . . , r }, we define t v,k,c ∈ T (r ) n by the following procedure (Fig. 8): • erase (v, p(v)) from t, thus obtaining t ∈ T Notice that, if the corner of v is the k-th corner in the clockwise contour of t with 1 < k ≤ 2n − 1 and c is the colour of (v, We define the leaf replanting Markov chain Y on the state space T While we were able to identify the leaf being moved between two trees that differ by a leaf translation, notice that this is not the case when we're dealing with a leaf replanting. In general, we have Remark 5.1 Notice that both X and Y are reversible, irreducible and aperiodic. Reversibility and aperiodicity are clear from the definition; irreducibility is also clear: given any tree in T (r ) n , one can turn it into the tree of height 1 whose edges are all coloured 1 with at most n transitions from Y (indeed, it suffices to apply the replanting · → · v,1,1 on the rightmost leaf v of the tree several times). Since each leaf replanting can actually be obtained by concatenating at most 2n − 1 transitions from X (2n − 2 translations and one recolouring), the same height one tree can be obtained with at most n(2n − 1) transitions from X . The two Markov chains X and Y therefore both admit the uniform measure on T (r ) n as their unique stationary distribution.

A lower bound for the spectral gaps of leaf replanting and leaf translation Markov chains
In order to prove the desired lower bounds, we first need to set up some machinery; the first part of this section will be devoted to constructing a family of probability measures on sequences of transitions for the Markov chain Y . This will be done via a family of functions f n : T (r ) n × T (r ) n−1 → R and a function F : (T (r ) n ) 2 → T (r ) n−1 with some specific properties, which we now state. Throughout this section, we will make extensive use of the fact that plane trees are counted by Catalan numbers, hence and in particular |T Proof We can recursively construct a mapping f n with the required properties.
1 is the tree with one edge which is coloured i and • is the single vertex, and we can set f 1 (P (i) Notice that, for n > 1, we can define two functions L, R : T (r ) k (see Fig. 9) by setting L(t) to be the tree of descendants of u in t, where (ρ, u) is the root Fig. 9 The decomposition of a tree t ∈ T 13 into its left and right components L(t) ∈ T 5 and R(t) ∈ T 7 edge of t (including u and with the natural rooting induced by that of t, unless u is a leaf, in which case L(t) = •) and R(t) to be the tree obtained from t by erasing L(t) (and the edge (ρ, u)), rooted in the corner that contains the original root corner of t (unless ρ has degree 1, in which case R(t) = •). We  We now have, for all t in T (r ) n such that as well as t ∈T (r ) . Notice that f n has property (i) by construction; to enforce properties (ii) and (iii), it is sufficient to choose for i = 0, . . . , n − 1, since one then has C (n)  We intend to prove lower bounds for the spectral gap of the leaf replanting Markov chain Y by assigning each pair of trees x, y ∈ T (r ) n a canonical path of leaf replanting moves turning x into y-or rather a probability measure on the set of possible paths from x to y. Such a probability measure will be constructed by using a set of functions f i : T i be the mappings defined within the proof of Proposition 5.1 and depicted in Fig. 9.
First, given a tree x ∈ T (r ) n and a tree x ∈ T (r ) n−1 , we will define a probability measure on paths from x to x . Then, given generic trees x, y ∈ T (r ) n , we will construct random paths from x to y by concatenating paths from x to z ∈ T (r ) n , where L(z) = F(x, y) ∈ T (r ) n−1 , and from z to y.
Given t ∈ T (r ) n , consider the set t of sequences t 0 , . . . , t n such that t 0 = t, t i ∈ T (r ) n−i and t i+1 is obtained from t i by erasing a leaf; define the probability measure Q t on t as that is the law of a sequence of random trees θ 0 , . . . , θ n such that θ 0 = t and that, given Given x, y ∈ T (r ) n , consider now the set x→y of all paths (t i , t i+1 ) 2n−1 i=0 such that • for all i between 0 and 2n, the tree t i belongs to T (r ) n ; • t 0 = x, t 2n = y and L(t n ) = F(x, y) (which, since |F(x, y)| = n − 1, determines t n ); • the tree t 1 is obtained by replanting a leaf of t 0 onto corner 1; for 0 < i < n, the tree t i+1 is obtained by removing a leaf from R(t i ) and replanting it onto a corner of L(t i ); • similarly, the tree t 2n−1 can be obtained by replanting a leaf of t 2n onto corner 1; for n < i < 2n, the tree t i−1 can be obtained by removing a leaf from R(t i ) and replanting it onto a corner of L(t i ).
Since we have chosen F as in Lemma 5.2, the internal sum (having fixed x and z) is at most 8r ; as for the other sums, we wish to show that, for any given t ∈ T (r ) k and i ∈ {0, . . . , n}, we have but, indeed, which we obtain by separating R i−1 , R i−2 , . . . , R 0 from the sum, one after the other, and using the fact that f n−i+1 , . . . , f n satisfy requirement (iii) of Proposition 5.1. Using (3) (where one needs to be weary of the fact that-in order to keep notation consistent with previous definitions-R 1 is indexed from 0 and L 1 is indexed from 1) we get for 0 < i ≤ n; the same estimate is true for i = 0, since we have The case of n < i ≤ 2n is perfectly symmetric.
All necessary notation is now in place to prove lower bounds for the spectral gap of both the leaf replanting and leaf translation Markov chains.

Theorem 3 If γ Y is the spectral gap of the leaf replanting Markov chain Y on T (r )
n , we have γ Y ≥ C r n − 9 2 for an appropriate constant C r independent of n .
Proof By the canonical paths method (see for example [19,Section 13.4]), we have i=0 , we are writing |γ | to mean the length N of the sequence, and we say that (t, t ) ∈ γ if t = t i and t = t i+1 for some i ∈ {0, . . . , N − 1}.
By the description of the leaf replanting Markov chain, we know that (assuming t, t differ by the replanting of a leaf) p Y (t, t ) ≥ 1 2rn 2 ; furthermore, every path γ ∈ x→y (for x, y ∈ T (r ) n ) has length exactly 2n. Using the fact that π is the uniform measure on T (r ) n and setting (t, t ) to be a pair of trees achieving the maximum above, one obtains All that is left to do is to estimate the sum of all probabilities P x→y (γ ), where γ is a path in some x→y involving the transition (t, t ). Notice that, if (t, t ) appears in γ , then the fact that for 0 < i ≤ n we have |L(γ (i))| = i − 1 and for n ≤ i < 2n we have |L(γ (i))| = 2n − 1 − i implies that either t = γ (0), or t = γ (|L(t)| + 1), or t = γ (2n−1−|L(t)|); we therefore have, if we set S = {0, |L(t)|+1, 2n−1−|L(t)|}, by Lemma 5.3, this yields as wanted.
The proof of a lower bound for the spectral gap of the leaf translation Markov chain is analogous, if a little more fiddly.

Theorem 4 If X is the leaf translation Markov chain on the state space of r -coloured plane trees with n edges T (r )
n and γ X is its spectral gap, we have for some constant C r independent of n.

Proof Suppose t, t ∈ T (r )
n differ by the replanting and recolouring of a leaf (i.e. are such that p Y (t, t ) > 0); the leaf being replanted and recoloured may not be uniquely determined, but let v be the leftmost leaf and k be the minimum integer, given v, such that t = t v,k,c . If k is greater than or equal to the number of the corner of v in t, we construct a "leaf translation path" γ (t, t ) = (t i , t i+1 ) N −1 i=0 from t to t by setting t 0 = t, t i+1 = t v,→ i and choosing N to be as small as possible and such that t N −1 is t up to the recolouring of the replanted leaf; finally, we set t N = t v,c N −1 . Similarly, if the corner of v in t is indexed by a number strictly greater than k, we construct γ (t, t ) as a (minimal) sequence of leftward translations of v, followed by a recolouring.
By the canonical paths method, we have Notice that for all γ we have |γ X | ≤ 4n 2 (by Remark 5.1) and, for all t, t ∈ T (r ) n such that p X (t, t ) > 0, we have p X (t, t ) ≥ 1 n(r +2) . We therefore have, if we also replace occurrences of π(·) with |T (r ) Given a leaf translation or recolouring (t, t v,c ), we now wish to determine which We therefore find that If c =←, consider the tree τ obtained by removing v from t v,c . We must have either τ = R(t 1 ), or R(τ ) = R(t i ) and L(τ ) = L(t i−1 ), with i = |L(τ )| + 1. Similarly for c =→: either τ = R(t 2n−1 ), or R(τ ) = R(t i−1 ) and L(τ ) = L(t i ), with i = 2n − 1 − |L(τ )|. The proof of Lemma 5.3 can be modified slightly to yield that, for any fixed i ∈ {1, . . . , n} and a, b ∈ n j=0 T (r ) Applying both the original inequality from Lemma 5.3 and this variant yields that, when c ∈ {→, ←}, Finally, this entails for some constant C r independent of n.

Remark 5.2
In order to obtain results for the flip chain F n , we are only interested in lower bounds for the spectral gap of the chain X . It is not difficult, however, to obtain upper bounds proportional to n −2 for the spectral gaps γ X and γ Y of X and Y by an argument even simpler than that of Sect. 4. Indeed, let H n : T (r ) n → N be the function giving the height of a tree, and consider the Dirichlet forms E X (n − 1 2 H n , n − 1 2 H n ) and E Y (n − 1 2 H n , n − 1 2 H n ). Both can be bounded above by (a constant times) n −2 , using the fact that H n changes by at most 1 when a leaf replanting/translation/recolouring is performed, and that moreover, given t ∈ T (r ) n , its height decreases with probability at most 1 n when taking a step of either chain (since one has to remove the "top leaf", which even needs to be unique). The bound on the spectral gap is then established thanks to the fact that the random variable n − 1 2 H n (t), where t is a uniform random element of T (r ) n , converges to a nontrivial random variable as n → ∞, and in fact its variance converges to a positive constant (cf. [1, Section 3.1]).

Edge flips and the leaf translation Markov chain
We will now set up a comparison à la Diaconis-Saloff-Coste [15] between the Markov chain F n,• and a variant of the leaf translation Markov chain X on LT n ; as per Theorem 2, we have an explicit bijection φ between the state space Q • n of F n,• and the set LT n × {−1, 1}.
From Theorem 4 we can deduce the following analogous estimate for the spectral gap of this chain.

Corollary 6.1
If γ is the spectral gap of the Markov chain X on the state space LT n × {−1, 1} as defined above, we have γ ≥ Cn − 9 2 for some constant C.
where π is the uniform measure on LT n × {−1, 1} and E X is the Dirichlet form for the Markov chain X . Then Consider now the maps f 1 , f −1 : LT n → R defined so that f ε (t) = f (t, ε) and the leaf translation Markov chain X on LT n . We can immediately identify the first of the two sums above as On the other hand, a lower bound for the second sum is given by 2 1} is the projection on the second component, since a simple application of the Cauchy-Schwarz inequality gives V(E( f |ε)).
We thus have where γ is the spectral gap of the leaf translation Markov chain X on LT n . Finally, using Proposition 4, the variance decomposition formula and the fact that V π ( f ) = 1, we obtain that, for some constants C and C γ ≥ n (n + 1)n 9 2 C (E(V π ( f |ε)) + V π (E π ( f |ε))) ≥ C n 9 2 .
We are now ready to set up a comparison between the chains X and F n,• . In order to do this, we will devote the next section to explicitly building sequences of quadrangulation edge flips that turn φ(t, ε) into φ(t , ε ), where (t, ε) and (t , ε ) are elements of LT n ×{−1, 1} that are adjacent according to the graph of the Markov chain X .
In particular, for each t, v, x, ε such that t ∈ LT n , v is a leaf of t, x ∈ {→, ←, +, =, −} and ε = ±1, we shall build a sequence of quadrangulation edge flips Notice that (as we remarked in Sect. 2) we can naturally identify vertices of q i with vertices of q i+1 and edges of q i with edges of q i+1 by building q i+1 via the procedure described for flipping e i . We will therefore often define edges e i , . . . , e N as edges of q 1 , since edges in E(q 1 ) have a natural interpretation in E(q 2 ), . . . , E(q N ).
Having constructed these in an appropriate way, a comparison of the Markov chains F n,• and X (cf. [15]) will yield Theorem 1, provided that we can bound the maximum length of a flip sequence with (a constant times) n and show that each triple (q, e, s) (where q ∈ Q • n , e ∈ E(q), s = ±1) only appears in at most a constant number of sequences P(t) and P ε (t, t v,x ), independent of n. Constructing our flip sequences and proving such bounds will be the aim of the next three subsections; Sect. 6.5 will conclude by deriving Theorem 1.

The sequence P(t)
As a matter of fact, we have already discussed the sequence P(t) in Lemma 2.2.
From the Schaeffer construction within Sect. 3 one can immediately see that φ(t, −1) can be obtained from φ(t, 1) by simply giving the root edge the opposite orientation. If the root edge is not a double edge, this can be achieved via flips by just flipping it three times in the same direction, so we can set P(t) = (q i , e i , s i ) 3 i=1 , with q 1 = φ(t, 1), s 1 = s 2 = s 3 = + and e i being the root edge of q i , for i = 1, 2, 3.
If the root edge of φ(t, 1) is a double edge within a degenerate face, one need only perform an extra flip on one of the boundary edges of the degenerate face before where the root edge of q 1 = φ(t, 1) is a double edge within a degenerate face. Notice that either the sequence (q 2 , e 2 , s 2 ), (q 3 , e 3 , s 3 ), (q 4 , e 4 , s 4 ) is an example of P(t ), for some t such that the root of φ(t , 1) is not a double edge within a degenerate face and after flipping the root edge three times. Setting q 1 = φ(t, 1) and assuming e is the edge before the root edge in the clockwise contour of its degenerate face, we set , with e 1 = e , s 1 = s 2 = s 3 = s 4 = +, e i is the root edge of q i for i = 2, 3, 4, and e 5 = e , s 5 = − (see Fig. 11).
Proof The first part of the statement is clear by definition. As for the second part, if t is a tree such that (q, e, s) appears in P(t) and the root of φ(t, 1) is not a double edge, then φ(t, −1) is obtained by flipping the root edge of q one, two or three times, so there are at most three possibilities for t.
If (q, e, s) appears in P(t), where e is the root edge of q and the root edge of φ(t, 1) is a double edge, then one or more among q, q e,− and (q e,− ) e,− have one or both endpoints of the root edge of degree 2; setting e to be such that e, e share an endpoint of degree 2 in q ∈ {q, q e,− , (q e,− ) e,− }, φ(t, 1) must be of the form q e ,− , and therefore t must be one of at most 6 possible labelled trees.

The colour change sequences
Given a leaf label change (t, t v,c ), where c ∈ {=, +, −}, we need to construct a sequence P ε (t, t v,c ) = (q i , e i , s i ) i=1,...,N such that q 1 = φ(t, ε), q i+1 = q e i ,s i i and q N +1 = φ(t v,c , ε). Our aim will then consist in estimating the maximum length N of such sequences in terms of n, as well as the number of quadruples (t, v, c, ε), where t ∈ LT n , v is a leaf in t, c ∈ {=, +, −} and ε ∈ {−1, 1}, such that a fixed triple (q, e, s) appears in the sequence P ε (t, t v,c ).
We shall describe explicitly all sequences of the form P ε (t, t v,+ ), where l(v) = l( p(v)) in t, and P ε (t, t v,− ), where l(v) − l( p(v)) = 1 in t, that "is colour changes" from = to + and from + to −. All other sequences will be built from these in the natural way, by concatenating them and/or running them backwards. If t v,x = t, we set P ε (t, t v,x ) to be empty.
Let us first consider the case of a colour change from = to +, which is easily dealt with. 1} and a leaf v of t such that l(v) = l( p(v)), the quadrangulations q = φ(t, ε) and q = φ(t v,+ , ε) differ by an edge flip.
Proof Consider all corners of t but the one corner around the leaf v; their target corners as determined by the Schaeffer bijection are unaffected by increasing the label of v, by definition. In particular, the two corners immediately before and after the corner of v in the contour, which are corners of p(v), share the same target corner before and after the label change, making the quadrangulation face which corresponds to the tree edge (v, p(v)) a degenerate face. The only effect of the label increase is that of changing the target of the v corner to the appropriate corner of p(v), i.e. flipping the double edge e within the aforementioned degenerate face of φ(t, ε). Also notice that the edge issued from the root corner of t (which cannot be the corner of the leaf v) is unaffected both by the label change and by the flip, so we do have φ(t v,+ , ε) = φ(t, ε) e,+ .
It is therefore natural, when l(v) = l( p(v)), to set P ε (t, t v,+ ) to (q, e, +), where e is the double edge of φ(t, ε) incident to the vertex v. Similarly, we will set P ε (t v,+ , (t v,+ ) v,= ) = P ε (t v,+ , t) = (q e,+ , e, −), thus covering all the cases of a colour change from + to = and vice-versa with flip sequences of length 1.
The construction of sequences of the type P ε (t, t v,− ) is less immediate. First, let us give a "static" description of how the label change affects the corresponding quadrangulation. Recall the mapping φ sending (t, ε) ∈ LT n × {−1, 1} to q ∈ Q • n as described in Sect. 3. The quadrangulation q is constructed via the map φ by considering each corner c of t and drawing an edge from c to another corner which we refer to as the target corner of c, henceforth denoted by t(c). Recall also that δ denotes the distinguished vertex of q. Lemma 6.4 Consider a pair (t, ε) ∈ LT n × {−1, 1} and a leaf v of t such that l(v) = l( p(v)) + 1; let c be the corner of p(v) right after the corner of v in the clockwise contour of t. Suppose the target corner t(c) of c is adjacent to a vertex w ∈ V (t) and consider the quadrangulation edges e and e drawn by the Schaeffer correspondence between c and t(c), and between t(c) and t(t(c)), respectively. Let e 1 , . . . , e k be the edges incident to w lying strictly between e and e , in clockwise order around w. If t(c) is instead the corner around δ, let e 1 , . . . , e k be all quadrangulation edges incident to δ.
The quadrangulation q = φ(t v,− , ε) can be obtained from q = φ(t, ε) by "rerouting" the edges e 1 , . . . , e k to v-which is done by erasing their intersection with a suitably small neighbourhood of w (or δ) and replacing it with paths to v drawn in Fig. 12 The quadrangulations φ(t, 1) and φ(t v,− , 1) for a tree t ∈ LT 5 such that l(v) = l( p(v)) + 1 the natural planar way-then replacing the quadrangulation edge issued from v with one joining v to t(t(c)) (or to δ, if t(c) is the corner around δ): see Fig. 12. Notice that, if the root edge of q = φ(t, ε) is one of e 1 , . . . , e k , then it is "rerouted" to v and maintains the same orientation in q (and, if it is not, then it is "preserved").
Proof Let c 1 , . . . , c 2n be the corners in the clockwise contour of t, and suppose c l is the corner around the leaf v. Let us first suppose that l(c l+1 ) is not the minimal label in the tree (i.e. that its target is not the corner around δ). Notice that decreasing the label of v (by 2) does not affect any edges drawn by the Schaeffer correspondence other than • the edge drawn from c l to c l+1 , which is replaced by an edge between c l and t(t(c l+1 )), that is the first corner labelled l( p(v)) − 2 in the clockwise contour after c l ; • all edges drawn from c i to t(c i ), where t(c i ) = t(c l+1 ) and c i does not lie between c l and t(c l+1 ), since the target of c i becomes c l if the label of c l is decreased by 2; indeed, those are replaced by edges joining c i to c l .
The fact that all other targets remain the same should be clear: if only the label of c l is changed, the target of a corner c = c l may change only by becoming c l or by no longer being c l . Since c l is not the target of any other corner in t, the edges affected are those for which c l lies between their origin corner and their target corner, labelled l(c l+1 ) − 1, in the clockwise contour, as described above.
All that is left to show is that those edges are e 1 , . . . , e k ; indeed they are edges whose target is a corner of w and whose origin corner comes after t(c l+1 ) and before c l (or, equivalently, strictly before c l+1 ), in the (cyclic) clockwise contour; that is, they lie strictly between e = (c l+1 , t(c l+1 )) and e = (t(c l+1 ), t(t(c l+1 ))).
If t(c l+1 ) is the corner around δ in t, then what happens when the label of v is changed is even simpler, since v becomes the unique vertex with minimal label: all Before we give an actual description of a sequence of quadrangulation flips that achieves exactly the changes described by Lemma 6.4, we shall construct a sequence of flips that will be useful in what follows and whose only aim is to change the root edge of a quadrangulation by "exchanging" two edges. Proof Consider the union of the faces of q that are adjacent to e or to η; unless either e or η is a double edge within a degenerate face, this is a (generalised) octagon, in the sense that its boundary has an inner contour with exactly 8 corners, which we can cyclically number as c 0 , . . . , c 7 . We can suppose η joins c 0 to c 5 and e joins c 0 to c 3 ; it is then immediate to verify, as in Fig. 13, that the given sequence of flips ultimately results in η joining c 0 to c 3 and e joining c 0 to c 5 .
An analogous check can be performed for the case where e or η is a double edge, where one deals with a hexagon rather than an octagon (lower part of Fig. 13).
We can now present the construction of the flip path corresponding to a colour change from + to − on an edge (v, p(v)), where v is a leaf of a labelled tree t: Lemma 6.6 (Construction of the path, + to −) With the same notation as in Lemma 6.4, consider t, v, ε and the edges e 1 , . . . , e k of φ(t, ε), all incident to a vertex w (possibly equal to δ). If the root edge of φ(t, ε) does not belong to {e 1 , . . . , e k }, then set If some e j is the root of φ(t, ε), then set P ε (t, t v,− ) to be the path described above, with the sequence of flips described in Lemma 6.5 for the rotation of the root edge e j around its endpoint that is not w, injected right before the flip (q j , e j , −). For simplicity, we shall not renumber the quadrangulations q 1 , . . . , q k in this case, but q j and q j+1 will be 6 flips rather than one flip apart.
Proof Consider the edges adjacent to v in the quadrangulation φ(t v,− , ε) and number them as η 0 , . . . , η k , in clockwise order around v, so that η 0 is the (unique) edge of We can show by induction that the quadrangulation q i is the quadrangulation q 1 , where edges e 1 , . . . , e i−1 have been replaced by edges η 1 , . . . , η i−1 (and the natural edge identification after the flip sequence pairs e 1 with η 1 , e 2 with η 2 , and so on)-see Fig. 14. Indeed, if this is true for q i , then the edge e i as seen in q i is adjacent to two faces, one in whose clockwise contour it's preceded by η i−1 , one in whose clockwise contour it's preceded by e i+1 (where we set e k+1 to be the edge between t(c) and t(t(c))). It follows that flipping e i counterclockwise results in an edge joining the appropriate endpoint of e i+1 to v, which does correspond to creating η i . Since η 0 can already be identified with an edge of q 1 , the final quadrangulation q e k ,− k is φ(t v,− , ε), up to rerooting.
If some e j is the root edge of q 1 = φ(t, ε), then-as described in Lemma 6.4η j−1 is the root edge of φ(t v,− , ε), oriented towards v if and only if the root of q 1 is oriented towards w. We have shown that in q j edges e j and η j−1 do belong to the same face, e j coming right after η j−1 in its clockwise contour; performing the appropriate root rotation sequence of flips on q j has exactly the effect of rerooting q j in η j−1 (with the desired orientation). After that is done, one can proceed with the "normal" flip sequence to obtain q e k ,− k , which is now rooted correctly.
This concludes the description of our canonical flip paths corresponding to label changes of leaves: we simply set P ε (t, t v,− ), when l(v) = l( p(v)) in t, to be the concatenation of P ε (t, t v,+ ) and P ε (t v,+ , (t v,+ ) v,− ), while in general P ε (t v,x , t) is the reverse path of P ε (t, t v,x ) (for x ∈ {+, −, =}).
In order to compare spectral gaps as we did in Sect. 6.1, we need to estimate the maximum length of a flip path of the form P ε (t, t v,x ) and the number of paths involving any fixed quadrangulation edge flip; we do this via the following two lemmas. Lemma 6.7 Given t ∈ LT n , a leaf v of t and x ∈ {+, −, =}, the length of the flip path P ε (t, t v,x ), for ε ∈ {−1, 1}, is at most 2n + 6.
Proof The flip sequence P ε (t, t v,− ), if we ignore the possible root rotating subsequence, does not flip "the same edge" twice, so it has length at most 2n (in fact, it has length at most the maximum degree of a vertex in φ(t, ε), since all flipped edges are adjacent to the same vertex). The root rotating subsequence has length 5 and the path P ε (t, t v,+ ) has length 1, hence the above estimate. Lemma 6.8 Let (q, e, s) be a triple with q ∈ Q • n , e ∈ E(q), s ∈ {+, −}; then there is a constant C such that there are at most C quadruples (t, v, x, ε), where t ∈ LT n , v is a leaf in t, x ∈ {+, −, =} and ε = ±1, for which (q, e, s) appears in the flip path P ε (t, t v,x ). Suppose t, v are such that l(v) − l( p(v)) = 1 and (q, e, s) appears in P ε (t, t v,− ) = (q i , e i , s i ) k i=1 (that is, q = q l , e = e l and s = s l for some l ∈ {1, . . . , k}); we first consider the case where no root rotation sequence appears in P ε (t, t v,− ). Let v 1 and v 2 be the endpoints of e in q e,s ; then v corresponds to one of these two vertices in q 1 = φ(t, ε), since every edge e i is adjacent to v in q e i ,− i and subsequent quadrangulations in the flip path. In particular, since the degree of v in q 1 is 1 and it increases by 1 with each flip in P ε (t, t v,− ), if d 1 and d 2 are the respective degrees of v 1 and v 2 in q, then l = d 1 or l = d 2 , according to whether v is v 1 or v 2 .
Suppose v is v 1 ; let η 0 , . . . , η d 1 −1 be the edges incident to v 1 in q, in clockwise order around v 1 , numbered so that e will end up in between η d 1 −1 and η 0 in q e,s . Then q 1 = φ(t, ε) = ((q η d 1 −1 ,+ ) η 2 ,+ ) ... ) η 1 ,+ , since e i corresponds to the edge η d i−1 in q. We therefore have only 2 possibilities for (t, v). Now suppose a root rotation sequence does appear in P ε (t, t v,− ); if it appears strictly after (q, e, s), then the reasoning above is still valid. If it appears strictly before, then the root of q is some η j , and-reasoning as before-the quadrangulation q 1 is recovered by inserting the reverse of a root rotation sequence right before applying the clockwise flip of η j (or right at the end if j = 0). We are left to deal with the case where (q, e, s) actually belongs to a root rotation sequence. Notice that the number of possibilities for the quadrangulation q obtained at the end of the root rotation sequence is bounded by a constant independent of n, since the sequence only acts within (at most) three adjacent faces, two of which are adjacent to e. Having established some q to be the quadrangulation in question, the vertex v must be one of the endpoints of the root edge e of q . As before, we can now reconstruct q 1 by labelling η 0 , . . . , η d i−1 the Similarly, suppose t, v are such that l(v) = l( p(v)) and (q, e, s) appears in P ε (t, t v,− ); if (q, e, s) appears in P ε (t v,+ , t v,− ), then φ(t v,+ , ε) can be reconstructed as above, hence t = (t v,+ ) v,= . Otherwise we have (q, e, s) = P ε (t, t v,+ ), hence q = φ(t, ε). Now, since (q, e, −) appears in P ε (t, t v,− ) if and only if (q e,− , e, +) appears in P ε (t v,− , t), we have thus also covered the cases where (t, v, x) is such that l(v) = l( p(v)) − 1, which correspond to another 4 possibilities.
Finally, the missing cases (x ∈ {+, =} and l(v) − l( p(v)) ∈ {1, 0}) are completely straightforward, since they correspond to a flip path of length 1, and therefore imply that (t, ε) = φ −1 (q) and v is the one vertex whose label is changed by the flip.
This results, indeed, in a number of possibilities for the quadruple (t, v, x, ε) that is bounded independently of n.

The leaf translation sequences P (t, t v,→ ), P (t, t v,← )
The other type of "move" we wish to emulate via quadrangulation flips is the translation of a leaf left or right in the contour of the tree. In doing this, we may suppose the leaf has the same label as its parent, and deal with all other cases by prefixing and appending flip paths of the type P ε (t, t v,= ) and P ε (t v,= , t), which we have constructed in the previous section.
The description of φ(t v,→ , ε) in terms of φ(t, ε) is rather simple and depicted in Fig. 15: Lemma 6.9 Consider (t, ε) ∈ LT n × {−1, 1} and let v be a leaf of t such that l(v) = l( p(v)). Let c 1 , . . . , c 2n be the clockwise contour of t and suppose c l , with 2 ≤ l ≤ 2n − 1, is the corner of v (notice that, if we had l = 2n, we would have t v,→ = t). Then φ(t v,→ , ε) can be obtained from φ(t, ε) by Fig. 16 The flip path P ε (t, t v,→ ) has length 1 when the edge (v, p(v)) is replanted onto a vertex which has the same label as v and p(v). Notice that the edge that needs to be flipped in order to change φ(t, ε) into φ(t v,→ , ε) cannot be the root edge of φ(t, ε), since it is not issued from the first corner of t • replacing the edge (c l+2 , t(c l+2 )) by a degenerate face whose internal vertex is adjacent to the vertex of t(c l+2 ).
Notice that it is possible that either the edge (c l−1 , t(c l−1 )) (if l = 2) or the edge (c l+2 , t(c l+2 ))) (if l = 2n − 1) is the root edge of φ(t, ε). In the former case, the root of φ(t v,→ , ε) is the edge obtained from identifying (c l−1 , t(c l−1 )) and (c l+1 , t(c l+1 )), oriented as before; in the latter, it is the second edge of the new degenerate face in clockwise order around the vertex of c l+2 , oriented as (c l+2 , t(c l+2 )) was.
Proof Given t ∈ LT n and ε ∈ {−1, 1}, a leaf v such that l(v) = l( p(v)) is the internal vertex of a degenerate face in φ(t, ε); removing the leaf (and the tree edge joining it to its parent) results in a tree t ∈ LT n−1 and a quadrangulation φ(t , ε) in which the face is eliminated by identifying the two edges of its boundary (into a root edge with the same orientation as before in the case where one of them was root edge in φ(t, ε)).
Notice that erasing the leaf v from t and from t v,→ yields the same tree t . The quadrangulation φ(t v,→ , ε) can thus be obtained by first performing the operation described above to build φ(t , ε) and then performing it "in reverse" by replacing the appropriate edge (which is the one drawn from the corner of t that contains the edge joining v to p(v) in t v,→ ) with a degenerate face (see Fig. 15).
The quadrangulation flip path P ε (t, t v,→ ) will depend on the label of the vertex w of corner c l+2 in t; since the cases where l(w) = l(v) and l(w) = l(v) + 1 are simpler (we can construct a path of length 1 in the first case and 3 in the second!), we refer to Figs. 16 and 17 for its construction, which only involves flips within two adjacent faces of φ(t, ε). Notice that, furthermore, the construction preserves the edges issued from c l−1 and c l+2 , so that the root edge is automatically the correct one in the quadrangulations q 2 from Fig. 16 and q 4 from Fig. 17.
The case where l(w) = l(v)−1 is more complex, and will be treated in the following lemma. Lemma 6.10 (Flip path construction, leaf translation onto smaller label) Consider a tree t ∈ LT n with contour c 1 , . . . , c 2n and let v be a leaf of t such that l(v) = l( p(v)), adjacent to a corner c l with 2 ≤ l ≤ 2n − 1. Let w be the vertex of the corner c l+2 and further suppose that l(w) = l(v) − 1. For ε ∈ {−1, 1}, let e 1 , . . . , e k−1 be the edges of φ(t, ε) that are adjacent to w and lie strictly between the edge e k = (c l , c l+2 ) and the edge (c l+2 , t(c l+2 )), in clockwise order around w. If none of them is the root edge of φ(t, ε), then we can set P ε (t, t v,→ ) = (q i , e i , −) k i=1 , and we have q k+1 := q e k ,− k = φ(t v,→ , ε). If some e j is the root edge of φ(t, ε), then we can set P ε (t, t v,→ ) to be the same flip path as above, with the root rotation flip sequence from Lemma 6.5, performed around the endpoint of the root edge that is not w, inserted right before the flip (q j , e j , −).
See Fig. 18 for the construction.
Proof One can show inductively that, for i = 2, . . . , k − 1, the quadrangulation q i is obtained from q 1 by collapsing the face that contains the edge e k in q 1 and replacing the edge e i with a degenerate face whose internal vertex is adjacent to w; furthermore, the natural edge identification between q 1 and q i has e k correspond to the internal edge of the degenerate face, while e i corresponds to the 'rightmost' boundary edge of the newly created degenerate face in clockwise order around w. Then, q k is obtained by flipping e k−1 counterclockwise. By Lemma 6.9, the only difference between q k and φ(t v,→ , ε) is the fact that the internal edge of the new degenerate face is incident to w in q k and, potentially, the choice of the root edge (in the case where the root edge of q 1 is among the flipped edges e 1 , . . . , e k−1 ). Flipping e k in q k -thus obtaining q k+1 -is enough to fix the first issue, and yields φ(t v,→ , ε) up to rerooting. Suppose now that the root edge of q 1 is some e j (with 1 ≤ j ≤ k − 1); the edge issued from the same corner in q k+1 is actually the flipped version of edge e j−1 (or the edge out of c l+1 , which never gets flipped, in the case where l = 2: for ease of notation we will call it e 0 ). In the quadrangulation q j , e j (not yet flipped and still the root edge) and e j−1 (already flipped, unless j = 1) are consecutive in clockwise order around their endpoint that is not w. Performing the root rotation sequence before (q j , e j , −) thus simply results in rerooting q j in its edge e j−1 (with the correct orientation), which will not be flipped again and will end up being the correct root edge in q k+1 once the rest of the flips are performed.
As mentioned before, we construct P ε (t, t v,→ ) in general as the concatenation of P ε (t, t v,= ), P ε (t v,= , (t v,= ) v,→ ) and P ε ((t v,= ) v,→ , ((t v,= ) v,→ ) v,c ), where c is chosen so as to "restore" the colour of (v, p(v)) to the original one from t. We can further set P ε (t v,→ , (t v,→ ) v,← ) to be the reverse sequence of P ε (t, t v,→ ) (keeping in mind that P ε (t, t) is already set to be empty). Notice that, using Lemma 6.7 and the fact that the construction from Lemma 6.10, excluding root rotation sequences, does not flip the same edge twice, we immediately have P ε (t v,d , t) ≤ 6n + 17 (4) for all t ∈ LT n , v leaf of t, d ∈ {→, ←}, ε ∈ {−1, 1}. Additionally, we have the following lemma.

Lemma 6.11
Let (q, e, s) be a triple with q ∈ Q • n , e ∈ E(q), s ∈ {+, −}; then there is a constant C such that there are at most C quadruples (t, v, d, ε), where t ∈ LT n , v is a leaf in t, d ∈ {→, ←} and ε = ±1, for which (q, e, s) appears in the flip path P ε (t, t v,d ).
Proof By lemma 6.8, the number of such quadruples is at most a constant times the number of those where l(v) = l( p(v)), so we shall restrict ourselves to the latter case; since P ε (t, t v,→ ) is the reverse of P ε (t v,→ , t), we may also suppose d =→.
Suppose (t, v, →, ε) is a quadruple such that l(v) = l( p(v)) and (q, e, s) appears in P ε (t, t v,→ ), and let c 1 , . . . , c 2n be the clockwise contour of t, with c l being the corner of v. If l(c l+2 ) = l(v), then q = φ(t, ε) and v is uniquely determined from the flip (q, e, s).
If l(c l+2 ) = l(v) + 1, then there are a few possibilities (refer again to Fig. 17). If q has one more degree one vertex than q e,s , then q = φ(t, ε) and v is that degree one vertex. If q e,s has one more degree one vertex than q, let e be the edge issued from that vertex; then v is the vertex in question and φ(t v,→ , ε) = (q e,s ) e ,− . Otherwise, e is a double edge within a degenerate face, q e,s = φ(t v,→ , ε) and v is its degree one endpoint.
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.