scholarly journals On growing random binary trees

1984 ◽  
Vol 103 (2) ◽  
pp. 461-480 ◽  
Author(s):  
Boris Pittel
Keyword(s):  
Binary Trees ◽  
Random Binary Trees

scholarly journals On the Joint Path Length Distribution in Random Binary Trees

2006 ◽  
Vol 117 (2) ◽  
pp. 109-147 ◽  
Author(s):  
Charles Knessl ◽  
Wojciech Szpankowski
Keyword(s):  
Path Length ◽  
Length Distribution ◽  
Binary Trees ◽  
Random Binary Trees

Horton-Strahler ordering of random binary trees

1994 ◽  
Vol 27 (2) ◽  
pp. 285-293 ◽  
Author(s):  
I Yekutieli ◽  
B B Mandelbrot
Keyword(s):  
Binary Trees ◽  
Random Binary Trees

Generating random binary trees — A survey

1999 ◽  
Vol 115 (1-4) ◽  
pp. 123-136 ◽  
Author(s):  
Erkki Mäkinen
Keyword(s):  
Binary Trees ◽  
Random Binary Trees

On Random Binary Trees

1976 ◽  
Author(s):  
Gerald G. Brown ◽  
Bruno O. Shubert
Keyword(s):  
Binary Trees ◽  
Random Binary Trees

Moments of particle size distributions under sequential breakage with applications to species abundance

1983 ◽  
Vol 20 (01) ◽  
pp. 158-164 ◽  
Author(s):  
Andrew F. Siegel ◽  
George Sugihara
Keyword(s):  
Particle Size ◽  
Species Abundance ◽  
Binary Trees ◽  
Particle Sizes ◽  
Size Distributions ◽  
Particle Size Distributions ◽  
Underlying Distribution ◽  
Path Lengths ◽  
Stick Model ◽  
Random Binary Trees

The sequential broken stick model has appeared in numerous contexts, including biology, physics, engineering and geology. Kolmogorov showed that under appropriate conditions, sequential breakage processes often yield a lognormal distribution of particle sizes. Of particular interest to ecologists is the observed variance of the logarithms of the sizes, which characterizes the evenness of an assemblage of species. We derive the first two moments for the logarithms of the sizes in terms of the underlying distribution used to determine the successive breakages. In particular, for a process yielding n pieces, the expected sample variance behaves asymptotically as log(n). These results also yield a new identity for moments of path lengths in random binary trees.

A note on the expected distribution of degrees in random binary trees

2000 ◽  
Vol 32 (4) ◽  
pp. 32-33
Author(s):  
Jarmo Siltaneva ◽  
Erkki Mäkinen
Keyword(s):  
Binary Trees ◽  
Random Binary Trees

On Random Binary Trees

1984 ◽  
Vol 9 (1) ◽  
pp. 43-65 ◽  
Author(s):  
Gerald G. Brown ◽  
Bruno O. Shubert
Keyword(s):  
Binary Trees ◽  
Random Binary Trees

scholarly journals A Note on Rémy's Algorithm for Generating Random Binary Trees

2003 ◽  
Vol 15 (2) ◽  
pp. 103-109
Author(s):  
Erkki Mäkinen ◽  
Jarmo Siltaneva
Keyword(s):  
Binary Trees ◽  
Random Binary Trees
Sign in / Sign up

Export Citation Format

Share Document