论文信息 - On the centroid of recursive trees

On the centroid of recursive trees

It follows from our results that as n → ∞ the average distance between the root and the (nearer) centroid node of a recursive tree Tn tends to 1; and the average value of the label of the (nearer) centroid node tends to 5/2.

John W. Moon | J. Moon

[1] J. Moon,et al. On the Altitude of Nodes in Random Trees , 1978, Canadian Journal of Mathematics.

[2] Hosam M. Mahmoud. Limiting Distributions for Path Lengths in Recursive Trees , 1991 .

[3] A. Meir,et al. Cutting down recursive trees , 1974 .

[4] Vertex-Degrees in Strata of a Random Recursive Tree , 1985 .

[5] C. Jordan. Sur les assemblages de lignes. , 1869 .

[6] David Aldous. RECURSIVE SELF-SIMILARITY FOR RANDOM TREES, RANDOM TRIANGULATIONS AND BROWNIAN EXCURSION , 1994 .

[7] Jerzy Szymanski,et al. On the Structure of Random Plane-oriented Recursive Trees and Their Branches , 1993, Random Struct. Algorithms.

[8] H. Wiener. Structural determination of paraffin boiling points. , 1947, Journal of the American Chemical Society.