Core-periphery structure requires something else in the network

Sadamori Kojaku, Naoki Masuda

Research output: Contribution to journalArticlepeer-review

19 Citations (Scopus)

Abstract

A network with core-periphery structure consists of core nodes that are densely interconnected. In contrast to a community structure, which is a different meso-scale structure of networks, core nodes can be connected to peripheral nodes and peripheral nodes are not densely interconnected. Although core-periphery structure sounds reasonable, we argue that it is merely accounted for by heterogeneous degree distributions, if one partitions a network into a single core block and a single periphery block, which the famous Borgatti-Everett algorithm and many succeeding algorithms assume. In other words, there is a strong tendency that high-degree and low-degree nodes are judged to be core and peripheral nodes, respectively. To discuss core-periphery structure beyond the expectation of the node's degree (as described by the configuration model), we propose that one needs to assume at least one block of nodes apart from the focal core-periphery structure, such as a different core-periphery pair, community or nodes not belonging to any meso-scale structure. We propose a scalable algorithm to detect pairs of core and periphery in networks, controlling for the effect of the node's degree. We illustrate our algorithm using various empirical networks.

Original languageEnglish
Article number043012
JournalNew Journal of Physics
Volume20
Issue number4
DOIs
Publication statusPublished - 2018 Apr
Externally publishedYes

Keywords

  • core-periphery structure
  • mesoscale structure
  • networks

ASJC Scopus subject areas

  • Physics and Astronomy(all)

Fingerprint

Dive into the research topics of 'Core-periphery structure requires something else in the network'. Together they form a unique fingerprint.

Cite this