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

TL;DR

This paper investigates how degree correlations in scale-free networks influence transport efficiency, proposing methods to optimize it via assortative or dissortative topologies, unlike Erdős-Rényi networks.

Contribution

It introduces a novel approach to tune transport efficiency in scale-free networks by adjusting degree correlations, highlighting their impact on network performance.

Findings

Transport efficiency in scale-free networks depends on degree correlation.

Erdős-Rényi networks are insensitive to degree correlation.

Heterogeneous degree distribution causes unique transport behaviors.

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.