A Clarified Typology of Core-Periphery Structure in Networks

Abstract

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 latter partitions a network into a binary hub-and-spoke layout, while the former 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.

arXiv comment21 pages, 6 figures, 1 table, updated abstract

References in corpus (24)

• The architecture of complex weighted networks
• Identification of influential spreaders in complex networks
• Stochastic blockmodels and community structure in networks
• Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications
• New Model of Internet Topology Using k-shell Decomposition
• MEDUSA - New Model of Internet Topology Using k-shell Decomposition
• The ground truth about metadata and community detection in networks
• Structure and dynamics of core-periphery networks
• A network approach to topic models
• Parsimonious module inference in large networks
• Efficient Monte Carlo and greedy heuristic for the inference of stochastic block models
• Identification of core-periphery structure in networks
• Nonparametric Bayesian inference of the microcanonical stochastic block model
• Scalable detection of statistically significant communities and hierarchies, using message-passing for modularity
• Efficiently inferring community structure in bipartite networks
• k-core (bootstrap) percolation on complex networks: Critical phenomena and nonlocal effects
• Network histograms and universality of blockmodel approximation
• Bayesian stochastic blockmodeling
• Detection of Core-Periphery Structure in Networks Using Spectral Methods and Geodesic Paths
• Finding multiple core-periphery pairs in networks
• Improved mutual information measure for classification and community detection
• Multi-scale structure and topological anomaly detection via a new network statistic: The onion decomposition
• Universality of the stochastic block model
• Detection of core-periphery structure in networks by 3-tuple motifs

Cited by in corpus (12)

• Blockchain Network Analysis: A Comparative Study of Decentralized Banks
• Center-Periphery Structure in Communities: Extracellular Vesicles
• Hierarchical core-periphery structure in networks
• Assortative and preferential attachment lead to core-periphery networks
• Identifying hubs in directed networks
• AOC; Assembling Overlapping Communities
• The behavior of rich-club coefficient in scale-free networks
• An approximation for return time distributions of random walks on sparse networks
• Anatomy of Elite and Mass Polarization in Social Networks
• Sharpest possible clustering bounds using robust random graph analysis
• Global decomposition of networks into multiple cores formed by local hubs
• Construction of simplicial complexes with prescribed degree-size sequences