虚假关系
无标度网络
聚类分析
学位分布
比例(比率)
计算机科学
背景(考古学)
聚类系数
平均路径长度
路径(计算)
目的地
经济地理学
计量经济学
小世界网络
实证研究
分布(数学)
优先依附
复杂网络
数据科学
最短路径问题
理论计算机科学
地理
数学
统计
人工智能
机器学习
计算机网络
图形
万维网
旅游
地图学
考古
数学分析
作者
Jarle Aarstad,Håvard Ness,Sven A. Haugland
标识
DOI:10.1109/icit.2013.6505891
摘要
Small-world networks are characterized by local clustering and shortcut ties that reduce the path-length between the clusters. Scale-free networks, on the other hand, take a skewed degree distribution. Few empirical works have aimed to interrelate or integrate these influential social theories, and here we address this issue. Our empirical context spans several winter sport destinations and we retrospectively reconstruct the development of an inter-firm network. When the path-length at the outset is large (short) the concept is negatively (positively) associated with the scale-free distribution. Other studies have shown that scale-free networks are vulnerable for targeted attacks, and an implication from our finding is that small-world networks can also be vulnerable for targeted attacks (particularly when the path-length's association with the scale-free distribution reaches a maximum). We also find an inverse relationship between local clustering and scale-free distribution, but the association may be spurious.
科研通智能强力驱动
Strongly Powered by AbleSci AI