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
237
1–5 of 237
403
8
h-index
7
h-index
6
h-index
6
h-index
6
h-index
1–5 of 403
240
Carnegie Mellon University
Pittsburgh, United States
10 h-index
14 publications
1.6K citations

University of Bristol
Bristol, United Kingdom
8 h-index
13 publications
442 citations
Stanford University
Stanford, United States
8 h-index
15 publications
651 citations
University of California, Berkeley
Berkeley, United States
8 h-index
17 publications
1.6K citations
Yale University
New Haven, United States
7 h-index
13 publications
462 citations
University of Cambridge
Cambridge, United Kingdom
7 h-index
10 publications
408 citations

Centre National de la Recherche Scientifique
Paris, France
7 h-index
13 publications
322 citations
University of California San Diego
San Diego, United States
6 h-index
8 publications
2.1K citations
1–8 of 240
PRE · 10 publications · 269 citations
10
h-index
Repository · 9 publications · 130 citations
9
h-index
PRE · 9 publications · 290 citations
9
h-index
AAP · 8 publications · 231 citations
8
h-index
6 publications · 563 citations
6
h-index
1–5