Random Graph Processes
Random Graph Processes is a stochastic process that evolves by sequentially adding edges to an initially edgeless graph according to a probabilistic rule, thereby generating a dynamic model of graph formation in which the emergence of structural properties can be studied over time.
396
Publications
26.6K
Citations
606
Authors
374
Institutions
Publications per year
2017–2026
59
Parents
396
The Evolution of Random Graphs
Béla Bollobás · Transactions of the American Mathematical Society · 1984 · 1K citations
Recent developments in exponential random graph (p*) models for social networks
Garry Robins, Tom A. B. Snijders, Peng Wang et al. · Social Networks · 2006 · 844 citations · Full text
Limits of dense graph sequences
László Lovász, Balázs Szegedy · Journal of Combinatorial Theory Series B · 2006 · 840 citations
1–5 of 396
606
12
h-index
11
h-index
10
h-index
10
h-index
9
h-index
1–5 of 606
374
Carnegie Mellon University
Pittsburgh, United States
12 h-index
26 publications
1.3K citations

Adam Mickiewicz University in Poznań
Poznan, Poland
12 h-index
18 publications
1.3K citations
University of California, Berkeley
Berkeley, United States
11 h-index
18 publications
1.7K citations
University of Cambridge
Cambridge, United Kingdom
10 h-index
12 publications
382 citations
University of Memphis
Memphis, United States
10 h-index
12 publications
1.3K citations
University of Oxford
Oxford, United Kingdom
10 h-index
12 publications
562 citations
Microsoft (United States)
Redmond, United States
10 h-index
18 publications
2.2K citations

Tel Aviv University
Tel Aviv, Israel
9 h-index
12 publications
396 citations
1–8 of 374
43 publications · 3.1K citations
21
h-index
Repository · 15 publications · 449 citations
12
h-index
13 publications · 540 citations
12
h-index
12 publications · 366 citations
12
h-index
EJP · 12 publications · 775 citations
11
h-index
1–5