Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
The Wiener index of simply generated random trees
Janson S. Random Structures & Algorithms22 (4):337-358,2003.Type:Article
Date Reviewed: May 14 2004

The Wiener index W(G) of a connected graph G is the sum of all of the distances between pairs of vertices of G. This index was introduced in 1947 by the chemist Harry Wiener for studying structure-property relations of hydrocarbons and other organic compounds. Since then, it has been studied extensively by chemists and mathematicians, especially for trees.

This paper extends the study of Wiener indices to those of simply generated trees. In this connection, a simply generated family of trees is defined by a sequence Mk (k ≥ 0) of nonnegative numbers (with M0 > 0); each ordered tree T is given a weight &Pgr;vMd(v), where v ranges over the vertices of T and d(v) is the out-degree of v. The corresponding simply generated random tree Tn is defined by choosing a tree of order n, with probability proportional to its weight (provided that there is some tree of order n with positive weight). Such simply generated random trees (except for some extreme cases not usually considered) are the same as the random conditioned Galton-Watson trees obtained as the family tree of a Galton-Watson process conditioned on a given total size. More precisely, suppose that the generating function M(z) := &Sgr;kMkzk converges, for some z > 0, and that X is an integer-valued random variable with the distribution P(X= k) = MkzkM(z). Then, the conditioned Galton-Watson tree given by the offspring distribution X coincides with the simply generated tree defined by Mk = P(X= k), regardless of the choice of z. Conversely, given a conditioned Galton-Watson tree with an offspring distribution X, we can take Mk = P(X= k). Furthermore, let R ≤ ∞ be the radius of convergence of M(z). Usually, it is assumed that there exists a &OHgr; with 0 < &OHgr; < R and &OHgr;M(&OHgr;) = M(&OHgr;). If z is taken to be &OHgr;, this is equivalent to EX = 1, which leads to a critical Galton-Walton tree.

The paper obtains asymptotics for the mean, variance, and higher moments, as well as for the distribution of the Wiener index of a random tree from a simply generated family or, equivalently, a critical Galton-Walton tree. In addition, a joint asymptotic distribution of the Wiener index and the internal path length is established, as well as asymptotics for the covariance and other mixed moments. The limit laws are described using functionals of a Brownian excursion. The methods include both Aldous’ theory of the continuum random tree, and the analysis of generating functions.

Reviewer:  R. B. King Review #: CR129620 (0411-1384)
Bookmark and Share
 
Distribution Functions (G.3 ... )
 
 
Graph Algorithms (G.2.2 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Distribution Functions": Date
Improved estimation of clutter properties in speckled imagery: how to write them and why
Cribari-Neto F., Frery A., Silva M. Computational Statistics & Data Analysis 40(4): 801-824, 2002. Type: Article
Jul 2 2003
Bayesian graphical model determination using decision theory
Corander J. Journal of Multivariate Analysis 85(2): 253-266, 2003. Type: Article
Aug 8 2003
Applied adaptive statistical methods: tests of significance and confidence intervals (ASA-SIAM Series on Statistics and Applied Probability)
O’Gorman T., Society for Industrial & Applied Mathematics, 2004.  174, Type: Book (9780898715538)
Aug 18 2004
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy