Random Graph Models

Random Graph Models is a theoretical framework in network analysis that characterizes networks as probabilistic instances generated by stochastic rules, distinguishing it from deterministic or rule-based network models by emphasizing randomness in edge formation.

2.2K

Publications

238.7K

Citations

3.2K

Authors

1.2K

Institutions

Publications per year

2017–2026

479

Authors

3.2K

  1. GR
    Garry Robins

    The University of Melbourne, Australia

    23 publications · 6.7K citations

    22

    h-index

  2. SJ
    Svante Janson

    Uppsala University, Sweden

    35 publications · 2.6K citations

    21

    h-index

  3. RV
    Remco van der Hofstad

    Eindhoven University of Technology, Netherlands

    28 publications · 1.3K citations

    20

    h-index

  4. AF
    Alan Frieze

    Carnegie Mellon University, United States

    33 publications · 1.5K citations

    20

    h-index

  5. ME
    M. E. J. Newman

    University of Michigan, United States

    20 publications · 12.3K citations

    20

    h-index

1–5 of 3.2K

Venues

  1. Random Structures and Algorithms

    150 publications · 10.9K citations

    49

    h-index

  2. Physical Review E

    PRE · 78 publications · 9.2K citations

    38

    h-index

  3. arXiv (Cornell University)

    Repository · 86 publications · 3.7K citations

    32

    h-index

  4. Social Networks

    33 publications · 7K citations

    27

    h-index

  5. Combinatorics Probability Computing

    49 publications · 2K citations

    27

    h-index

1–5