# Finding multiple core-periphery pairs in networks

arXiv: https://arxiv.org/abs/1702.06903 · HTML: https://mlsanity.com/paper/1702.06903/

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 22 Feb 2017.

## Built on by (most cited first, 3 of 3)

- [Core-Intermediate-Peripheral Index: Factor Analysis of Neighborhood and Shortest Paths-based Centrality Metrics](https://mlsanity.com/paper/2310.06358/) (2023)
- [A multi-core periphery perspective: Ranking via relative centrality](https://mlsanity.com/paper/2406.04487/) (2024)
- [Uncovering the hidden core-periphery structure in hyperbolic networks](https://mlsanity.com/paper/2406.19953/) (2024)

## Abstract (arXiv)

With a core-periphery structure of networks, core nodes are densely interconnected, peripheral nodes are connected to core nodes to different extents, and peripheral nodes are sparsely interconnected. Core-periphery structure composed of a single core and periphery has been identified for various networks. However, analogous to the observation that many empirical networks are composed of densely interconnected groups of nodes, i.e., communities, a network may be better regarded as a collection of multiple cores and peripheries. We propose a scalable algorithm to detect multiple non-overlapping groups of core-periphery structure in a network. We illustrate our algorithm using synthesised and empirical networks. For example, we find distinct core-periphery pairs with different political leanings in a network of political blogs and separation between international and domestic subnetworks of airports in some single countries in a world-wide airport network.