Smallest small-world network

Takashi Nishikawa, Adilson E. Motter, Ying-Cheng Lai, Frank C. Hoppensteadt

Research output: Contribution to journalArticle

23 Citations (Scopus)

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.

Original languageEnglish
Article number046139
Number of pages5
JournalPhysical Review. E, Statistical, Nonlinear and Soft Matter Physics
Volume66
Issue number4
DOIs
Publication statusPublished - Oct 2002

Cite this

Nishikawa, T., Motter, A. E., Lai, Y-C., & Hoppensteadt, F. C. (2002). Smallest small-world network. Physical Review. E, Statistical, Nonlinear and Soft Matter Physics, 66(4), [046139]. https://doi.org/10.1103/PhysRevE.66.046139