Distances between pairs of vertices and vertical profile in conditioned GaltonWatson trees
We consider a conditioned GaltonWatson tree and prove an estimate of the number of pairs of vertices with a given distance, or, equivalently, the number of paths of a given length.
vertical profile random galtonwatson tree paths of given length probabilistic analysis of algorithms branching process