Skip to main content
Elsevier Sponsored Documents logoLink to Elsevier Sponsored Documents
. 2013 Jan;34(1):123–137. doi: 10.1016/j.ejc.2012.07.020

Embedded trees and the support of the ISE

Michael Drmota 1,1
PMCID: PMC4819021  PMID: 27087725

Abstract

Embedded trees are labelled rooted trees, where the root has zero label and where the labels of adjacent vertices differ (at most) by ±1. Recently it has been proved (see Chassaing and Schaeffer (2004) [8] and Janson and Marckert (2005) [11]) that the distribution of the maximum and minimum labels are closely related to the support of the density of the integrated superbrownian excursion (ISE). The purpose of this paper is to make this probabilistic limiting relation more explicit by using a generating function approach due to Bouttier et al. (2003) [6] that is based on properties of Jacobi’s θ-functions. In particular, we derive an integral representation of the joint distribution function of the supremum and infimum of the support of the ISE in terms of the Weierstrass -function. Furthermore we re-derive the limiting radius distribution in random quadrangulations (by Chassaing and Schaeffer (2004) [8]) with the help of exact counting generating functions.

1. Introduction

A planted plane tree is a rooted ordered tree, which means that all successors of a node have a left-to-right order. It is a classical result that the number pn of planted plane trees with n edges equals the Catalan number

pn=1n+12nn.

An embedded tree (with increments ±1 or 0 and ±1) is a planted plane tree, where the vertices v are labelled by integers (v) such that the root r has label (r)=0 and labels of adjacent vertices differ by ±1 or 0 and ±1 (see Fig. 1). By construction the numbers qn and q¯n of different embedded trees (with increments ±1 or 0 and ±1) are given by

qn=2npn=2nn+12nnandq¯n=3npn=3nn+12nn.

In what follows we assume that every embedded tree (with n edges) is equally likely. Of course, in this random setting every parameter on embedded trees becomes a random variable.

Fig. 1.

Fig. 1

Embedded tree with increments ±1 and increments 0 and ±1.

Let Xn(j) denote the number of vertices with label j in a (random) embedded tree of size n (where we now assume that have increments ±1). The sequence (Xn(j))jZ is then the label profile, and let Xn(t),tR, be the linearly interpolated (random) function. Recently, Bousquet-Mélou and Janson [4] have proved that

(n3/4Xn(n1/4t),<t<)d(fISE(t),<t<), (1)

where d denotes weak convergence in the space C0(R) and the stochastic process (fISE(t),<t<) is the density of the integrated superbrownian excursion (ISE).2 (A corresponding limiting relation holds for trees with increments ±1 and 0.)

Recall that the ISE is a random measure which can be seen as the occupation measure of the head of the Brownian snake (see Chassaing and Schaeffer [8], Janson and Marckert [11], and Bousquet-Mélou and Janson [4]). More precisely, let (e(t),0t1) denote the Brownian excursion of duration 1 (a non-negative random function with e(0)=e(1)=0 that can be seen as a properly scaled version of the Brownian motion between two zeros, in particular it is continuous). Then the so-called head of the Brownian snake (W(t),0t1) is a continuous version of the (random) Gaussian process with zero mean and (random) covariance function

Cov(W(s),W(t))=2infmin{s,t}umax{s,t}e(u).

The occupation measure μISE, the superbrownian excursion, is then given by

μISE(A)=011A(W(t))dt.

The (random) density of μISE exists and is denoted (here) by fISE.

One interesting feature of the ISE is that the support of its density [LISE,RISE] is (almost surely) a finite interval. This follows from the fact that W(t) is continuous and, thus, we have LISE=dmin0t1W(t) and RISE=dmax0t1W(t).

It was proved by Chassaing and Schaeffer [8] and more generally by Janson and Marckert [11] that the (scaled) head of the discrete Brownian snake (defined on certain Galton–Watson trees including planted plane trees) converges to the head of the Brownian snake. Let (Vn(k),0k2n) denote the depth-first-search process of Galton–Watson trees (of specifically on planted plane trees) of size n. Then the head of the discrete Brownian snake is given by Wn(k)=(Vn(k)), that is, the label on the depth-first-search process. By definition the maximum of the head of the discrete Brownian snake equals the largest label Mn (and the minimum to the smallest label mn). Hence Mn and mn of a random embedded tree with n edges are related to RISE and LISE:

