Random Subgraphs

Random Subgraphs is a probabilistic model in graph theory that generates subgraphs by retaining each edge of a parent graph independently according to a specified probability distribution, thereby enabling the study of structural properties emergent under stochastic edge elimination.

81

Publications

4.2K

Citations

119

Authors

82

Institutions

Publications per year

2017–2026

13

Authors

119

  1. RV
    Remco van der Hofstad

    Eindhoven University of Technology, Netherlands

    5 publications · 342 citations

    5

    h-index

  2. MM
    M. M. Pyaderkin

    Lomonosov Moscow State University, Russia

    5 publications · 90 citations

    5

    h-index

  3. YK
    Yoshiharu Kohayakawa

    Universidade de São Paulo, Brazil

    5 publications · 181 citations

    5

    h-index

  4. SJ
    Svante Janson

    Uppsala University, Sweden

    4 publications · 326 citations

    4

    h-index

  5. GS
    Gordon Slade

    University of British Columbia, Canada

    4 publications · 322 citations

    4

    h-index

1–5 of 119

Venues

  1. Random Structures and Algorithms

    17 publications · 564 citations

    12

    h-index

  2. Doklady Mathematics

    4 publications · 71 citations

    4

    h-index

  3. arXiv (Cornell University)

    Repository · 3 publications · 194 citations

    3

    h-index

  4. The Annals of Probability

    3 publications · 249 citations

    3

    h-index

  5. Journal of Graph Theory

    3 publications · 100 citations

    3

    h-index

1–5