Random geometric graphs
Top Cited Papers
- 24 July 2002
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review E
- Vol. 66 (1) , 016121
- https://doi.org/10.1103/physreve.66.016121
Abstract
We analyze graphs in which each vertex is assigned random coordinates in a geometric space of arbitrary dimensionality and only edges between adjacent points are present. The critical connectivity is found numerically by examining the size of the largest cluster. We derive an analytical expression for the cluster coefficient, which shows that the graphs are distinctly different from standard random graphs, even for infinite dimensionality. Insights relevant for graph bipartitioning are included.Keywords
All Related Versions
This publication has 37 references indexed in Scilit:
- Are randomly grown graphs really random?Physical Review E, 2001
- Clustering and preferential attachment in growing networksPhysical Review E, 2001
- Random graphs with arbitrary degree distributions and their applicationsPhysical Review E, 2001
- Exploring complex networksNature, 2001
- Resilience of the Internet to Random BreakdownsPhysical Review Letters, 2000
- Navigation in a small worldNature, 2000
- Emergence of Scaling in Random NetworksScience, 1999
- Growth dynamics of the World-Wide WebNature, 1999
- Collective dynamics of ‘small-world’ networksNature, 1998
- Critical Behavior in the Satisfiability of Random Boolean ExpressionsScience, 1994