(Mnn1/4,mnn1/4)d(RISE,LISE).

We also have

Mnmnn1/4dRISELISE. (2)

By symmetry RISE and LISE have the same distribution but they are not independent. Note that this is in complete accordance with (1).

By using the relation between Mn and RISE and asymptotics on generating functions Bousquet-Mélou [3] proved a remarkable integral representation of the tail distribution function G(λ)=P{RISE>λ}:

G(λ)=12iπΓv5ev4sinh2(λv)dv, (3)

where

Γ={1teiπ/4,t(,0]}{1+teiπ/4,t[0,)}; (4)

see Fig. 2. In [9] one can also find a relation for the Laplace transform of the function x32P{RISE>x14} which is given by

0x32P{RISE>x14}esxdx=6πs(sinh((s/2)1/4))2

and representations for the moments

E(RISEr)=24πΓ(r+1)ζ(r1)2rΓ((r2)/4),

for (r)>4, where the right hand side has to be analytically continued at the points −3,−2,−1,2.

Fig. 2.

Fig. 2

Contour of integration Γ.

The purpose of this paper is twofold. First we extend the result (3) by Bousquet-Mélou. We will provide integral representations for the joint distribution of LISE and RISE and also on the length RISELISE of the support of the ISE. In the proof we use explicit representations of the corresponding generating functions of embedded trees in terms of θ-functions (see [6]) and asymptotics where Eisenstein series and the Weierstrass -function appear. The second purpose is to complement the result on the limiting radius distribution of random quadrangulations by Chassaing and Schaeffer [8] with the help of exact counting generating functions. Here we make use of the well-known Schaeffer [13] bijection between quadrangulations and embedded trees with increments 0 and ±1, where all labels are non-negative. A major property of this bijection is that the distances from the root vertex translate into the labels of the tree. Thus, the distance distribution persists, in particular the maximum distance from the root vertex (=radius of the quadrangulation) translates into the maximum label of the corresponding embedded tree.

The structure of the paper is as follows. In Section 2 we give precise statements of our results. The proof is then divided into two major parts. First we discuss combinatorics on embedded trees (Section 3). In Section 4 we deal with the support of the ISE and in Section 5 with the length of the support of the ISE.

2. Results

As above let Mn and mn denote the maximum and minimum labels in embedded trees of size n, respectively. In order to formulate our main result we need the notion of the Weierstrass -function

(z;τ)=1z2+(m1,m2)Z2{(0,0)}(1(zm1τm2)21(m1τ+m2)2),

where τ and z are complex variables with (τ)>0 and zZ+τZ. The -function — considered as a function in z — is an elliptic function that has periods 1 and τ. It is analytic in τ and meromorphic in z with double poles on the lattice points Z+τZ; for details we refer the reader to [12]. We will also need the notion of Eisenstein series

G2k(τ)=(m1,m2)Z2{(0,0)}1(m1+m2τ)2k.

Theorem 2.1

The distribution function

F(λ1,λ2)=P{RISEλ1,LISEλ2}

of the limit

(Mnn1/4,mnn1/4)d(RISE,LISE)

is given by

F(λ1,λ2)=135π1(λ1+λ2)6Γ(λ1λ1+λ2;iw)exp(45G4(i/w)(λ1+λ2)4)G4(i/w)dww2.

This result can be used to obtain a closed form expression for the distribution function of the length of the support RISELISE by using the limit relation (2). However, we use a direct approach, where we complement a result of Chassaing and Schaeffer [8] on the radius of random quadrangulations.3

Theorem 2.2

Let rn denote the maximum distance from the root vertex in random quadrangulations with n faces. Then

γn1/4rndRISELISE,

where γ=(3/2)1/2 . The distribution function of the limit is given by

H(λ)=P{RISELISEλ}=14175π1λ10ΓG6(i/w)exp(45G4(i/w)λ4)G4(i/w)dww2.

