Random Regular Graphs

Random Regular Graphs is a probabilistic combinatorial model that generates graphs uniformly at random from the set of all regular graphs of a specified degree, distinguished by the constraint that every vertex has the same fixed number of incident edges.

291

Publications

15.8K

Citations

425

Authors

288

Institutions

Publications per year

2017–2026

90

Variants

Random Regular Graph

Authors

425

  1. NW
    Nicholas Wormald

    The University of Melbourne, Australia

    26 publications · 1.6K citations

    19

    h-index

  2. AF
    Alan Frieze

    Carnegie Mellon University, United States

    16 publications · 772 citations

    15

    h-index

  3. CC
    Colin Cooper

    King's College London, United Kingdom

    8 publications · 534 citations

    8

    h-index

  4. NC
    N. C. Wormald

    The University of Melbourne, Australia

    8 publications · 621 citations

    8

    h-index

  5. JH
    Jeong Han Kim

    Microsoft (United States), United States

    7 publications · 343 citations

    7

    h-index

1–5 of 425

Venues

  1. Random Structures and Algorithms

    24 publications · 1K citations

    16

    h-index

  2. Physical Review E

    PRE · 13 publications · 869 citations

    13

    h-index

  3. Combinatorics Probability Computing

    16 publications · 800 citations

    13

    h-index

  4. arXiv (Cornell University)

    Repository · 18 publications · 474 citations

    12

    h-index

  5. SIAM Journal on Discrete Mathematics

    11 publications · 467 citations

    11

    h-index

1–5