Scaling theory of transport in complex networks
arXiv:cond-mat/0702151 · doi:10.1073/pnas.0700250104
Abstract
Transport is an important function in many network systems and understanding its behavior on biological, social, and technological networks is crucial for a wide range of applications. However, it is a property that is not well-understood in these systems and this is probably due to the lack of a general theoretical framework. Here, based on the finding that renormalization can be applied to bio-networks, we develop a scaling theory of transport in self-similar networks. We demonstrate the networks invariance under length scale renormalization and we show that the problem of transport can be characterized in terms of a set of critical exponents. The scaling theory allows us to determine the influence of the modular structure on transport. We also generalize our theory by presenting and verifying scaling arguments for the dependence of transport on microscopic features, such as the degree of the nodes and the distance between them. Using transport concepts such as diffusion and resistance we exploit this invariance and we are able to explain, based on the topology of the network, recent experimental results on the broad flow distribution in metabolic networks.
8 pages, 6 figures
Cited by in corpus (37)
- Critical phenomena in complex networks
- First-passage times in complex scale-invariant media
- Exact solution for mean first-passage time on a pseudofractal scale-free web
- Standard random walks and trapping on the Koch network with scale-free behavior and small-world effect
- State-dependent changes of connectivity patterns and functional brain network topology in Autism Spectrum Disorder
- Determination of multifractal dimensions of complex networks by means of the sandbox algorithm
- Perspective: network-guided pattern formation of neural dynamics
- Fractal scale-free networks resistant to disease spread
- Optimal and suboptimal networks for efficient navigation measured by mean-first passage time of random walks
- Transport in networks with multiple sources and sinks
- Anomalous behavior of trapping on a fractal scale-free network
- Fick-Jacobs description and first passage dynamics for diffusion in a channel under stochastic resetting
- Model validation of simple-graph representations of metabolism
- Optimizing transport efficiency on scale-free networks through assortative or dissortative topology
- Scaling of mean first-passage time as efficiency measure of nodes sending information on scale-free Koch networks
- Scaling theory of fractal complex networks
- Influences of degree inhomogeneity on average path length and random walks in disassortative scale-free networks
- Unveiling the Importance of Nonshortest Paths in Quantum Networks
- Metabolic networks are almost nonfractal: A comprehensive evaluation
- Exact eigenvalue spectrum of a class of fractal scale-free networks
- Multifractality in random networks with power-law decaying bond strengths
- Propinquity drives the emergence of network structure and density
- Self-Avoiding Walk on Fractal Complex Networks: Exactly Solvable Cases
- Network evolution towards optimal dynamical performance
- First-passage times in conical varying-width channels biased by a transverse gravitational force: Comparison of analytical and numerical results
- Response to targeted perturbations for random walks on networks
- Community detection by resistance distance: automation and benchmark testing
- Model-based reconstruction of real-world fractal complex networks
- Cross-frequency interactions during diffusion on complex brain networks are facilitated by scale-free properties
- Universal Linear Response of First-Passage Kinetics: A Framework for Prediction and Inference
- Random walks on bifractal networks
- Optimal search strategies on complex networks
- The conundrum of functional brain networks: small-world efficiency or fractal modularity
- A big-world network in ASD: Dynamical connectivity analysis reflects a deficit in long-range connections and an excess of short-range connections
- A stylised view on structural and functional connectivity in dynamical processes in networks
- Generalisation of the fractal Einstein law relating conduction and diffusion on networks
- "Spectrally gapped" random walks on networks: a Mean First Passage Time formula