English

Growing conditioned BGW trees with log-concave offspring distributions

Probability 2025-10-07 v3 Combinatorics

Abstract

We show that given a log-concave offspring distribution, the corresponding sequence of Bienaym\'e-Galton-Watson trees conditioned to have n1n\geq 1 vertices admits a realization as a Markov process (Tn)n1(T_n)_{n\geq1} which adds a new "right-leaning" leaf at each step. This applies for instance to offspring distributions which are Poisson, binomial, geometric, or any convolution of those. By a negative result of Janson, the log-concavity condition is optimal in the restricted case of offspring distributions supported in {0,1,2}\{0,1,2\}. We then prove a generalization to the case of an offspring distribution supported on an arithmetic progression, if we assume log-concavity along that progression. As an application, we deduce the existence of increasing couplings in an inhomogeneous model of random subtrees of the Ulam--Harris tree. This is equivalent to the statement that, in a corresponding inhomogeneous Bernouilli percolation model on a regular tree, the root cluster is stochastically increasing in its size. These results generalize a construction of Luczak and Winkler which applies to uniformly sampled subtrees with nn vertices of the infinite complete dd-ary trees. Our proofs are elementary and we tried to make them as self-contained as possible.

Keywords

Cite

@article{arxiv.2411.03065,
  title  = {Growing conditioned BGW trees with log-concave offspring distributions},
  author = {William Fleurat},
  journal= {arXiv preprint arXiv:2411.03065},
  year   = {2025}
}

Comments

57 pages, 11 figures. v3: fixed a sectioning issue

R2 v1 2026-06-28T19:48:52.543Z