𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the log-product of the subtree-sizes of random trees

✍ Scribed by A. Meir; J. W. Moon

Publisher
John Wiley and Sons
Year
1998
Tongue
English
Weight
190 KB
Volume
12
Category
Article
ISSN
1042-9832

No coin nor oath required. For personal study only.

✦ Synopsis

We determine the asymptotic behavior of the expected value and the variance of the log-product of the subtree-sizes of trees T belonging to simply generated families of n

πŸ“œ SIMILAR VOLUMES

Addendum to β€œOn the log-product of the s
Addendum to β€œOn the log-product of the subtree-sizes of random trees”
✍ A. Meir; J. W. Moon πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 71 KB πŸ‘ 1 views

The asymptotic behavior of the mean and the variance of the log-product of the subtree-sizes of trees belonging to simply generated families of rooted trees were determined in this paper. The authors have learned that Professor Boris Pittel, in a manuscript entitled ''Normal Convergence Problem? Two

The subtree center of a tree
The subtree center of a tree
✍ Nieminen, Juhani; Peltola, Matti πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 107 KB πŸ‘ 1 views

A method to determine the least central subtree of a tree is given. The structure of the trees having a single point as a least central subtree is described, and the relation of a least central subtree of a tree to the centroid as well as to the center of that tree is given.

On the profile of random trees
On the profile of random trees
✍ Michael Drmota; Bernhard Gittenberger πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 302 KB

Let T be a plane rooted tree with n nodes which is regarded as family tree of a Galton-Watson branching process conditioned on the total progeny. The profile of the tree ' may be described by the number of nodes or the number of leaves in layer t n , respectively. It is shown that these two processe

On the complexity of branch-and-bound se
On the complexity of branch-and-bound search for random trees
✍ Luc Devroye; Carlos Zamora-Cura πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 256 KB πŸ‘ 2 views

Let T be a b-ary tree of height n, which has independent, non-negative, n identically distributed random variables associated with each of its edges, a model previously considered by Karp, Pearl, McDiarmid, and Provan. The value of a node is the sum of all the edge values on its path to the root. Co

The distribution of nodes of given degre
The distribution of nodes of given degree in random trees
✍ Drmota, Michael; Gittenberger, Bernhard πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 391 KB πŸ‘ 1 views

Let T n denote the set of unrooted unlabeled trees of size n and let k β‰₯ 1 be given. By assuming that every tree of T n is equally likely, it is shown that the limiting distribution of the number of nodes of degree k is normal with mean value ∼ Β΅ k n and variance ∼ Οƒ 2 k n with positive constants Β΅