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 (4)

• Scaling theory of 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

Cited by in corpus (1)

• Jamming in complex networks with degree correlation