It seems that there is almost no literature on the explicit results on the support [LISE,RISE] of the ISE. Besides the above mentioned results on RISE the expected values

E(RISELISE)=32π+22π11(u+1)t31u31(u+u2+u+1)dudt

and

E(min{RISE,LISE})=62π(118(1duu31)2)

have been computed by Delmas [9].

3. Combinatorics

3.1. Planted plane trees

Let P(t) denote the generating function of planted plane trees, where the exponent of t counts the number of edges. Then by using the combinatorial decomposition — namely that all subtrees of the root are again planted plane trees, see Fig. 3 — we obtain the relation

P(t)=1+tP(t)+t2P(t)2+t3P(t)3+=11tP(t)

and consequently

P(t)=114t2t=n01n+12nntn.

Fig. 3.

Fig. 3

Recursion for planted plane trees.

3.2. Embedded trees with increments ±1

It is also very easy to count embedded trees without any restriction with the help of generating functions. Let R(t) denote the generating function of embedded trees, where the exponent of t counts the number of edges. Furthermore let Rn(t),nZ, be the generating function of embedded trees, where we assume that the root is labelled by n (and labels of adjacent vertices differ by ±1). Then by using the same decomposition as above we have

Rn(t)=11t(Rn1(t)+Rn+1(t)). (5)

Since there are no restrictions on the embedded trees we have Rn(t)=R0(t)=R(t) for all nZ leading to the relation

R(t)=112tR(t)

and to the explicit representation

R(t)=118t4t=n02nn+12nntn.

The situation becomes more interesting if we just consider embedded trees, where all labels are non-negative. Let Rn[0](t) be the generating functions of those embedded trees, where the root has label n. By definition Rn[0](t)=0 if n<0. However, we have the same recurrence relation as above:

Rn[0](t)=11t(Rn1[0](t)+Rn+1[0](t)),(n0). (6)

Interestingly, this system of equations has an explicit solution of the form

Rn[0](t)=R(t)unun+4un+1un+3,

where

un=un(t)=Z(t)n+12Z(t)n+12

and

Z(t)=1(18t)1/41+(18t)1/4

is the solution of the equation

Z+1Z+2=1tR(t)

that is analytic at t=0. Such a miraculous relation was first observed by Bouttier et al. [5] for the case of increments ±1 and 0. However, their method works, too, for increments ±1 as stated in their paper [6] (see also [7]). This explicit solution was used by Bousquet-Mélou [3] to obtain the integral representation for (3).

In the already mentioned paper [6] Bouttier et al. considered also the class of embedded trees, where all labels are bounded between 0 and L, where L is a non-negative integer. Let Rn[0,L](t) be the generating functions of those embedded trees, where the root has label n. By definition Rn[0,L](t)=0 if n<0 or n>L. As above we have the same recurrence relation:

Rn[0,L](t)=11t(Rn1[0,L](t)+Rn+1[0,L](t)),(0nL). (7)

Interestingly there is an explicit solution of this system of equation in terms of the Jacobi theta function

θ1(u;q)=2isin(πu)j1(12qjcos(2πu)+q2j), (8)

that we define here in an unnormalized form; see [6]. First let q=q(t) be determined by the equation

t=θ1(1L+6,q)4θ1(4L+6,q)θ1(2L+6,q)5. (9)

Then we have (see [6])

Rn[0,L](t)=θ1(2L+6,q)3θ1(1L+6,q)2θ1(4L+6,q)θ1(n+1L+6,q)θ1(n+5L+6,q)θ1(n+2L+6,q)θ1(n+4L+6,q). (10)

Since, R(t) has radius of convergence 1/8 it is clear that Rn[0,L](t) is analytic for |t|<1/8. However, by Lemma 4.3, Lemma 4.4 it follows that there is an analytic continuation of Rn[0,L](t) (at least) to the region

C([1/8,){tC:|t|1/8,|t1|c/L})

for some constant c>0.

3.3. Embedded trees with increments 0 and ±1

The equations for embedded trees with increments 0 and ±1 are very close to the previous ones.

