Papers
Topics
Authors
Recent
Search
2000 character limit reached

Enhanced Flow in Small-World Networks

Published 30 Aug 2013 in cond-mat.dis-nn, cs.SI, and physics.soc-ph | (1309.0040v1)

Abstract: The small-world property is known to have a profound effect on the navigation efficiency of complex networks [J. M. Kleinberg, Nature 406, 845 (2000)]. Accordingly, the proper addition of shortcuts to a regular substrate can lead to the formation of a highly efficient structure for information propagation. Here we show that enhanced flow properties can also be observed in these complex topologies. Precisely, our model is a network built from an underlying regular lattice over which long-range connections are randomly added according to the probability, $P_{ij}\sim r_{ij}{-\alpha}$, where $r_{ij}$ is the Manhattan distance between nodes $i$ and $j$, and the exponent $\alpha$ is a controlling parameter. The mean two-point global conductance of the system is computed by considering that each link has a local conductance given by $g_{ij}\propto r_{ij}{-\delta}$, where $\delta$ determines the extent of the geographical limitations (costs) on the long-range connections. Our results show that the best flow conditions are obtained for $\delta=0$ with $\alpha=0$, while for $\delta \gg 1$ the overall conductance always increases with $\alpha$. For $\delta\approx 1$, $\alpha=d$ becomes the optimal exponent, where $d$ is the topological dimension of the substrate. Interestingly, this exponent is identical to the one obtained for optimal navigation in small-world networks using decentralized algorithms.

Citations (34)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.