The distance between points in random trees

Abstract Let γ denote the number of points in the path joining two arbitrary points in a random tree T n with n labeled points. It is shown, among other things, that E(γ)∼(1/2πn) 1/2 .

[1]  A. Rényi,et al.  On the height of trees , 1967, Journal of the Australian Mathematical Society.

[2]  J. Moon,et al.  The second moment of the complexity of a graph , 1964 .

[3]  Leo Katz,et al.  Probability of Indecomposability of a Random Mapping Function , 1955 .