Optimizing transport efficiency on scale-free networks through assortative or dissortative topology
classification
❄️ cond-mat.stat-mech
physics.soc-ph
keywords
transportnetworksscale-freeassortativedissortativeefficiencynetworktopology
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.