Transport on weighted Networks: when correlations are independent of degree
arXiv:cond-mat/0609776 · doi:10.1103/PhysRevE.76.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 non degree 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.
8 pages, 8 figures
References in corpus (9)
- Network Synchronization, Diffusion, and the Paradox of Heterogeneity
- Universality in the synchronization of weighted random networks
- Percolation and Epidemic Thresholds in Clustered Networks
- Optimal Paths in Disordered Complex Networks
- Clustering in complex networks. I. General formalism
- Clustering in complex networks. II. Percolation properties
- Optimal Paths in Complex Networks with Correlated Weights: The World-wide Airport Network
- Numerical evaluation of the upper critical dimension of percolation in scale-free networks
- Maximum flow and topological structure of complex networks