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
Parents
81
The Evolution of Random Graphs
Béla Bollobás · Transactions of the American Mathematical Society · 1984 · 1K citations
Svante Janson, Andrzej Ruciński · Random Structures and Algorithms · 2002 · 147 citations
1–5 of 81
119
5
h-index
5
h-index
5
h-index
4
h-index
4
h-index
1–5 of 119
82

Adam Mickiewicz University in Poznań
Poznan, Poland
6 h-index
7 publications
608 citations
Microsoft (United States)
Redmond, United States
5 h-index
10 publications
746 citations
Carnegie Mellon University
Pittsburgh, United States
5 h-index
7 publications
105 citations
Eindhoven University of Technology
Eindhoven, The Netherlands
5 h-index
6 publications
440 citations
Courant Institute of Mathematical Sciences
New York, United States
5 h-index
5 publications
335 citations

Tel Aviv University
Tel Aviv, Israel
5 h-index
6 publications
151 citations
ETH Zurich
Zurich, Switzerland
4 h-index
9 publications
146 citations
University of Cambridge
Cambridge, United Kingdom
4 h-index
6 publications
273 citations
1–8 of 82
17 publications · 564 citations
12
h-index
4 publications · 71 citations
4
h-index
Repository · 3 publications · 194 citations
3
h-index
3 publications · 249 citations
3
h-index
3 publications · 100 citations
3
h-index
1–5