2005
//
Network Science

Minimum spanning trees of weighted scale-free networks

Abstract
A complete characterization of real networks requires us to understand the consequences of the uneven interaction strengths between a system’s components. Here we use minimum spanning trees (MSTs) to explore the effect of correlations between link weights and network topology on scale-free networks. Solely by changing the nature of the correlations between weights and network topology, the structure of the MSTs can change from scale-free to exponential. Additionally, for some choices of weight correlations, the efficiency of the MSTs increases with increasing network size, a result with potential implications for the design and scalability of communication networks.

..

More publications
A. Vazquez, R. Dobrin, D. Sergi, J.-P. Eckmann, Z. N. Oltvai, A.-L. Barabási

Proceedings of the National Academy of Sciences 101, 17940-17945 (2004)

view
N. Schwartz, R. Cohen, D. ben-Avraham, A.-L. Barabási, S. Havlin

Physical Review E 66, 015104 (2002)

view
I. J. Farkas, I. Derenyi, A.-L. Barabási, T. Vicsek

Physical Review E Physical Review, 026704 (2001)

view