Reverse engineering of linking preferences from network restructuring
arXiv:cond-mat/0405399 · doi:10.1103/PhysRevE.70.046115
Abstract
We provide a method to deduce the preferences governing the restructuring dynamics of a network from the observed rewiring of the edges. Our approach is applicable for systems in which the preferences can be formulated in terms of a single-vertex energy function with f(k) being the contribution of a node of degree k to the total energy, and the dynamics obeys the detailed balance. The method is first tested by Monte-Carlo simulations of restructuring graphs with known energies, then it is used to study variations of real network systems ranging from the co-authorship network of scientific publications to the asset graphs of the New York Stock Exchange. The empirical energies obtained from the restructuring can be described by a universal function f(k) -k ln(k), which is consistent with and justifies the validity of the preferential attachment rule proposed for growing networks.
7 pages, 6 figures, submitted to PRE
References in corpus (16)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- Who is the best connected scientist? A study of scientific coauthorship networks
- Evolution of the social network of scientific collaborations
- Clustering and preferential attachment in growing networks
- Connectivity of Growing Random Networks
- Measuring preferential attachment for evolving networks
- Asset trees and asset graphs in financial markets
- Statistical ensemble of scale-free random graphs
- Correlated random networks
- Uncorrelated Random Networks
- Principles of statistical mechanics of random networks
- Statistical mechanics of topological phase transitions in networks
- Scale free networks from a Hamiltonian dynamics
- Topological phase transitions of random networks
- Eprints and the Open Archives Initiative