Let R¯(t) denote the generating function of embedded trees, where the exponent of t counts the number of edges. Furthermore let R¯n(t), nZ, be the generating function of embedded trees, where we assume that the root is labelled by n (and labels of adjacent vertices differ by 0 and ±1). Then we have

R¯n(t)=11t(R¯n1(t)+R¯n(t)+R¯n+1(t)) (11)

which leads to the relation

R¯(t)=113tR¯(t)

and to the explicit representation

R¯(t)=1112t6t=n03nn+12nntn.

Similarly let R¯n[0](t) be the generating functions of those embedded trees, where the root has label n. By definition R¯n[0](t)=0 if n<0. As above we get

R¯n[0](t)=11t(R¯n1[0](t)+R¯n[0](t)+R¯n+1[0](t)),(n0) (12)

and an explicit solution of the form

R¯n[0](t)=R¯(t)u¯nu¯n+3u¯n+1u¯n+2,

where

u¯n=u¯n(t)=Z¯(t)n+12Z¯(t)n+12

and Z¯(t) is the solution of the equation

Z¯+1Z¯+4=1tR¯(t)

that is analytic at t=0 (see [5]).

Next let R¯n[0,L](t) be the generating functions of those embedded trees, where the root has label n and all labels are bounded between 0 and L. Then we have (as above) R¯n[0,L](t)=0 if n<0 of n>L and

R¯n[0,L](t)=11t(R¯n1[0,L](t)+R¯n[0,L](t)+R¯n+1[0,L](t)),(0nL). (13)

The explicit solution of this system of equations is given by (see [6])

R¯n[0,L](t)=4θ1(1L+5,q)θ1(2L+5,q)θ1(0,q)θ1(3L+5,q)(θ1(1L+5,q)θ1(1L+5,q)θ1(2L+5,q)2θ1(2L+5,q))θ1(n+1L+5,q)θ1(n+4L+5,q)θ1(n+2L+5,q)θ1(n+3L+5,q), (14)

where q=q¯(t) is determined by the equation

t=θ1(0,q)2θ1(3L+5,q)16θ1(1L+5,q)θ1(2L+6,q)2(θ1(1L+5,q)θ1(1L+5,q)θ1(2L+5,q)2θ1(2L+5,q))2. (15)

In particular we will be interested in the function

R¯0[0,L](t)=4θ1(1L+5,q)2θ1(4L+5,q)θ1(0,q)θ1(3L+5,q)2(θ1(1L+5,q)θ1(1L+5,q)θ1(2L+5,q)2θ1(2L+5,q)) (16)

which corresponds to embedded trees where all labels are non-negative and bounded by L. By the Schaeffer bijection this is also the generating function of rooted quadrangulations with n faces, where all distances to the root are bounded by L.

Finally we note R¯0[0,L](t) can be continued analytically to a region larger than {tC:|t|<1/12} with the help of Lemma 5.1, Lemma 4.4.

4. Asymptotic analysis 1: Proof of Theorem 2.1

In [6] the generating functions Rn[0,L](t) have been analysed by considering the so-called scaling limits which can be interpreted in terms of potentials and characteristic lengths. For our purpose we have to be more precise, since we are interested in asymptotics of the coefficients. Nevertheless, we use — more or less — the same scaling as in [6].

By shifting labels from 0 to j it follows that

P{Mnk,mnj}=[tn]Rj[0,j+k](t)2nn+12nn. (17)

Thus, in order to prove Theorem 2.1 we need asymptotics on the coefficient [tn]Rj[0,j+k](t). Note that it is not necessary to prove asymptotics in the full range of parameters. In particular, we will set jλ1n1/4 and kλ2n1/4 for positive real numbers λ1,λ2.

We use Cauchy’s formula

[tn]Rj[0,j+k](t)=12πiγRj[0,j+k](t)tn1dt,

where γ is a certain contour of winding number +1 around the origin, contained in the analyticity region of Rj(t)[0,j+k]. In this case we will use a path of integration γ of the form γ=γ1γ2γ3γ4, where x0=18,c>0,

