Optimizing transport efficiency on scale-free networks through assortative or dissortative topology

Abstract

We find that transport on scale-free random networks depends strongly on degree-correlated network topologies whereas transport on Erd$\ddot{o}$s-R$\acute{e}$nyi networks is insensitive to the degree correlation. An approach for the tuning of scale-free network transport efficiency through assortative or dissortative topology is proposed. We elucidate that the unique transport behavior for scale-free networks results from the heterogeneous distribution of degrees.

4 pages, 3 figures

References in corpus (19)

• Emergence of scaling in random networks
• Statistical mechanics of complex networks
• Epidemic spreading in scale-free networks
• Efficient Behavior of Small-World Networks
• Assortative mixing in networks
• Mixing patterns in networks
• Specificity and stability in topology of protein networks
• Generation of uncorrelated random scale-free networks
• The Price of Anarchy in Transportation Networks: Efficiency and Optimality Control
• Construction and properties of assortative random networks
• Epidemic Incidence in Correlated Complex Networks
• Scaling theory of transport in complex networks
• Anomalous Transport in Complex Networks
• Transport in networks with multiple sources and sinks
• Transport and Percolation Theory in Weighted Networks
• Maximum flow and topological structure of complex networks
• Transport of multiple users in complex networks
• Random Electrical Networks on Complete Graphs II: Proofs
• Anomalous electrical and frictionless flow conductance in complex networks

Cited by in corpus (8)

• Efficient routing on multilayered communication networks
• Transportation dynamics on networks of mobile agents
• Effect of degree correlations above the first shell on the percolation transition
• Analysis and perturbation of degree correlation in complex networks
• Jamming in complex networks with degree correlation
• Quantitative modeling of degree-degree correlation in complex networks
• Random degree-degree correlated networks
• Iterative procedure for network inference