Smallest small-world network
Disordered Systems and Neural Networks
2009-11-07 v1 Statistical Mechanics
Adaptation and Self-Organizing Systems
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'', 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.
Cite
@article{arxiv.cond-mat/0210686,
title = {Smallest small-world network},
author = {Takashi Nishikawa and Adilson E. Motter and Ying-Cheng Lai and Frank C. Hoppensteadt},
journal= {arXiv preprint arXiv:cond-mat/0210686},
year = {2009}
}
Comments
5 pages, 6 figures, REVTeX4