✦ LIBER ✦

Distribution of the size of random hash trees, pebbled hash trees and N-trees

✍ Scribed by Costas A. Christophi; Hosam M. Mahmoud

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 91 KB
Volume: 53
Category: Article
ISSN: 0167-7152
DOI: 10.1016/s0167-7152(01)00071-2

No coin nor oath required. For personal study only.

✦ Synopsis

Devroye (SIAM J. Comput. 28 (1999) 1215 -1224) computed the average size of several random hash-based trees. We extend this analysis by ÿnding the central limit distribution for a suitably normalized version of the size of each of random hash trees, pebbled hash trees and N-trees. Because of a strong dependency among the sizes of the subtrees, one cannot appeal to standard theorems for sums of independent random variables. Our paper probes further a saddle point method based on expressing the characteristic generating function of the size of each tree as a coe cient in a super characteristic generating function raised to a large power.

📜 SIMILAR VOLUMES

The size of random fragmentation trees

✍ Svante Janson; Ralph Neininger 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 472 KB

The size of random bucket trees via urn

The size of random bucket trees via urn models

✍ Hosam M. Mahmoud 📂 Article 📅 2002 🏛 Springer-Verlag 🌐 English ⚖ 226 KB

The size of random bucket trees via urn

The size of random bucket trees via urn models

✍ Hosam M. Mahmoud 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 51 KB

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 👁 2 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 µ

The size of minimum 3-trees

✍ Jorge L. Arocha; Joaquín Tey 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 199 KB

## Abstract A 3‐uniform hypergraph (3‐graph) is said to be tight, if for any 3‐partition of its vertex set there is a transversal triple. We give the final steps in the proof of the conjecture that the minimum number of triples in a tight 3‐graph on __n__ vertices is exactly $\left\lceil n(n-2)/3 \

On the profile of random trees

✍ Michael Drmota; Bernhard Gittenberger 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 302 KB 👁 2 views

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