γ1={x=x0(1ci+n1/4sn):0sn1/4},
γ2={x=x0(1c1neiφ):π2φπ2},
γ3={x=x0(1+ci+sn:)0sn1/4},

and γ4 is a circular arc centred at the origin and making γ a closed curve (see also Fig. 4). Note that γ1γ2γ3 constitutes a so-called Hankel contour that appears in Hankel’s integral representation of 1/Γ(s).

Fig. 4.

Fig. 4

Contour of integration and the Hankel contour.

By the relation (9), t and q are related. We will first study this relation for tγ1γ2γ3. For this purpose we have to analyse θ1(u,q).

Lemma 4.1

We have forusufficiently close to 0 and for|q|<1

θ1(u,q)=2πiuj1(1qj)2exp((π26+4π2j1qj(1qj)2)u2k2u2k2kG2k(τ)),

whereq=e2πiτandG2k(τ)denote the Eisenstein series

G2k(τ)=(m1,m2)Z2{(0,0)}1(m1+m2τ)2k.

Proof

Since (u,τ) and log(θ1(u,q)) are elliptic functions with the same poles it follows that they are almost the same. In particular we have (u,τ)=log(θ1(u,q))+c with c=θ1(0,q)/(3θ1(0,q)). Since the Laurent series expansion of (u,τ) is given by

(u,τ)=1u2+k2(2k1)u2k2G2k(τ)

we consequently obtain

logθ1(u,q)=c3+c2u+c2u2+loguk2u2k2kG2k(τ)

for some constants c2,c3. However, by using the Taylor series expansions for sin(πu) and cos(2πu) we can represent θ1(u,q) as

θ1(u,q)=2πiuj1(1qj)2exp((π26+4π2j1qj(1qj)2)u2+O(u4)).

Hence

c=π23+8π2j1qj(1qj)2,c2=0,andc3=log(2πij1(1qj)2),

which completes the proof of the lemma. □

With the help of Lemma 4.1 we immediately obtain the following representation.

Lemma 4.2

We have forusufficiently close to 0 and for|q|<1

θ1(u,q)4θ1(4u,q)θ1(2u,q)5=18exp(k2G2k(τ)2k(4+24k522k)u2k). (18)

Consequently we obtain the following asymptotic relation.

Lemma 4.3

Suppose thatq=e2πiτandLsatisfy|1q|c/LandLcfor some constantc>0andc>0. Then

θ1(1L+6,q)4θ1(4L+6,q)θ1(2L+6,q)5=18(145(L+6)4G4(τ)630(L+6)6G6(τ)+O(1L8|1q|8)). (19)

Proof

Since |G2k(τ)||τ|2k+O(1) as τ0 (and uniformly for k2) the expansion (19) follows from (18). □

Next we discuss the behaviour of G4(τ) if τ is close to 0.

Lemma 4.4

We have uniformly for τ0 with εarg(τ)πε (for any ε>0 )

G4(τ)=π445τ4+O(τ3). (20)

Proof

We use the Fourier series representation of the Eisenstein series (see [1])

G4(τ)=(m1,m2)Z2{(0,0)}1(m1+m2τ)4=π445+16π43n1σ3(n)e2πinτ,

where σ(n) abbreviates σ(n)=d|nd. Hence, it suffices to consider the asymptotic properties of the sum

S(x)=n1σ3(n)enx.

The Mellin transform of S(x) (see [10]) is given by

F(s)=0S(x)xs1dx=Γ(s)ζ(s)ζ(s3)

for complex s with (s)>4. By taking the inverse Mellin transform (and shifting the line of integration to the left and taking into account the residue at s=4) one gets directly

S(x)=Γ(4)ζ(4)x4+O(x3)=π415x4+O(x3)

which is uniform for x0 when |arg(x)|πε for any ε>0 (see again [10]). Finally by using the relation G4(τ)(16/3)π4S(2πiτ) we obtain (20). □

We now assume that Lj+k=(λ1+λ2)n1/4 for some positive constants λ1 and λ2. Furthermore it is convenient to introduce a new variable

w=2πlog(1/q)=iτ.

