Smallest small-world network

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

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

23 Scopus citations

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 (US)
Pages (from-to)5
Number of pages1
JournalPhysical Review E - Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics
Volume66
Issue number4
DOIs
StatePublished - Oct 30 2002

ASJC Scopus subject areas

  • Statistical and Nonlinear Physics
  • Statistics and Probability
  • Condensed Matter Physics

Fingerprint Dive into the research topics of 'Smallest small-world network'. Together they form a unique fingerprint.

Cite this