分而治之算法
芯(光纤)
计算机科学
鉴定(生物学)
算法
网络结构
极限(数学)
度量(数据仓库)
核心网络
特征(语言学)
复杂网络
理论计算机科学
数据挖掘
数学
电信
生物
植物
数学分析
万维网
哲学
语言学
出处
期刊:Stat
[Wiley]
日期:2022-05-26
卷期号:11 (1)
摘要
Core-periphery structure is an important network feature where the network is broken into two components: a densely connected core and a loosely connected periphery. In this work, we propose a divide-and-conquer algorithm to identify the core-periphery structure in large networks. By finding this structure on much smaller sub-samples of the network and then combining the results across sub-samples, this method yields fast and accurate core-periphery labels. Additionally, the method provides a measure of the statistical significance of the structure. We apply our approach to synthetic data to find the algorithm's detection limit and on a real-world network with more than 35,000 nodes.
科研通智能强力驱动
Strongly Powered by AbleSci AI