Finding multiple core-periphery pairs in networks

Sadamori Kojaku, Naoki Masuda

研究成果: Article査読

25 被引用数 (Scopus)

抄録

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.

本文言語English
論文番号052313
ジャーナルPhysical Review E
96
5
DOI
出版ステータスPublished - 2017 11 22
外部発表はい

ASJC Scopus subject areas

  • 統計物理学および非線形物理学
  • 統計学および確率
  • 凝縮系物理学

フィンガープリント

「Finding multiple core-periphery pairs in networks」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル