A Clarified Typology of Core-Periphery Structure in Networks

05/20/2020
by   Ryan J. Gallagher, et al.
0

Core-periphery structure, the arrangement of a network into a dense core and sparse periphery, is a versatile descriptor of various social, biological, and technological networks. In practice, different core-periphery algorithms are often applied interchangeably, despite the fact that they can yield inconsistent descriptions of core-periphery structure. For example, two of the most widely used algorithms, the k-cores decomposition and the classic two-block model of Borgatti and Everett, extract fundamentally different structures: the former partitions a network into a binary hub-and-spoke layout, while the latter divides it into a layered hierarchy. We introduce a core-periphery typology to clarify these differences, along with Bayesian stochastic block modeling techniques to classify networks in accordance with this typology. Empirically, we find a rich diversity of core-periphery structure among networks. Through a detailed case study, we demonstrate the importance of acknowledging this diversity and situating networks within the core-periphery typology when conducting domain-specific analyses.

READ FULL TEXT

page 4

page 5

research
12/02/2019

Core-Periphery Structure in Directed Networks

While studies of meso-scale structures in networks often focus on commun...
research
08/18/2018

Real-time Emissions of Telecom Core Networks

This paper focuses on investigating the direct and life cycle assessment...
research
01/16/2021

Informative core identification in complex networks

In network analysis, the core structure of modeling interest is usually ...
research
03/01/2022

Hierarchical team structure and multidimensional localization (or siloing) on networks

Knowledge silos emerge when structural properties of organizational inte...
research
03/25/2023

Cores in multiway networks

The notion of a core is generalized to multiway networks. To determine t...
research
04/06/2019

Density-friendly Graph Decomposition

Decomposing a graph into a hierarchical structure via k-core analysis is...
research
08/30/2019

Parameter-free Structural Diversity Search

The problem of structural diversity search is to nd the top-k vertices w...

Please sign up or login with your details

Forgot password? Click here to reset