Now suppose that t varies in γ1γ2γ3(with x0=18). If we write t=18(1wn) then w varies in H, where H is a Hankel contour H cut at real part n1/4. In order to get an overall picture we neglect this cut for a moment. With the help of the asymptotic relations of Lemma 4.3, Lemma 4.4 we have

w=π4(λ1+λ2)4w4+O(w2).

Hence w varies on a contour coming from +eiπ/4, cutting the real axis at some positive value and leaving to +eiπ/4 (compare with Fig. 5; actually we have to cut this contour at |w|(λ1+λ2)/πn1/16 to ensure |w|n1/4). Hence, without loss of generality we can assume that w (with |w|(λ1+λ2)/πn1/16) varies on Γˆ, where Γ is defined in (4) and ˆ denotes the time reversed contour.

Fig. 5.

Fig. 5

Negative Hankel contour and the contour of integration of w.

The next goal is to determine the asymptotic behaviour of Rj[0,j+k](t) for tγ1γ2γ3. For this purpose we will use the following property.

Lemma 4.5

Suppose that q=e2πiτ and L satisfy |1q|c/L for some constant c>0 . Then

Rj[0,L](t)=2(13(L+6)2(j+1L+6;τ)+O(1L4|1q|4)) (21)

uniformly for εj/L1ε (for any ε>0 ).

Proof

By proceeding as in the proof of Lemma 4.3 we obtain

θ1(2L+6,q)3θ1(1L+6,q)2θ1(4L+6,q)=2(11(L+6)2θ1(0,q)θ1(0,q)+O(1L4|1q|4)).

Furthermore we have for u=(j+1)/(L+6) (and uniformly for εu1ε)

θ1(j+1L+6,q)θ1(j+5L+6,q)θ1(j+2L+6,q)θ1(j+4L+6,q)=1+3(L+6)2(θ1(u,q)θ1(u,q)(θ1(u,q)θ1(u,q))2)+O(1L4|1q|).

Finally, by using the relation (see [2])

θ1(0,q)3θ1(0,q)θ1(u,q)θ1(u,q)+(θ1(u,q)θ1(u,q))2=(u;τ)

we obtain the asymptotic relation (21). □

We are now ready to prove Theorem 2.1. We set j+3=λ1n1/4,k+3=λ2n1/4 and L+6=(j+3)+(k+3)=(λ1+λ2)n1/4. As mentioned above we use Cauchy’s formula. For technical reasons we apply it for Rj[0,j+k](t)2 instead of Rj[0,j+k](t). Of course, if n>0 we have

[tn]Rj[0,j+k](t)=[tn](Rj[0,j+k](t)2)=12πiγ(Rj[0,j+k](t)2)tn1dt=12πiγ1γ2γ3(Rj[0,j+k](t)2)tn1dt+12πiγ4(Rj[0,j+k](t)2)tn1dt,

where γ=γ1γ2γ3γ4 is as in the previous case with the only difference that x0=1/12.

We will focus on the contribution coming from the contour γ1γ2γ3. Namely if tγ4 then |t|18(1+cn3/4) (for some c>0) whereas Rj[0,j+k](t) stays bounded (note that Lemma 4.5 still applies). Hence

γ4(Rj[0,j+k](t)2)tn1dt=O(8necn1/4)

which is negligible compared to the normalization 2nn+12nn8nn3/2/π.

For tγ1γ2γ3 we use the substitution

t=18exp(k2G2k(τ)2k(4+24k522k)(λ1+λ2)2knk/2),

where w=i/τ now varies on a contour that we can deform (due to analyticity) to Γˆ. Note, however, that we have to cut Γˆ to a finite contour Γˆ, since tγ1γ2γ3 implies that w=O(n1/16), compared with the discussion from above. In this range we use the approximations

Rj[0,j+k](t)2=6(λ1+λ2)2n(λ1λ1+λ2;iw)+O(w4n),
tn1=8n+1exp(45G4(i/w)(λ1+λ2)4+O(w6n)),

and the substitution

dt=iw2(45G4(i/w)8(λ1+λ2)4n+O(w5n3/2))dw

that lead to the integral

