Scaling of internode distances in weighted complex networks

Abstract

We extend the previously observed scaling equation connecting the internode distances and nodes' degrees onto the case of weighted networks. We show that the scaling takes a similar form in the empirical data obtained from networks characterized by different relations between node's strength and its degree. In the case of explicit equation for s(k) (e.g. linear or scale-free), the new coefficients of scaling equation can be easily obtained. We support our analysis with numerical simulations for Erdos-Renyi random graphs with different weight distributions.

9 pages, 4 figures, submitted to International Journal of Modern Physics C

References in corpus (13)

• The architecture of complex weighted networks
• Weighted evolving networks: coupling topology and weights dynamics
• Weighted Evolving Networks
• Statistical analysis of 22 public transport networks in Poland
• General Dynamics of Topology and Traffic on Weighted Technological Networks
• Emergence of communities in weighted networks
• Transport in weighted networks: Partition into superhighways and roads
• Generalized Bose-Fermi statistics and structural correlations in weighted networks
• Universal scaling of distances in complex networks
• Scaling of human behavior during portal browsing
• Universal behavior of optimal paths in weighted networks with general disorder
• Transport on weighted Networks: when correlations are independent of degree
• Log-periodic oscillations due to discrete effects in complex networks