Finding multiple core-periphery pairs in networks

Sadamori Kojaku, Naoki Masuda

Research output: Contribution to journalArticlepeer-review

25 Citations (Scopus)

Abstract

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 nonoverlapping groups of core-periphery structure in a network. We illustrate our algorithm using synthesized 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 worldwide airport network.

Original languageEnglish
Article number052313
JournalPhysical Review E
Volume96
Issue number5
DOIs
Publication statusPublished - 2017 Nov 22
Externally publishedYes

ASJC Scopus subject areas

  • Statistical and Nonlinear Physics
  • Statistics and Probability
  • Condensed Matter Physics

Fingerprint

Dive into the research topics of 'Finding multiple core-periphery pairs in networks'. Together they form a unique fingerprint.

Cite this