Transport between multiple users in complex networks

DOI10.1140/EPJB/E2007-00129-0MaRDI QIDQ978810zbMATH OpenOpenAlexFDO

Authors H. Eugene Stanley, Shai Carmi, Zhenhua Wu, Eduardo López, Shlomo Havlin

Publication date 25 June 2010

Published in The European Physical Journal B. Condensed Matter and Complex Systems (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/cond-mat/0609031

Mathematics Subject Classification ID

Applications of graph theory (05C90) Social networks; opinion dynamics (91D30) Applications of statistical and quantum mechanics to economics (econophysics) (91B80) Time-dependent statistical mechanics (dynamic and nonequilibrium) (82C99)

Abstract: We study the transport properties of model networks such as scale-free and ErdH{o}s-R'{e}nyi networks as well as a real network. We consider the conductance $G$ between two arbitrarily chosen nodes where each link has the same unit resistance. Our theoretical analysis for scale-free networks predicts a broad range of values of $G$, with a power-law tail distribution $Ph{i}_{mSF}(G)sim{G}^{-g_G}$, where $g_G=2lambda-1$, and $lambda$ is the decay exponent for the scale-free network degree distribution. We confirm our predictions by large scale simulations. The power-law tail in $Ph{i}_{mSF}(G)$ leads to large values of $G$, thereby significantly improving the transport in scale-free networks, compared to ErdH{o}s-R'{e}nyi networks where the tail of the conductivity distribution decays exponentially. We develop a simple physical picture of the transport to account for the results. We study another model for transport, the emph{max-flow} model, where conductance is defined as the number of link-independent paths between the two nodes, and find that a similar picture holds. The effects of distance on the value of conductance are considered for both models, and some differences emerge. We then extend our study to the case of multiple sources, where the transport is define between two emph{groups} of nodes. We find a fundamental difference between the two forms of flow when considering the quality of the transport with respect to the number of sources, and find an optimal number of sources, or users, for the max-flow case. A qualitative (and partially quantitative) explanation is also given.

Recommendations

• Anomalous electrical and frictionless flow conductance in complex networks
• LOAD DISTRIBUTION IN CONGESTED SCALE-FREE NETWORKS
• TRANSPORT ON COMPLEX NETWORKS: FLOW, JAMMING AND OPTIMIZATION
• scientific article; zbMATH DE number 1996193
• Traffic flow densities in large transport networks

Cites work

• A critical point for random graphs with a given degree sequence
• Anomalous electrical and frictionless flow conductance in complex networks
• Diffusion and reactions in fractals and disordered systems
• Emergence of Scaling in Random Networks
• Network flows. Theory, algorithms, and applications.
• On implementing the push-relabel method for the maximum flow problem
• Statistical mechanics of complex networks

Cited in

(5)

• scientific article; zbMATH DE number 1996193 (Why is no real title available?)
• Interpolating between random walks and optimal transportation routes: flow with multiple sources and targets
• Anomalous electrical and frictionless flow conductance in complex networks
• DYNAMICS BEHAVIORS OF SCALE-FREE NETWORKS WITH ELASTIC DEMAND
• GENERALIZED SHORTEST PATH AND TRAFFIC EQUILIBRIUM IN COMPLEX TRANSPORTATION NETWORKS

This page was built for publication: Transport between multiple users in complex networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q978810)