Asymptotics of trees with a prescribed degree sequence and applications |
| |
Authors: | Nicolas Broutin Jean‐François Marckert |
| |
Institution: | Projet Algorithms, Inria Rocquencourt, Domaine de Voluceau, , 78153 Le Chesnay, FrancePartially supported by ANR Boole (ANR‐09‐BLAN‐0011). |
| |
Abstract: | Let t be a rooted tree and nbi(t) the number of nodes in t having i children. The degree sequence of t satisfies , where denotes the number of nodes in t. In this paper, we consider trees sampled uniformly among all plane trees having the same degree sequence ; we write for the corresponding distribution. Let be a list of degree sequences indexed by κ corresponding to trees with size . We show that under some simple and natural hypotheses on the trees sampled under converge to the Brownian continuum random tree after normalisation by . Some applications concerning Galton–Watson trees and coalescence processes are provided.Copyright © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 44, 290‐316, 2014 |
| |
Keywords: | continuum random tree Brownian excursion real tree invariance principle coalescence |
|
|