Sparse Random Graphs
Sparse Random Graphs is a probabilistic model of graphs characterized by a low edge-to-vertex density, in which edges are generated independently with small probability, distinguishing it from dense random graph models by preserving sparsity in the limiting regime.
568
Publications
32K
Citations
740
Authors
405
Institutions
Publications per year
2017–2026
146
Parents
568
Efficient erasure correcting codes
Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi et al. · IEEE Transactions on Information Theory · 2001 · 1.2K citations · Full text
Stochastic models for the Web graph
Ravi Kumar, Prabhakar Raghavan, S. P. Rajagopalan et al. · 2002 · 689 citations
4 Consistency of Spectral Clustering in Stochastic Block Models
2014 · 519 citations
1–5 of 568
740
18
h-index
12
h-index
12
h-index
10
h-index
10
h-index
1–5 of 740
405

Centre National de la Recherche Scientifique
Paris, France
19 h-index
43 publications
5.7K citations
Stanford University
Stanford, United States
18 h-index
48 publications
3.3K citations
Carnegie Mellon University
Pittsburgh, United States
18 h-index
41 publications
4.4K citations
University of Oxford
Oxford, United Kingdom
16 h-index
24 publications
1.4K citations

Tel Aviv University
Tel Aviv, Israel
15 h-index
27 publications
1.3K citations
University of California San Diego
San Diego, United States
14 h-index
18 publications
2.1K citations
Massachusetts Institute of Technology
Cambridge, United States
13 h-index
29 publications
2.8K citations
University of Illinois Urbana-Champaign
Urbana, United States
13 h-index
21 publications
1.3K citations
1–8 of 405
Repository · 59 publications · 2K citations
27
h-index
52 publications · 4.9K citations
27
h-index
21 publications · 856 citations
15
h-index
14 publications · 805 citations
14
h-index
16 publications · 766 citations
13
h-index
1–5