Sparse Random Graphs

Sparse Random Graphs is a probabilistic model of graphs characterized by a low edge-to-vertex density, in which edges are generated independently with small probability, distinguishing it from dense random graph models by preserving sparsity in the limiting regime.

568

Publications

32K

Citations

740

Authors

405

Institutions

Publications per year

2017–2026

146

Authors

740

  1. AF
    Alan Frieze

    Carnegie Mellon University, United States

    27 publications · 1.3K citations

    18

    h-index

  2. JX
    Jiaming Xu

    University of Illinois Urbana-Champaign, United States

    13 publications · 475 citations

    12

    h-index

  3. AM
    Andrea Montanari

    Stanford University, United States

    13 publications · 880 citations

    12

    h-index

  4. YW
    Yihong Wu

    Yale University, United States

    11 publications · 421 citations

    10

    h-index

  5. YK
    Yoshiharu Kohayakawa

    Universidade de São Paulo, Brazil

    12 publications · 352 citations

    10

    h-index

1–5 of 740

Venues

  1. arXiv (Cornell University)

    Repository · 59 publications · 2K citations

    27

    h-index

  2. Random Structures and Algorithms

    52 publications · 4.9K citations

    27

    h-index

  3. Discrete Mathematics

    21 publications · 856 citations

    15

    h-index

  4. The Annals of Probability

    14 publications · 805 citations

    14

    h-index

  5. Combinatorics Probability Computing

    16 publications · 766 citations

    13

    h-index

1–5