English

On the profile of trees with a given degree sequence

Probability 2020-08-28 v1

Abstract

A degree sequence is a sequence s=(Ni,i0){\bf s}=(N_i,i\geq 0) of non-negative integers satisfying 1+iiNi=iNi<1+\sum_i iN_i=\sum_i N_i<\infty. We are interested in the uniform distribution Ps\mathbb{P}_{{\bf s}} on rooted plane trees whose degree sequence equals s{\bf s}, giving conditions for the convergence of the profile (sequence of generation sizes) as the size of the tree goes to infinity. This provides a more general formulation and a probabilistic proof of a conjecture due to Aldous (1991). Our formulation contains and extends results in this direction obtained previously by Drmota and Gittenberger (1997) and Kersting (2011). A technical result is needed to ensure that trees with law Ps\mathbb{P}_{{\bf s}} have enough individuals in the first generations, and this is handled through novel path transformations and fluctuation theory of exchangeable increment processes. As a consequence, we obtain a boundedness criterion for the inhomogeneous continuum random tree introduced by Aldous, Miermont and Pitman (2004).

Keywords

Cite

@article{arxiv.2008.12242,
  title  = {On the profile of trees with a given degree sequence},
  author = {Osvaldo Angtuncio and Gerónimo Uribe Bravo},
  journal= {arXiv preprint arXiv:2008.12242},
  year   = {2020}
}

Comments

32 pages, 7 figures

R2 v1 2026-06-23T18:08:50.229Z