Random Graph Models
Random Graph Models is a theoretical framework in network analysis that characterizes networks as probabilistic instances generated by stochastic rules, distinguishing it from deterministic or rule-based network models by emphasizing randomness in edge formation.
2.2K
Publications
238.7K
Citations
3.2K
Authors
1.2K
Institutions
Publications per year
2017–2026
479
2.2K
Emergence of Scaling in Random Networks
Albert-Ĺaszló Barabási, Réka Albert · Science · 1999 · 36.4K citations · Full text
Statistical mechanics of complex networks
Réka Albert, Albert-Ĺaszló Barabási · Reviews of Modern Physics · 2002 · 20.6K citations · Full text
The Structure and Function of Complex Networks
Michael Newman · SIAM Review · 2003 · 18.7K citations · Full text
P. Erdős, A. Rényi · Publicationes Mathematicae Debrecen · 2022 · 5.2K citations
1–5 of 2.2K
3.2K
22
h-index
21
h-index
Eindhoven University of Technology, Netherlands
28 publications · 1.3K citations
20
h-index
20
h-index
20
h-index
1–5 of 3.2K
1.2K
Carnegie Mellon University
Pittsburgh, United States
32 h-index
146 publications
11.2K citations
University of Washington
Seattle, United States
29 h-index
64 publications
20.3K citations

The University of Melbourne
Melbourne, Australia
25 h-index
69 publications
21.5K citations
University of Michigan
Ann Arbor, United States
25 h-index
52 publications
27.2K citations
University of Oxford
Oxford, United Kingdom
25 h-index
59 publications
3K citations
Microsoft (United States)
Redmond, United States
24 h-index
53 publications
2.6K citations

Santa Fe Institute
Santa Fe, United States
24 h-index
42 publications
40K citations
University of Cambridge
Cambridge, United Kingdom
24 h-index
41 publications
5.3K citations
1–8 of 1.2K
150 publications · 10.9K citations
49
h-index
PRE · 78 publications · 9.2K citations
38
h-index
Repository · 86 publications · 3.7K citations
32
h-index
33 publications · 7K citations
27
h-index
49 publications · 2K citations
27
h-index
1–5