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

Smallest small-world network. / Nishikawa, Takashi; Motter, Adilson E.; Lai, Ying-Cheng; Hoppensteadt, Frank C.

In: Physical Review. E, Statistical, Nonlinear and Soft Matter Physics, Vol. 66, No. 4, 046139, 10.2002.

Research output: Contribution to journalArticle

Nishikawa, Takashi ; Motter, Adilson E. ; Lai, Ying-Cheng ; Hoppensteadt, Frank C. / Smallest small-world network. In: Physical Review. E, Statistical, Nonlinear and Soft Matter Physics. 2002 ; Vol. 66, No. 4.
@article{cb6ea8335a6e4a3785045ccc9be4213b,
title = "Smallest small-world network",
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.",
author = "Takashi Nishikawa and Motter, {Adilson E.} and Ying-Cheng Lai and Hoppensteadt, {Frank C.}",
year = "2002",
month = "10",
doi = "10.1103/PhysRevE.66.046139",
language = "English",
volume = "66",
journal = "Physical Review. E, Statistical, Nonlinear and Soft Matter Physics",
issn = "1539-3755",
publisher = "AMER PHYSICAL SOC",
number = "4",

}

TY - JOUR

T1 - Smallest small-world network

AU - Nishikawa, Takashi

AU - Motter, Adilson E.

AU - Lai, Ying-Cheng

AU - Hoppensteadt, Frank C.

PY - 2002/10

Y1 - 2002/10

N2 - 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.

AB - 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.

U2 - 10.1103/PhysRevE.66.046139

DO - 10.1103/PhysRevE.66.046139

M3 - Article

VL - 66

JO - Physical Review. E, Statistical, Nonlinear and Soft Matter Physics

JF - Physical Review. E, Statistical, Nonlinear and Soft Matter Physics

SN - 1539-3755

IS - 4

M1 - 046139

ER -