Detection of Core-Periphery Structure in Networks Using Spectral Methods and Geodesic Paths

Abstract

We introduce several novel and computationally efficient methods for detecting "core--periphery structure" in networks. Core--periphery structure is a type of mesoscale structure that includes densely-connected core vertices and sparsely-connected peripheral vertices. Core vertices tend to be well-connected both among themselves and to peripheral vertices, which tend not to be well-connected to other vertices. Our first method, which is based on transportation in networks, aggregates information from many geodesic paths in a network and yields a score for each vertex that reflects the likelihood that a vertex is a core vertex. Our second method is based on a low-rank approximation of a network's adjacency matrix, which can often be expressed as a tensor-product matrix. Our third approach uses the bottom eigenvector of the random-walk Laplacian to infer a coreness score and a classification into core and peripheral vertices. We also design an objective function to (1) help classify vertices into core or peripheral vertices and (2) provide a goodness-of-fit criterion for classifications into core versus peripheral vertices. To examine the performance of our methods, we apply our algorithms to both synthetically-generated networks and a variety of networks constructed from real-world data sets.

This article is part of EJAM's December 2016 special issue on "Network Analysis and Modelling" (available at https://www.cambridge.org/core/journals/european-journal-of-applied-mathematics/issue/journal-ejm-volume-27-issue-6/D245C89CABF55DBF573BB412F7651ADB)

References in corpus (18)

• Uncovering the overlapping community structure of complex networks in nature and society
• Finding community structure in networks using the eigenvectors of matrices
• Maps of random walks on complex networks reveal community structure
• Temporal Networks
• Structure and tie strengths in mobile communication networks
• Influence maximization in complex networks through optimal percolation
• Social Structure of Facebook Networks
• An efficient and principled method for detecting communities in networks
• Core-periphery organization of complex networks
• Role Discovery in Networks
• Identification of core-periphery structure in networks
• Think Locally, Act Locally: The Detection of Small, Medium-Sized, and Large Communities in Large Networks
• Emergence of core-peripheries in networks
• Spectral tripartitioning of networks
• Density-based and transport-based core-periphery structures in networks
• Finding and testing network communities by lumped Markov chains
• Centrality metrics and localization in core-periphery networks
• Network nestedness as generalized core-periphery structures

Cited by in corpus (24)

• A Clarified Typology of Core-Periphery Structure in Networks
• Finding multiple core-periphery pairs in networks
• Core-periphery structure requires something else in the network
• Core-Periphery Structure in Directed Networks
• Multiscale core-periphery structure in a global liner shipping network
• Mesoscale analyses of fungal networks as an approach for quantifying phenotypic traits
• Blockchain Network Analysis: A Comparative Study of Decentralized Banks
• A Unified Method of Detecting Core-Periphery Structure and Community Structure in Networks
• Network nestedness as generalized core-periphery structures
• Random Spatial Network Models with Core-Periphery Structure
• Detecting Central Nodes from Low-rank Excited Graph Signals via Structured Factor Analysis
• Hierarchical core-periphery structure in networks
• Detection of core-periphery structure in networks by 3-tuple motifs
• Core-Periphery in Networks: An Axiomatic Approach
• Convexity in complex networks
• Disturbance of questionable publishing to academia
• Entrograms and coarse graining of dynamics on complex networks
• Core-periphery Detection Based on Masked Bayesian Non-negative Matrix Factorization
• Dynamic Default Contagion in Heterogeneous Interbank Systems
• Informative core identification in complex networks
• Online Inference for Mixture Model of Streaming Graph Signals with Non-White Excitation
• Global decomposition of networks into multiple cores formed by local hubs
• Spectral Embedding of Graph Networks
• Network effects in default clustering for large systems