Optimal Paths in Complex Networks with Correlated Weights: The World-wide Airport Network
arXiv:physics/0609241 · doi:10.1103/PhysRevE.74.056104
Abstract
We study complex networks with weights, , associated with each link connecting node and . The weights are chosen to be correlated with the network topology in the form found in two real world examples, (a) the world-wide airport network, and (b) the {\it E. Coli} metabolic network. Here , where and are the degrees of nodes and , is a random number and represents the strength of the correlations. The case represents correlation between weights and degree, while represents anti-correlation and the case reduces to the case of no correlations. We study the scaling of the lengths of the optimal paths, , with the system size in strong disorder for scale-free networks for different . We calculate the robustness of correlated scale-free networks with different , and find the networks with to be the most robust networks when compared to the other values of . We propose an analytical method to study percolation phenomena on networks with this kind of correlation. We compare our simulation results with the real world-wide airport network, and we find good agreement.
References in corpus (1)
Cited by in corpus (10)
- Critical phenomena in complex networks
- Prominence and control: The weighted rich-club effect
- The International Trade Network: weighted network analysis and modelling
- Microdynamics in stationary complex networks
- How to make a fragile network robust and vice versa
- Global disease spread: statistics and estimation of arrival times
- Arrival Time Statistics in Global Disease Spread
- Transport on weighted Networks: when correlations are independent of degree
- Numerical evaluation of the upper critical dimension of percolation in scale-free networks
- Evolution equation for a model of surface relaxation in complex networks