Conditioning Galton-Watson trees on large maximal out-degree
classification
🧮 math.PR
keywords
treesgalton-watsonmaximalout-degreeconditionconditioningconvergenceinfinite
read the original abstract
We propose a new way to condition random trees, that is, condition random trees to have large maximal out-degree. Under this new conditioning, we show that conditioned critical Galton-Watson trees converge locally to size-biased trees with a unique infinite spine. For the sub-critical case, we obtain local convergence to size-biased trees with a unique infinite node. We also study tail of the maximal out-degree of sub-critical Galton-Watson trees, which is essential for the proof of the local convergence.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.