Degree Correlations in Random Geometric Graphs

Abstract

Spatially embedded networks are important in several disciplines. The prototypical spatial net- work 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 dimension.

References in corpus (9)

• The structure and function of complex networks
• Assortative mixing in networks
• Spatial Networks
• Dynamical and correlation properties of the Internet
• Random Geometric Graphs
• Class of correlated random networks with hidden variables
• Maximal-entropy random walks in complex networks with limited information
• Continuum percolation of wireless ad hoc communication networks
• Clustering of correlated networks

Cited by in corpus (9)

• Topological strata of weighted complex networks
• Random Rectangular Graphs
• Homophily as a Process Generating Social Networks: Insights from Social Distance Attachment Model
• Degree difference: A simple measure to characterize structural heterogeneity in complex networks
• Random spherical graphs
• Optimal forwarding ratio on dynamical networks with heterogeneous mobility
• Spatial Strength Centrality and the Effect of Spatial Embeddings on Network Architecture
• Dropping mortality by increasing connectivity in plant epidemics
• Connectivity of Cooperative Ad hoc Networks