Geometric evolution of complex networks
arXiv:1710.01600 · doi:10.1103/PhysRevE.97.032309
Abstract
We present a general class of geometric network growth mechanisms by homogeneous attachment in which the links created at a given time are distributed homogeneously between a new node and the exising nodes selected uniformly. This is achieved by creating links between nodes uniformly distributed in a homogeneous metric space according to a Fermi-Dirac connection probability with inverse temperature and general time-dependent chemical potential . The chemical potential limits the spatial extent of newly created links. Using a hidden variable framework, we obtain an analytical expression for the degree sequence and show that can be fixed to yield any given degree distributions, including a scale-free degree distribution. Additionally, we find that depending on the order in which nodes appear in the network---its ---the degree-degree correlation can be tuned to be assortative or disassortative. The effect of the geometry on the structure is investigated through the average clustering coefficient . In the thermodynamic limit, we identify a phase transition between a random regime where when and a geometric regime where when .
References in corpus (29)
- Assortative mixing in networks
- Mixing patterns in networks
- Classes of behavior of small-world networks
- Spatial Networks
- Structural Vulnerability of the North American Power Grid
- Hyperbolic Geometry of Complex Networks
- The statistical mechanics of networks
- Popularity versus Similarity in Growing Networks
- Navigability of Complex Networks
- Random Geometric Graphs
- Statistical Analysis of Airport Network of China
- Class of correlated random networks with hidden variables
- Structural Properties of Planar Graphs of Urban Street Patterns
- Self-similarity of complex networks and hidden metric spaces
- Cut-offs and finite size effects in scale-free networks
- Network Mapping by Replaying Hyperbolic Growth
- Curvature and temperature of complex networks
- Random geometric graphs with general connection functions
- Emergence of Soft Communities from Geometric Preferential Attachment
- The hidden geometry of weighted complex networks
- Network Geometry Inference using Common Neighbors
- Clustering implies geometry in networks
- Spatial preferential attachment networks: Power laws and clustering coefficients
- Preferential attachment in growing spatial networks
- Dimensionality of social networks using motifs and eigenvalues
- Continuum percolation with steps in an annulus
- Scale-invariant geometric random graphs
- Hamiltonian Dynamics of Preferential Attachment
- Duality between preferential attachment and static random networks on hyperbolic spaces