12πiγ1γ2γ3(Rj[0,j+k](t)2)tn1dt=2702π8nn3/21(λ1+λ2)6Γˆ((λ1λ1+λ2;iw)+O(w4+w6n))exp(45G4(i/w)(λ1+λ2)4)G4(i/w)dww2.

At this point we can neglect the error terms and extend the cut path of integration Γˆ to the infinite path Γˆ and obtain (after reversing Γˆ to Γ and deforming)

[tn]Rj[0,j+k](t)135π8nn3/21(λ1+λ2)6Γ(λ1λ1+λ2;iw)exp(45G4(i/w)(λ1+λ2)4)G4(i/w)dww2.

Since 2nn+12nn8nn3/2/π we finally derive the proposed result of Theorem 2.1.

We note that the difference Mnmn (and consequently the limit RISELISE) can be handled with the help of the generating function

j+L(Rj[0,](t)Rj[0,1](t)Rj1[0,1](t)+Rj1[0,2](t))=j=0LjL(Rj[0,](t)Rj[0,1](t)Rj1[0,1](t)+Rj1[0,2](t))=j=0L(Rj[0,Lj](t)Rj1[0,Lj1](t)),

where we are interested in the n-th coefficient. However, this procedure is much more involved as that presented in the next section.

5. Asymptotic analysis 2: Proof of Theorem 2.2

Let rn denote the maximum distance from the root vertex (=radius of the quadrangulation) which equals in distribution the maximum label of embedded trees with increments 0 and ±1, where all labels are non-negative.

Recall that all embedded trees with increments 0 and ±1, where all labels are non-negative, are counted by the generating function

R¯0(t)=R¯(t)(1Z¯)(1Z¯4)(1Z¯2)(1Z¯3)=R¯(t)1+Z¯21+Z¯+Z¯2=R¯(t)(1tR¯(t)2).

It is an easy exercise (by using Lagrange’s inversion formula) to show that

[tn]R¯0(t)=23n(n+1)(n+2)2nn212nπn5/2.

This is (of course) the classical formula for the number of quadrangulations with n faces.

We also recall that the generating function R¯0[0,L](t) (see (16), where t and q are related by (15)) corresponds to embedded trees with increments 0 and ±1, where all labels are non-negative and bounded by L. Hence

P{rnL}=[tn]R¯0[0,L](t)23n(n+1)(n+2)2nn. (22)

In order to obtain an asymptotic expansion for this probability we proceed as in the proof of Theorem 2.1. First we need an analogue to Lemma 4.3, Lemma 4.5.

Lemma 5.1

Suppose that q=e2πiτ and L satisfy |1q|c/L and Lc for some constants c>0 and c>0 . Then

θ1(0,q)2θ1(3L+5,q)16θ1(1L+5,q)θ1(2L+6,q)2(θ1(1L+5,q)θ1(1L+5,q)θ1(2L+5,q)2θ1(2L+5,q))=112(120(L+5)4G4(τ)140(L+5)6G6(τ)+O(1L8|1q|8)). (23)

Proof

In addition to the representation of θ1(u,q) of Lemma 4.1 we use the expansion

θ1(u,q)θ1(u,q)=1ucuk2u2k1G2k(τ)

to obtain

θ1(u,q)θ1(u,q)12θ1(2u,q)θ1(2u,q)=34u(1+k24(4k11)3u2kG2k(τ))=34u(1+4u4G4(τ)+20u6G6(τ)+O(u8)).

This leads to (23) immediately. □

Lemma 5.2

Suppose that q=e2πiτ and L satisfy |1q|c/L and Lc for some constants c>0 and c>0 . Then

R¯0[0,L](t)=43(120(L+5)4G4(τ)420(L+5)6G6(τ)+O(1L8|1q|8)) (24)

Proof

By using the relation (16) and by proceeding as in the proof of Lemma 5.1 we derive the result. □

We are now ready to prove Theorem 2.2. We set L+5=λn1/4 and use Cauchy’s formula. For technical reasons we apply it for R¯0[0,L](t)16t instead of R¯0[0,L](t). Of course, if n>1 we have

