计算机科学
拓扑(电路)
复杂网络
动力系统理论
平均路径长度
复杂系统
网络拓扑
类比
理论计算机科学
随机图
分布式计算
小世界网络
最短路径问题
图形
数学
人工智能
物理
万维网
哲学
组合数学
语言学
量子力学
操作系统
作者
Duncan J. Watts,Steven H. Strogatz
出处
期刊:Nature
[Springer Nature]
日期:1998-06-01
卷期号:393 (6684): 440-442
被引量:39415
摘要
Networks of coupled dynamical systems have been used to model biological oscillators, Josephson junction arrays, excitable media, neural networks, spatial games, genetic control networks and many other self-organizing systems. Ordinarily, the connection topology is assumed to be either completely regular or completely random. But many biological, technological and social networks lie somewhere between these two extremes. Here we explore simple models of networks that can be tuned through this middle ground: regular networks 'rewired' to introduce increasing amounts of disorder. We find that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs. We call them 'small-world' networks, by analogy with the small-world phenomenon (popularly known as six degrees of separation. The neural network of the worm Caenorhabditis elegans, the power grid of the western United States, and the collaboration graph of film actors are shown to be small-world networks. Models of dynamical systems with small-world coupling display enhanced signal-propagation speed, computational power, and synchronizability. In particular, infectious diseases spread more easily in small-world networks than in regular lattices.
科研通智能强力驱动
Strongly Powered by AbleSci AI