Universal behavior of optimal paths in weighted networks with general disorder
arXiv:cond-mat/0508759 · doi:10.1103/PhysRevLett.96.068702
Abstract
We study the statistics of the optimal path in both random and scale free networks, where weights are taken from a general distribution . We find that different types of disorder lead to the same universal behavior. Specifically, we find that a single parameter ( for -dimensional lattices, and for random networks) determines the distributions of the optimal path length, including both strong and weak disorder regimes. Here is the percolation connectivity exponent, and depends on the percolation threshold and . For uniform, Poisson or Gaussian the crossover from weak to strong does not occur, and only weak disorder exists.
Accepted by PRL
References in corpus (4)
Cited by in corpus (22)
- Optimal Path and Minimal Spanning Trees in Random Weighted Networks
- Screened non-bonded interactions in native proteins manipulate optimal paths for robust residue communication
- Percolation model for the superconductor-insulator transition in granular films
- Shear Zones in granular materials: Optimization in a self-organized random potential
- Transport on weighted Networks: when correlations are independent of degree
- Transport and Percolation Theory in Weighted Networks
- Topological Anderson amorphous insulator
- Weak disorder asymptotics in the stochastic mean-field model of distance
- The shape of shortest paths in random spatial networks
- Optimization of transport protocols with path-length constraints in complex networks
- Simulating SIR processes on networks using weighted shortest paths
- Impulse-Induced Optimum Signal Amplification in Scale-Free Networks
- Structural crossover of polymers in disordered media
- Drastic disorded-induced reduction of signal amplification in scale-free networks
- Weighted projected networks: mapping hypergraphs to networks
- The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs
- Shape effects in the fluctuations of random isochrones on a square lattice
- Disorder Induced Limited Path Percolation
- Stylized Facts in Internal Rates of Return on Stock Index and its Derivative Transactions
- Scaling of internode distances in weighted complex networks
- The diameter of the minimum spanning tree of the complete graph with inhomogeneous random weights
- Scaling limits and universality: Critical percolation on weighted graphs converging to an graphon