Random labelled trees and their branching networks
Random labelled trees and their branching networks
复制标题
DOI:
10.1017/s1446788700016517
复制
发表时间:
1980-12
期刊:
影响因子:
--
通讯作者:
G. Grimmett
中科院分区:
文献类型:
--
作者:
G. Grimmett
Abstract A random rooted labelled tree on n vertices has asymptotically the same shape as a branching-type process, in which each generation of a branching process with Poisson family sizes, parameter one, is supplemented by a single additional member added at random to one of the families in that generation. In this note we use this probabilistic representation to deduce the asymptotic distribution of the distance from the root to the nearest endertex other than itself.