[tn]R¯0[0,L](t)=[tn](R¯0[0,L](t)16t)=12πiγ(R¯0[0,L](t)16t)tn1dt=12πiγ1γ2γ3(R¯0[0,L](t)16t)tn1dt+12πiγ4(R¯0[0,L](t)16t)tn1dt.

We will focus on the contribution coming from the contour γ1γ2γ3.

First, by combining Lemma 5.1, Lemma 5.2 it follows that

R¯0[0,L](t)16t=11203(L+5)6G6(τ)+O(1L8|1q|8).

Hence, we use the corresponding substitutions (as in the proof of Theorem 2.1): τ=i/w,t=112(120G4(i/w)/(λ4n)140G6(i/w)/(λ6n3/2)),λ=(L+5)n1/4 then we derive

12πiγ1γ2γ3(R¯0[0,L](t)16t)tn1dt1π12nn5/2112003λ10ΓˆG6(iw)exp(20G4(i/w)/λ4)G4(i/w)dww2.

Hence, by normalizing with 23n2nn/((n+1)(n+2)) we obtain the limiting relation

P{rnλn1/4}560031π1λ10ΓG6(i/w)exp(20G4(i/w)/λ4)G4(i/w)dww2.

A final scaling by 2/3 provides the result of Theorem 2.2.

Acknowledgments

The author is grateful to Mireille Bousquet-Mélou for several helpful comments and to two anonymous referees for their valuable remarks.

The work of the author was supported by the Austrian Science Foundation FWF Grant No. S9604.

Footnotes

2

Note that the ISE is not consistently defined in the literature, there are different scaling constants. We use the version that corresponds directly to embedded trees with increments ±1 so that there is no scaling constant in (1).

3

Since we use a slightly different definition of the ISE the scaling constant (8/9)1/4 from [8] differs from γ=(3/2)1/2.

References

  • 1.Apostol Tom M. Springer; New York: 1990. Modular Functions and Dirichlet Series in Number Theory. [Google Scholar]
  • 2.Batman H. McGraw-Hill; New York: 1953. Higher Transcendental Functions, Vol. II. [Google Scholar]
  • 3.Bousquet-Mélou M. Limit laws for embedded trees: applications to the integrated super-Brownian excursion. Random Structures Algorithms. 2006;29:475–523. [Google Scholar]
  • 4.Bousquet-Mélou M., Janson S. The density of the ISE and local limit laws for embedded trees. Ann. Appl. Probab. 2006;16:1597–1632. [Google Scholar]
  • 5.Bouttier J., Di Francesco P., Guitter E. Geodesic distance in planar graphs. Nucl. Phys. B. 2003;663:535–567. [Google Scholar]
  • 6.Bouttier J., Di Francesco P., Guitter E. Random trees between two walls: exact partition function. J. Phys. A: Math. Gen. 2003;36:12349–12366. [Google Scholar]
  • 7.Bouttier J., Di Francesco P., Guitter E. Statistics of planar graphs viewed from a vertex: a study via labeled trees. Nuclear Phys. 2003;B675:631–660. [Google Scholar]
  • 8.Chassaing P., Schaeffer G. Random planar lattices and integrated superBrownian excursion. Probab. Theory Related Fields. 2004;128:161–212. [Google Scholar]
  • 9.Delmas J.-F. Computation of moments for the length of the one dimensional ISE support. Electron. J. Probab. 2003;8:15. Paper no. 17. [Google Scholar]
  • 10.Flajolet P., Gourdon X., Dumas P. Mellin transforms and asymptotics: harmonic sums. Theoret. Comput. Sci. 1995;144:3–58. [Google Scholar]
  • 11.Janson S., Marckert J.-F. Convergence of discrete snakes. J. Theoret. Probab. 2005;18:615–645. [Google Scholar]
  • 12.Koecher M., Krieg A. Springer; Berlin: 1998. Elliptische Funktionen und Modulformen. [Google Scholar]
  • 13.G. Schaeffer, Conjugaison d’arbres et cartes combinatoires aléatoires, Ph.D. Thesis, Université Bordeaux I, 1998.

RESOURCES