群落结构
中心性
计算机科学
传递关系
集团渗流法
可靠性(半导体)
财产(哲学)
复杂网络
数据科学
生物网络
不断发展的网络
学位分布
网络科学
理论计算机科学
网络分析
数据挖掘
网络结构
社交网络(社会语言学)
万维网
功率(物理)
数学
统计
物理
组合数学
认识论
哲学
量子力学
社会化媒体
作者
Michelle Girvan,M. E. J. Newman
标识
DOI:10.1073/pnas.122653799
摘要
A number of recent studies have focused on the statistical properties of networked systems such as social networks and the Worldwide Web. Researchers have concentrated particularly on a few properties that seem to be common to many networks: the small-world property, power-law degree distributions, and network transitivity. In this article, we highlight another property that is found in many networks, the property of community structure, in which network nodes are joined together in tightly knit groups, between which there are only looser connections. We propose a method for detecting such communities, built around the idea of using centrality indices to find community boundaries. We test our method on computer-generated and real-world graphs whose community structure is already known and find that the method detects this known structure with high sensitivity and reliability. We also apply the method to two networks whose community structure is not well known--a collaboration network and a food web--and find that it detects significant and informative community divisions in both cases.
科研通智能强力驱动
Strongly Powered by AbleSci AI