Abstract
Embedded trees are labelled rooted trees, where the root has zero label and where the labels of adjacent vertices differ (at most) by . 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 of planted plane trees with edges equals the Catalan number
An embedded tree (with increments ±1 or 0 and ±1) is a planted plane tree, where the vertices are labelled by integers such that the root has label and labels of adjacent vertices differ by ±1 or 0 and ±1 (see Fig. 1). By construction the numbers and of different embedded trees (with increments ±1 or 0 and ±1) are given by
In what follows we assume that every embedded tree (with edges) is equally likely. Of course, in this random setting every parameter on embedded trees becomes a random variable.
Fig. 1.
Embedded tree with increments ±1 and increments 0 and ±1.
Let denote the number of vertices with label in a (random) embedded tree of size (where we now assume that have increments ±1). The sequence is then the label profile, and let , be the linearly interpolated (random) function. Recently, Bousquet-Mélou and Janson [4] have proved that
| (1) |
where denotes weak convergence in the space and the stochastic process 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 denote the Brownian excursion of duration 1 (a non-negative random function with 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 is a continuous version of the (random) Gaussian process with zero mean and (random) covariance function
The occupation measure , the superbrownian excursion, is then given by
The (random) density of exists and is denoted (here) by .
One interesting feature of the ISE is that the support of its density is (almost surely) a finite interval. This follows from the fact that is continuous and, thus, we have and .
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 denote the depth-first-search process of Galton–Watson trees (of specifically on planted plane trees) of size . Then the head of the discrete Brownian snake is given by , 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 (and the minimum to the smallest label ). Hence and of a random embedded tree with edges are related to and :
We also have
| (2) |
By symmetry and have the same distribution but they are not independent. Note that this is in complete accordance with (1).
By using the relation between and and asymptotics on generating functions Bousquet-Mélou [3] proved a remarkable integral representation of the tail distribution function :
| (3) |
where
| (4) |
see Fig. 2. In [9] one can also find a relation for the Laplace transform of the function which is given by
and representations for the moments
for , where the right hand side has to be analytically continued at the points −3,−2,−1,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 and and also on the length 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 and denote the maximum and minimum labels in embedded trees of size , respectively. In order to formulate our main result we need the notion of the Weierstrass -function
where and are complex variables with and . The -function — considered as a function in — is an elliptic function that has periods 1 and . It is analytic in and meromorphic in with double poles on the lattice points ; for details we refer the reader to [12]. We will also need the notion of Eisenstein series
Theorem 2.1
The distribution function
of the limit
is given by
This result can be used to obtain a closed form expression for the distribution function of the length of the support 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 denote the maximum distance from the root vertex in random quadrangulations with faces. Then
where . The distribution function of the limit is given by
It seems that there is almost no literature on the explicit results on the support of the ISE. Besides the above mentioned results on the expected values
and
have been computed by Delmas [9].
3. Combinatorics
3.1. Planted plane trees
Let denote the generating function of planted plane trees, where the exponent of 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
and consequently
Fig. 3.
Recursion for planted plane trees.
3.2. Embedded trees with increments
It is also very easy to count embedded trees without any restriction with the help of generating functions. Let denote the generating function of embedded trees, where the exponent of counts the number of edges. Furthermore let , be the generating function of embedded trees, where we assume that the root is labelled by (and labels of adjacent vertices differ by ±1). Then by using the same decomposition as above we have
| (5) |
Since there are no restrictions on the embedded trees we have for all leading to the relation
and to the explicit representation
The situation becomes more interesting if we just consider embedded trees, where all labels are non-negative. Let be the generating functions of those embedded trees, where the root has label . By definition if . However, we have the same recurrence relation as above:
| (6) |
Interestingly, this system of equations has an explicit solution of the form
where
and
is the solution of the equation
that is analytic at . 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 , where is a non-negative integer. Let be the generating functions of those embedded trees, where the root has label . By definition if or . As above we have the same recurrence relation:
| (7) |
Interestingly there is an explicit solution of this system of equation in terms of the Jacobi theta function
| (8) |
that we define here in an unnormalized form; see [6]. First let be determined by the equation
| (9) |
Then we have (see [6])
| (10) |
Since, has radius of convergence it is clear that is analytic for . However, by Lemma 4.3, Lemma 4.4 it follows that there is an analytic continuation of (at least) to the region
for some constant .
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 denote the generating function of embedded trees, where the exponent of counts the number of edges. Furthermore let , , be the generating function of embedded trees, where we assume that the root is labelled by (and labels of adjacent vertices differ by 0 and ±1). Then we have
| (11) |
which leads to the relation
and to the explicit representation
Similarly let be the generating functions of those embedded trees, where the root has label . By definition if . As above we get
| (12) |
and an explicit solution of the form
where
and is the solution of the equation
that is analytic at (see [5]).
Next let be the generating functions of those embedded trees, where the root has label and all labels are bounded between 0 and . Then we have (as above) if of and
| (13) |
The explicit solution of this system of equations is given by (see [6])
| (14) |
where is determined by the equation
| (15) |
In particular we will be interested in the function
| (16) |
which corresponds to embedded trees where all labels are non-negative and bounded by . By the Schaeffer bijection this is also the generating function of rooted quadrangulations with faces, where all distances to the root are bounded by .
Finally we note can be continued analytically to a region larger than with the help of Lemma 5.1, Lemma 4.4.
4. Asymptotic analysis 1: Proof of Theorem 2.1
In [6] the generating functions 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 it follows that
| (17) |
Thus, in order to prove Theorem 2.1 we need asymptotics on the coefficient . Note that it is not necessary to prove asymptotics in the full range of parameters. In particular, we will set and for positive real numbers .
We use Cauchy’s formula
where is a certain contour of winding number +1 around the origin, contained in the analyticity region of . In this case we will use a path of integration of the form , where ,
and is a circular arc centred at the origin and making a closed curve (see also Fig. 4). Note that constitutes a so-called Hankel contour that appears in Hankel’s integral representation of .
Fig. 4.
Contour of integration and the Hankel contour.
By the relation (9), and are related. We will first study this relation for . For this purpose we have to analyse .
Lemma 4.1
We have forsufficiently close to 0 and for
whereanddenote the Eisenstein series
Proof
Since and are elliptic functions with the same poles it follows that they are almost the same. In particular we have with . Since the Laurent series expansion of is given by
we consequently obtain
for some constants . However, by using the Taylor series expansions for and we can represent as
Hence
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 forsufficiently close to 0 and for
(18)
Consequently we obtain the following asymptotic relation.
Lemma 4.3
Suppose thatandsatisfyandfor some constantand. Then
(19)
Proof
Since as (and uniformly for ) the expansion (19) follows from (18). □
Next we discuss the behaviour of if is close to 0.
Lemma 4.4
We have uniformly for with (for any )
(20)
Proof
We use the Fourier series representation of the Eisenstein series (see [1])
where abbreviates . Hence, it suffices to consider the asymptotic properties of the sum
The Mellin transform of (see [10]) is given by
for complex with . By taking the inverse Mellin transform (and shifting the line of integration to the left and taking into account the residue at ) one gets directly
which is uniform for when for any (see again [10]). Finally by using the relation we obtain (20). □
We now assume that for some positive constants and . Furthermore it is convenient to introduce a new variable
Now suppose that varies in . If we write then varies in , where is a Hankel contour cut at real part . 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
Hence varies on a contour coming from , cutting the real axis at some positive value and leaving to (compare with Fig. 5; actually we have to cut this contour at to ensure ). Hence, without loss of generality we can assume that (with ) varies on , where is defined in (4) and denotes the time reversed contour.
Fig. 5.
Negative Hankel contour and the contour of integration of .
The next goal is to determine the asymptotic behaviour of for . For this purpose we will use the following property.
Lemma 4.5
Suppose that and satisfy for some constant . Then
(21) uniformly for (for any ).
Proof
By proceeding as in the proof of Lemma 4.3 we obtain
Furthermore we have for (and uniformly for )
Finally, by using the relation (see [2])
we obtain the asymptotic relation (21). □
We are now ready to prove Theorem 2.1. We set and . As mentioned above we use Cauchy’s formula. For technical reasons we apply it for instead of . Of course, if we have
where is as in the previous case with the only difference that .
We will focus on the contribution coming from the contour . Namely if then (for some ) whereas stays bounded (note that Lemma 4.5 still applies). Hence
which is negligible compared to the normalization .
For we use the substitution
where 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 implies that , compared with the discussion from above. In this range we use the approximations
and the substitution
that lead to the integral
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)
Since we finally derive the proposed result of Theorem 2.1.
We note that the difference (and consequently the limit ) can be handled with the help of the generating function
where we are interested in the -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 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
It is an easy exercise (by using Lagrange’s inversion formula) to show that
This is (of course) the classical formula for the number of quadrangulations with faces.
We also recall that the generating function (see (16), where and are related by (15)) corresponds to embedded trees with increments 0 and ±1, where all labels are non-negative and bounded by . Hence
| (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 and satisfy and for some constants and . Then
(23)
Proof
In addition to the representation of of Lemma 4.1 we use the expansion
to obtain
This leads to (23) immediately. □
Lemma 5.2
Suppose that and satisfy and for some constants and . Then
(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 and use Cauchy’s formula. For technical reasons we apply it for instead of . Of course, if we have
We will focus on the contribution coming from the contour .
First, by combining Lemma 5.1, Lemma 5.2 it follows that
Hence, we use the corresponding substitutions (as in the proof of Theorem 2.1): then we derive
Hence, by normalizing with we obtain the limiting relation
A final scaling by 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
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).
Since we use a slightly different definition of the ISE the scaling constant from [8] differs from .
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.




