A divide‐and‐conquer algorithm for core‐periphery identification in large networks

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 st...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Stat (International Statistical Institute) Ročník 11; číslo 1
Hlavný autor:	Yanchenko, Eric
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	01.12.2022
Predmet:	large and complex data sets networks statistical computing
ISSN:	2049-1573, 2049-1573
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Popis
Shrnutí:	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.
ISSN:	2049-1573 2049-1573
DOI:	10.1002/sta4.475