Random Graph Processes

Random Graph Processes is a stochastic process that evolves by sequentially adding edges to an initially edgeless graph according to a probabilistic rule, thereby generating a dynamic model of graph formation in which the emergence of structural properties can be studied over time.

396

Publications

26.6K

Citations

606

Authors

374

Institutions

Publications per year

2017–2026

59

Authors

606

  1. AF
    Alan Frieze

    Carnegie Mellon University, United States

    12 publications · 943 citations

    12

    h-index

  2. BB
    Béla Bollobás

    University of Memphis, United States

    11 publications · 2.2K citations

    11

    h-index

  3. MK
    Michael Krivelevich

    Tel Aviv University, Israel

    10 publications · 319 citations

    10

    h-index

  4. TŁ
    Tomasz Łuczak

    Adam Mickiewicz University in Poznań, Poland

    11 publications · 930 citations

    10

    h-index

  5. OR
    Oliver Riordan

    University of Memphis, United States

    9 publications · 1.2K citations

    9

    h-index

1–5 of 606

Venues

  1. Random Structures and Algorithms

    43 publications · 3.1K citations

    21

    h-index

  2. arXiv (Cornell University)

    Repository · 15 publications · 449 citations

    12

    h-index

  3. Combinatorics Probability Computing

    13 publications · 540 citations

    12

    h-index

  4. Journal of Statistical Physics

    12 publications · 366 citations

    12

    h-index

  5. Electronic Journal of Probability

    EJP · 12 publications · 775 citations

    11

    h-index

1–5