Keyword

sparse random graphs

Description: Random graph models with relatively few edges compared with the number of possible vertex pairs, studied in probability and network science.

Primary topic: Limits and Structures in Graph Theory (44%)

OpenAlex ID: keywords/sparse-random-graphs

A critical point for random graphs with a given degree sequence

1995 · Michael Molloy, Bruce Reed · Random Structures and Algorithms · 2,354

Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning

1989 · David S. Johnson, Cecilia R. Aragon, et al. · Operations Research · 1,458

A random graph model for massive graphs

2000 · William Aiello, Fan Chung, et al. · ACM Symposium on Theory of Computing (STOC) · 926

Stochastic models for the Web graph

2002 · R. Kumar, P. Raghavan, et al. · Annual Symposium on Foundations of Computer Science · 682

Towards the fast scrambling conjecture

2013 · Nima Lashkari, Douglas Stanford, et al. · Journal of High Energy Physics · 432

PDF

A Random Graph Model for Power Law Graphs

2001 · William Aiello, Fan Chung, et al. · Experimental Mathematics · 405

The birth of the giant component

1993 · Svante Janson, Donald E. Knuth, et al. · Random Structures and Algorithms · 399

Independent sets in hypergraphs

2014 · József Balogh, Robert Morris, et al. · Journal of the American Mathematical Society · 325

PDF

Community detection thresholds and the weak Ramanujan property

2014 · Laurent Massoulié · ACM Symposium on Theory of Computing (STOC) · 321

PDF

Reconstruction and estimation in the planted partition model

2014 · Elchanan Mossel, Joe Neeman, et al. · Probability Theory and Related Fields · 303

PDF

The Diameter of Sparse Random Graphs

2001 · Fan Chung, Linyuan Lu · Advances in Applied Mathematics · 270

A Proof of the Block Model Threshold Conjecture

2017 · Elchanan Mossel, Joe Neeman, et al. · COMBINATORICA · 265

PDF

Maximum matching in sparse random graphs

1981 · R. M. Karp, M. Sipser · Annual Symposium on Foundations of Computer Science · 263

On approximating the longest path in a graph

1997 · D. Karger, R. Motwani, et al. · Algorithmica · 254

Spectral techniques applied to sparse random graphs

2005 · Uriel Feige, Eran Ofek · Random Structures and Algorithms · 221

Zero-One Laws for Sparse Random Graphs

1988 · Saharon Shelah, Joel Spencer · Journal of the American Mathematical Society · 221

PDF

Combining simulated annealing with local search heuristics

1996 · Olivier C. Martin, Steve W. Otto · Annals of Operations Research · 216

The Largest Eigenvalue of Sparse Random Graphs

2003 · MICHAEL KRIVELEVICH, BENNY SUDAKOV · Combinatorics Probability Computing · 208

PDF

Combinatorial theorems in sparse random sets

2016 · David Conlon, W. Timothy Gowers · Annals of Mathematics · 191

PDF

On the independence number of random graphs

1990 · A.M. Frieze · Discrete Mathematics · 187

PDF

Random Graphs and Complex Networks

2024 · Remco van der Hofstad · Cambridge University Press eBooks · 172

Community detection in sparse networks via Grothendieck’s inequality

2015 · Olivier Guédon, Roman Vershynin · Probability Theory and Related Fields · 168

PDF

Stochastic Block Models and Reconstruction

2012 · Mossel, Elchanan, Neeman, Joe, et al. · arXiv (Cornell University) · 154

PDF

The number of matchings in random graphs

2006 · Lenka Zdeborová, Marc Mézard · Journal of Statistical Mechanics Theory and Experiment · 154

PDF

The Diameter of Random Graphs

1981 · Béla Bollobás · Transactions of the American Mathematical Society · 154

PDF

Works count: 1,045

Citation count: 21,550