Weighted self-similar networks under preferential attachment

We introduce an abstract evolutionary formalism that generates weighted networks whose growth under stochastic preferential attachment triggers unrestricted weight rearrangements in existing links. The class of resulting algorithms for different parameter values includes the Barabási–Albert and Barrat–Barthélemy–Vespignani models as special cases. We solve the recursions that describe the average growth to derive exact solutions for the expected degree and strength distribution, the individual strength and weight development and the joint distribution of neighboring degrees. We find that the network exhibits a particular form of self-similarity, namely every sufficiently interconnected node has on average the same constitution of small-degree neighbors as any other node of large degree. Finally we suggest potential applications in several fields of interest.