Random Trees
Random Trees is a probabilistic model in combinatorics that generates tree structures through stochastic processes, distinguishing itself by assigning probabilities to recursive branching configurations according to specified distributional rules.
704
Publications
42.4K
Citations
1.1K
Authors
618
Institutions
Publications per year
2017–2026
110
704
Tin Kam Ho · 2002 · 5K citations
Consistent hashing and random trees
David R. Karger, Eric Lehman, Tom Leighton et al. · 1997 · 2K citations
David Aldous · The Annals of Probability · 1991 · 849 citations · Full text
1–5 of 704
1.1K
19
h-index
15
h-index
12
h-index
12
h-index
Institute of Statistical Science, Academia Sinica, Taiwan
11 publications · 357 citations
11
h-index
1–5 of 1.1K
618

Centre National de la Recherche Scientifique
Paris, France
19 h-index
54 publications
2.7K citations

McGill University
Montreal, Canada
19 h-index
42 publications
1.5K citations
University of California, Berkeley
Berkeley, United States
18 h-index
40 publications
2.2K citations

TU Wien
Vienna, Austria
16 h-index
36 publications
1K citations

Uppsala University
Uppsala, Sweden
15 h-index
21 publications
744 citations
University of Cambridge
Cambridge, United Kingdom
13 h-index
17 publications
951 citations

Sorbonne Université
Paris, France
12 h-index
19 publications
959 citations
University of Oxford
Oxford, United Kingdom
12 h-index
16 publications
871 citations
1–8 of 618
46 publications · 2.1K citations
28
h-index
24 publications · 2.7K citations
21
h-index
23 publications · 1K citations
17
h-index
EJP · 22 publications · 926 citations
15
h-index
JAP · 24 publications · 595 citations
15
h-index
1–5