Degree Correlations in Random Geometric Graphs

  title={Degree Correlations in Random Geometric Graphs},
  author={Alberto Antonioni and Marco Tomassini},
  journal={Physical review. E, Statistical, nonlinear, and soft matter physics},
  volume={86 3 Pt 2},
  • A. Antonioni, M. Tomassini
  • Published 11 July 2012
  • Mathematics, Computer Science
  • Physical review. E, Statistical, nonlinear, and soft matter physics
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. 

Figures from this paper

A growing social network model in geographical space
A new model for the generation of social networks that includes their often ignored spatial aspects, and it is numerically shown that for a given range of the combination parameter, and for given mean degree, the generated network class shares many important statistical features with those observed in actual social networks, including the spatial dependence of connections.
An Energy-Based Model for Spatial Social Networks
An extension of the RGG construction is presented to define a new model to build bi-dimensional spatial networks based on energy as realistic constraint to create the links, which have several properties in common with those of actual social networks.
REDS: An Energy-Constrained Spatial Social Network Model
It is demonstrated that the model generates non-trivial community structure and that, unlike for random geometric graphs, densely connected communities do not simply arise as a consequence of an initial locational advantage.
Spatial Strength Centrality and the Effect of Spatial Embeddings on Network Architecture
This paper extends existing models of synthetic networks to spatial network models by first embedding nodes in Euclidean space and then modifying the models so that progressively longer edges occur with progressively smaller probabilities.
Random spherical graphs
This work addresses a modification of the random geometric graph (RGG) model by considering a set of points uniformly and independently distributed on the surface of a $(d-1)$-sphere with radius $r$
Topological Strata of Weighted Complex Networks
This work introduces a novel method, based on persistent homology, to detect particular non-local structures, akin to weighted holes within the link-weight network fabric, which are invisible to existing methods and creates the first bridge between network theory and algebraic topology, which will allow to import the toolset of algebraic methods to complex systems.
Ju l 2 01 8 Random spherical graphs
Abstract This work addresses a modification of the random geometric graph (RGG) model by considering a set of points uniformly and independently distributed on the surface of a (d − 1)-sphere with
Degree difference: a simple measure to characterize structural heterogeneity in complex networks
A simple, elegant yet underexplored measure, ‘degree difference’ (DD) between vertices of an edge, is analyzed to understand the local network geometry and is shown to be an indicator for topological robustness of scale-free networks.
Quasirandom geometric networks from low-discrepancy sequences.
It is concluded from this intensive computational study that in terms of the uniformity of the distribution of the vertices in the unit square, the quasirandom networks look more random than the random geometric networks.
Homophily as a process generating social networks: insights from Social Distance Attachment model
It is found that homophily, especially when combined with a random edge rewiring, is sufficient to reproduce many of the characteristic features of social networks, and it is demonstrated that degree assortativity can be highly dependent on the particular kind of enforced degree sequence.


Random geometric graphs.
An analytical expression for the cluster coefficient is derived, which shows that the graphs in which each vertex is assigned random coordinates in a geometric space of arbitrary dimensionality are distinctly different from standard random graphs, even for infinite dimensionality.
Clustering of correlated networks.
  • S. N. Dorogovtsev
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2004
We obtain the clustering coefficient, the degree-dependent local clustering, and the mean clustering of networks with arbitrary correlations between the degrees of the nearest-neighbor vertices. The
Maximal-entropy random walks in complex networks with limited information.
It is demonstrated that an almost maximal-entropy random walk is obtained when the step probabilities are proportional to a power of the degree of the target node, with an exponent α that depends on the degree-degree correlations and is equal to 1 in uncorrelated graphs.
The Structure and Function of Complex Networks
Developments in this field are reviewed, including such concepts as the small-world effect, degree distributions, clustering, network correlations, random graph models, models of network growth and preferential attachment, and dynamical processes taking place on networks.
Class of correlated random networks with hidden variables.
The general model is extended to describe a practical algorithm to generate random networks with an a priori specified correlation structure and an extension is presented, to map nonequilibrium growing networks to networks with hidden variables that represent the time at which each vertex was introduced in the system.
Spatial Networks
  • M. Barthelemy
  • Computer Science
    Encyclopedia of Social Network Analysis and Mining
  • 2014
Dynamical and correlation properties of the internet.
It is found that the Internet is characterized by non-trivial correlations among nodes and different dynamical regimes, and the importance of node hierarchy and aging in the Internet structure and growth is pointed out.
Networks: An Introduction
This book brings together for the first time the most important breakthroughs in each of these fields and presents them in a coherent fashion, highlighting the strong interconnections between work in different areas.
Assortative mixing in networks.
  • M. Newman
  • Computer Science
    Physical review letters
  • 2002
This work proposes a model of an assortatively mixed network and finds that networks percolate more easily if they are assortative and that they are also more robust to vertex removal.