title: Degree correlations in random geometric graphs.
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.
authors.affiliation: Information Systems Department, Faculty of Business and Economics, University of Lausanne, Lausanne, Switzerland. alberto.antonioni@unil.ch
authors.forename: A
authors.initials: A
authors.lastname: Antonioni
authors.forename: M
authors.initials: M
authors.lastname: Tomassini
mesh_terms: D000465:Algorithms; D003198:Computer Simulation; D015233:Models, Statistical