Multidimensional binary trees represent a symbiosis of trees and tries, and they essentially arise in the construction of search trees for multidimensional keys. The set of nodes in a d-dimensional binary tree can be partitioned into layers according to the nodes appearing in the ith dimension. We d
The distribution of nodes of given degree in random trees
โ Scribed by Drmota, Michael; Gittenberger, Bernhard
- Publisher
- John Wiley and Sons
- Year
- 1999
- Tongue
- English
- Weight
- 391 KB
- Volume
- 31
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
โฆ Synopsis
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 ยต k and ฯ k . Besides, the asymptotic behavior of ยต k and ฯ k for k โ โ as well as the corresponding multivariate distributions are derived. Furthermore, similar results can be proved for plane trees, for labeled trees, and for forests.
๐ SIMILAR VOLUMES
We consider four families of forests on n vertices: labeled and unlabeled forests containing rooted and unrooted trees, respectively. A forest is chosen uniformly from one of the given four families. The limiting distribution of the size of its largest tree is then studied as n ยช ฯฑ. Convergences to
We establish the asymptotic normality of the number of upper records in a sequence of iid geometric random variables. Large deviations and local limit theorems as well as approximation theorems for the number of lower records are also derived. แฎ 1998
A model for the parameter c involved in Packwood and Brownรs expression for the ionization depth distribution /(qz) in EPMA is developed. Assuming that the electrons perform a random walk within the sample, the parameter c is related to the probability of รnding an electron in the surface layer afte
A random tournament T is obtained by independently orienting the edges of n 1 the complete graph on n vertices, with probability for each direction. We study the 2 asymptotic distribution, as n tends to infinity, of a suitable normalization of the number of subgraphs of T that are isomorphic to a gi
We analyze the distributions of interplanar angles between interacting side chains with well-defined planar regions, to see whether these distributions correspond to random packing or alternatively show orientational preferences. We use a non-homologous set of 79 high-resolution protein chain struct