Weight-driven growing networks
T. Antal, P. L. Krapivsky
Abstract
We study growing networks in which each link carries a certain weight (randomly assigned at birth and fixed thereafter). The weight of a node is defined as the sum of the weights of the links attached to the node, and the network grows via the simplest weight-driven rule: A newly-added node is connected to an already existing node with the probability which is proportional to the weight of that node. We show that the node weight distribution n(w) has a universal, that is independent on the link weight distribution, tail: n(w) ~ w-3 as w->oo. Results are particularly neat for the exponential link weight distribution when n(w) is algebraic over the entire weight range.
Create a lesson
Related papers
Orbital cancellation and reentrant localization in a quasiperiodic trimer ladder
Xin Wang, Pei-Jie Chang, Quanfeng Lu et al.
Quantum Localization in Geometric Complex Networks
Jan Lewenstein-Sanpera, Tobias Grass, M. Àngeles Serrano et al.
Eigenstate transitions and critical transport in 3D Aubry-André model
Pragna Das, Lev Vidmar, Miroslav Hopjan
Weyl's theorem and the theoretical origin of Boson peak in two-dimensional scalar spring network
Cunyuan Jiang
On physical implementability of reinforcement-learning-driven reasoning
Eiji Konishi
The Stone-Wales trefoil: a new topological defect in graphene
M. V. Kondrin, Y. B. Lebed, V. V. Brazhkin