paper

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)