The outer-distance of nodes in random trees.
A. Meir, J.W. Moon (1981)
Aequationes mathematicae
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Climbing Random Trees.”
The outer-distance of nodes in random trees.
Random Packings and Coverings in Random Trees
A. MEIR, J.W. MOON (1973)
Aequationes mathematicae
Similarity:
Random Packings and Coverings in Ramdom Trees. (Short Communications).
A. Meir, J.W. Moon (1972)
Aequationes mathematicae
Similarity:
Characterizations using intersections of random events.
I.I. Kotlarski, W.E. Hinds (1980)
Aequationes mathematicae
Similarity:
On some characterizations in probability by using minima and maxima of random variables.
Ignacy I. Kotlarski (1978)
Aequationes mathematicae
Similarity:
Random Walks and Trees
Zhan Shi (2011)
ESAIM: Proceedings
Similarity:
These notes provide an elementary and self-contained introduction to branching random walks. Section 1 gives a brief overview of Galton–Watson trees, whereas Section 2 presents the classical law of large numbers for branching random walks. These two short sections are not exactly indispensable, but they introduce the idea of using size-biased trees, thus giving motivations and an avant-goût to the main part, Section 3, where branching...
On the Enumeration of Two-Colured, Rooted and Weighted Plane Trees.
W.T. Tutte (1970)
Aequationes mathematicae
Similarity:
On Certain Compositions of Functions of a Complex Variable.
R. Goldstein (1970)
Aequationes mathematicae
Similarity:
Inequalities for sums of independent geometrical random variables.
Milan Merkle, Liljana Petrovic (1997)
Aequationes mathematicae
Similarity:
Mountain climbing: an alternate proof.
M.A. McKiernan (1985)
Aequationes mathematicae
Similarity: