Growing conditioned BGW trees with log-concave offspring distributions
Abstract
We show that given a log-concave offspring distribution, the corresponding sequence of Bienaym\'e-Galton-Watson trees conditioned to have n≥ 1 vertices admits a realization as a Markov process (Tn)n≥1 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\. 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 n vertices of the infinite complete d-ary trees. Our proofs are elementary and we tried to make them as self-contained as possible.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.