Abstract
Spatially embedded networks are important in several disciplines. The prototypical spatial network we assume is the Random Geometric Graph, of which many properties are known. Here we present new results for the two-point degree correlation function in terms of the clustering coefficient of the graphs for two-dimensional space in particular, with extensions to arbitrary finite dimensions.
- Received 21 June 2012
DOI:https://doi.org/10.1103/PhysRevE.86.037101
©2012 American Physical Society
