聚类系数
和声(颜色)
平均路径长度
小世界网络
计算机科学
拓扑(电路)
复杂网络
人工神经网络
理论计算机科学
数学
图形
最短路径问题
聚类分析
人工智能
组合数学
物理
光学
作者
Massimo Marchiori,Vito Latora
标识
DOI:10.1016/s0378-4371(00)00311-3
摘要
The small-world phenomenon, popularly known as six degrees of separation, has been mathematically formalized by Watts and Strogatz in a study of the topological properties of a network. Small-world networks are defined in terms of two quantities: they have a high clustering coefficient C like regular lattices and a short characteristic path length L typical of random networks. Physical distances are of fundamental importance in applications to real cases; nevertheless, this basic ingredient is missing in the original formulation. Here, we introduce a new concept, the connectivity length D, that gives harmony to the whole theory. D can be evaluated on a global and on a local scale and plays in turn the role of L and 1/C. Moreover, it can be computed for any metrical network and not only for the topological cases. D has a precise meaning in terms of information propagation and describes in a unified way, both the structural and the dynamical aspects of a network: small-worlds are defined by a small global and local D, i.e., by a high efficiency in propagating information both on a local and global scale. The neural system of the nematode C. elegans, the collaboration graph of film actors, and the oldest US subway system, can now be studied also as metrical networks and are shown to be small-worlds.
科研通智能强力驱动
Strongly Powered by AbleSci AI