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 Erdos-Renyi 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.