Hamiltonian Dynamics of Preferential Attachment
arXiv:1504.07981 · doi:10.1088/1751-8113/49/10/105001
Abstract
Prediction and control of network dynamics are grand-challenge problems in network science. The lack of understanding of fundamental laws driving the dynamics of networks is among the reasons why many practical problems of great significance remain unsolved for decades. Here we study the dynamics of networks evolving according to preferential attachment, known to approximate well the large-scale growth dynamics of a variety of real networks. We show that this dynamics is Hamiltonian, thus casting the study of complex networks dynamics to the powerful canonical formalism, in which the time evolution of a dynamical system is described by Hamilton's equations. We derive the explicit form of the Hamiltonian that governs network growth in preferential attachment. This Hamiltonian turns out to be nearly identical to graph energy in the configuration model, which shows that the ensemble of random graphs generated by preferential attachment is nearly identical to the ensemble of random graphs with scale-free degree distributions. In other words, preferential attachment generates nothing but random graphs with power-law degree distribution. The extension of the developed canonical formalism for network analysis to richer geometric network models with non-degenerate groups of symmetries may eventually lead to a system of equations describing network dynamics at small scales.
arXiv comment16 pages, 5 figures
References in corpus (30)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- Epidemic spreading in scale-free networks
- Evolution of the social network of scientific collaborations
- Clustering and preferential attachment in growing networks
- Structure of Growing Networks: Exact Solution of the Barabasi--Albert's Model
- Connectivity of Growing Random Networks
- Hyperbolic Geometry of Complex Networks
- Large-scale topological and dynamical properties of Internet
- The statistical mechanics of networks
- Popularity versus Similarity in Growing Networks
- Measuring preferential attachment for evolving networks
- Class of correlated random networks with hidden variables
- Entropy measures for complex networks: Toward an information theory of complex topologies
- Analytical maximum-likelihood method to detect patterns in real networks
- Maximum likelihood: extracting unbiased information from complex networks
- Traffic-driven Epidemic Spreading in Finite-size Scale-Free Networks
- Correlated random networks
- Network Cosmology
- Breaking of ensemble equivalence in networks
- Principles of statistical mechanics of random networks
- Asymptotic behavior and distributional limits of preferential attachment graphs
- Hyperbolic Graph Generator
- Scale free networks from a Hamiltonian dynamics
- Exponential Random Simplicial Complexes
- Brittleness of Bayesian Inference Under Finite Information in a Continuous World
- Entropy distribution and condensation in random networks with a given degree distribution
- Clustering of random scale-free networks
- Duality between equilibrium and growing networks
- Causal and homogeneous networks