Transport on weighted networks: When the correlations are independent of the degree
- 21 December 2007
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review E
- Vol. 76 (6) , 066106
Abstract
Most real-world networks are weighted graphs with the weight of the edges reflecting the relative importance of the connections. In this work, we study nondegree dependent correlations between edge weights, generalizing thus the correlations beyond the degree dependent case. We propose a simple method to introduce weight-weight correlations in topologically uncorrelated graphs. This allows us to test different measures to discriminate between the different correlation types and to quantify their intensity. We also discuss here the effect of weight correlations on the transport properties of the networks, showing that positive correlations dramatically improve transport. Finally, we give two examples of real-world networks (social and transport graphs) in which weight-weight correlations are present.Keywords
All Related Versions
This publication has 40 references indexed in Scilit:
- Clustering in complex networks. II. Percolation propertiesPhysical Review E, 2006
- Clustering in complex networks. I. General formalismPhysical Review E, 2006
- Social inertia in collaboration networksPhysical Review E, 2006
- Load distribution in weighted complex networksPhysical Review E, 2005
- Generalized percolation in random directed networksPhysical Review E, 2005
- Weight-driven growing networksPhysical Review E, 2005
- Global organization of metabolic fluxes in the bacterium Escherichia coliNature, 2004
- Statistical mechanics of complex networksReviews of Modern Physics, 2002
- Scientific collaboration networks. II. Shortest paths, weighted networks, and centralityPhysical Review E, 2001
- A critical point for random graphs with a given degree sequenceRandom Structures & Algorithms, 1995