Graph Limits Of Random Structures
Graph Limits of Random Structures is a theoretical framework in probabilistic combinatorics that characterizes the asymptotic behavior of sequences of random graphs by representing their limit objects as measurable symmetric functions on the unit interval, thereby enabling the analysis of large-scale structural properties through analytic means.
38
Publications
2.1K
Citations
52
Authors
44
Institutions
Publications per year
2017–2026
6
Parents
38
Limits of dense graph sequences
László Lovász, Balázs Szegedy · Journal of Combinatorial Theory Series B · 2006 · 840 citations
Graph limits and exchangeable random graphs
Persi Diaconis, Svante Janson · ArXiv.org · 2007 · 288 citations · Full text
Sparse exchangeable graphs and their limits via graphon processes
Christian Borgs, Jennifer Chayes, Henry Cohn et al. · arXiv (Cornell University) · 2016 · 67 citations · Full text
1–5 of 38
52
5
h-index
4
h-index
4
h-index
2
h-index
Laboratoire d'Informatique de l'École Polytechnique, France
2 publications · 75 citations
2
h-index
1–5 of 52
44

Uppsala University
Uppsala, Sweden
6 h-index
9 publications
495 citations
Microsoft (United States)
Redmond, United States
4 h-index
10 publications
2K citations

Alfréd Rényi Institute of Mathematics
Budapest, Hungary
3 h-index
4 publications
108 citations
The University of Texas at Austin
Austin, United States
2 h-index
2 publications
31 citations

Eötvös Loránd University
Budapest, Hungary
2 h-index
2 publications
37 citations
Ruhr University Bochum
Bochum, Germany
2 h-index
2 publications
30 citations
Massachusetts Institute of Technology
Cambridge, United States
2 h-index
2 publications
113 citations
Laboratoire de Mathématiques d'Orsay
Orsay, France
2 h-index
4 publications
106 citations
1–8 of 44
Repository · 6 publications · 198 citations
6
h-index
4 publications · 136 citations
4
h-index
3 publications · 129 citations
3
h-index
3 publications · 55 citations
3
h-index
Repository · 2 publications · 298 citations
2
h-index
1–5