Reverse engineering of linking preferences from network restructuring
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.
Keywords
Cite
@article{arxiv.cond-mat/0405399,
title = {Reverse engineering of linking preferences from network restructuring},
author = {Gergely Palla and Illes Farkas and Imre Derenyi and Albert-Laszlo Barabasi and Tamas Vicsek},
journal= {arXiv preprint arXiv:cond-mat/0405399},
year = {2009}
}
Comments
7 pages, 6 figures, submitted to PRE