Random Geometric Graphs

Random Geometric Graphs is a mathematical model of random graphs in which vertices are randomly embedded in a geometric space and edges are formed between pairs of vertices whose interpoint distance falls below a specified threshold, distinguishing it from other random graph models by its explicit dependence on spatial embedding and proximity.

237

Publications

12K

Citations

403

Authors

240

Institutions

Publications per year

2017–2026

46

Authors

403

  1. EY
    Edmund Yeh

    Yale University, United States

    8 publications · 255 citations

    8

    h-index

  2. ZK
    Zhenning Kong

    Yale University, United States

    7 publications · 201 citations

    7

    h-index

  3. AS
    Alexandre Stauffer

    Microsoft (United States), United States

    6 publications · 202 citations

    6

    h-index

  4. AF
    Alan Frieze

    Carnegie Mellon University, United States

    6 publications · 122 citations

    6

    h-index

  5. CA
    Chen Avin

    Ben-Gurion University of the Negev, Israel

    6 publications · 232 citations

    6

    h-index

1–5 of 403

Venues

  1. Physical review. E

    PRE · 10 publications · 269 citations

    10

    h-index

  2. arXiv (Cornell University)

    Repository · 9 publications · 130 citations

    9

    h-index

  3. Physical Review E

    PRE · 9 publications · 290 citations

    9

    h-index

  4. Advances in Applied Probability

    AAP · 8 publications · 231 citations

    8

    h-index

  5. Random Structures and Algorithms

    6 publications · 563 citations

    6

    h-index

1–5