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

Authors

1.1K

  1. LD
    Luc Devroye

    McGill University, Canada

    24 publications · 895 citations

    19

    h-index

  2. SJ
    Svante Janson

    Uppsala University, Sweden

    18 publications · 846 citations

    15

    h-index

  3. DA
    David Aldous

    University of California, Berkeley, United States

    12 publications · 2.3K citations

    12

    h-index

  4. HM
    Hosam M. Mahmoud

    George Washington University, United States

    14 publications · 541 citations

    12

    h-index

  5. HH
    Hsien‐Kuei Hwang

    Institute of Statistical Science, Academia Sinica, Taiwan

    11 publications · 357 citations

    11

    h-index

1–5 of 1.1K

Venues

  1. Random Structures and Algorithms

    46 publications · 2.1K citations

    28

    h-index

  2. The Annals of Probability

    24 publications · 2.7K citations

    21

    h-index

  3. The Annals of Applied Probability

    23 publications · 1K citations

    17

    h-index

  4. Electronic Journal of Probability

    EJP · 22 publications · 926 citations

    15

    h-index

  5. Journal of Applied Probability

    JAP · 24 publications · 595 citations

    15

    h-index

1–5