简单(哲学)
聚类分析
聚类系数
等价(形式语言)
平均路径长度
路径(计算)
小世界网络
连接(主束)
无向图
计算机科学
数学
拓扑(电路)
复杂网络
理论计算机科学
组合数学
人工智能
最短路径问题
图形
离散数学
几何学
认识论
哲学
程序设计语言
作者
Hao Song,Xiao‐Jing Wang
标识
DOI:10.1103/physreve.90.062801
摘要
Small-world networks---complex networks characterized by a combination of high clustering and short path lengths---are widely studied using the paradigmatic model of Watts and Strogatz (WS). Although the WS model is already quite minimal and intuitive, we describe an alternative formulation of the WS model in terms of a distance-dependent probability of connection that further simplifies, both practically and theoretically, the generation of directed and undirected WS-type small-world networks. In addition to highlighting an essential feature of the WS model that has previously been overlooked, namely the equivalence to a simple distance-dependent model, this alternative formulation makes it possible to derive exact expressions for quantities such as the degree and motif distributions and global clustering coefficient for both directed and undirected networks in terms of model parameters.
科研通智能强力驱动
Strongly Powered by AbleSci AI