Smallest small-world network
- 30 October 2002
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review E
- Vol. 66 (4), 046139
- https://doi.org/10.1103/physreve.66.046139
Abstract
Efficiency in passage times is an important issue in designing networks, such as transportation or computer networks. The small-world networks have structures that yield high efficiency, while keeping the network highly clustered. We show that among all networks with the small-world structure, the most efficient ones have a “single center” node, from which all shortcuts are connected to uniformly distributed nodes over the network. The networks with several centers and a connected subnetwork of shortcuts are shown to be “almost” as efficient. Genetic-algorithm simulations further support our results.Keywords
This publication has 12 references indexed in Scilit:
- Evolution of networksAdvances in Physics, 2002
- Efficient Behavior of Small-World NetworksPhysical Review Letters, 2001
- The small world inside large metabolic networksProceedings Of The Royal Society B-Biological Sciences, 2001
- Small worldsRandom Structures & Algorithms, 2001
- Small worlds: How and whyPhysical Review E, 2001
- The structure of scientific collaboration networksProceedings of the National Academy of Sciences, 2001
- Mean-Field Solution of the Small-World Network ModelPhysical Review Letters, 2000
- Exactly solvable small-world networkEurophysics Letters, 2000
- Diameter of the World-Wide WebNature, 1999
- Collective dynamics of ‘small-world’ networksNature, 1998