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

Authors

52

  1. SJ
    Svante Janson

    Uppsala University, Sweden

    5 publications · 415 citations

    5

    h-index

  2. LL
    László Lovász

    Eötvös Loránd University, Hungary

    4 publications · 887 citations

    4

    h-index

  3. BS
    Balázs Szegedy

    Eötvös Loránd University, Hungary

    4 publications · 887 citations

    4

    h-index

  4. BH
    Bénédicte Haas

    Université Paris Dauphine-PSL, France

    2 publications · 55 citations

    2

    h-index

  5. MA
    Marie Albenque

    Laboratoire d'Informatique de l'École Polytechnique, France

    2 publications · 75 citations

    2

    h-index

1–5 of 52

Venues

  1. arXiv (Cornell University)

    Repository · 6 publications · 198 citations

    6

    h-index

  2. Random Structures and Algorithms

    4 publications · 136 citations

    4

    h-index

  3. The Annals of Probability

    3 publications · 129 citations

    3

    h-index

  4. European Journal of Combinatorics

    3 publications · 55 citations

    3

    h-index

  5. ArXiv.org

    Repository · 2 publications · 298 citations

    2

    h-index

1–5