Degree correlations in random geometric graphs
Alberto Antonioni, Marco Tomassini
Abstract
Open-access reader
Alberto Antonioni, Marco Tomassini
Abstract
Open-access reader
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.
OpenAlex reports 51 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: Random graph, Clustering coefficient, Degree (music), Random geometric graph, Spatial network, Mathematics, Geometric networks, Geometric graph theory