Core–periphery structure in directed networks. (30th September 2020)

• Record Type: Journal Article
• Authors: Elliott, Andrew; Chiu, Angus; Bazzi, Marya; Reinert, Gesine; Cucuringu, Mihai
• Is Part Of: Proceedings. Volume 476:Number 2241(2020)
• Publication Date: 2020-09-30
• Subjects: core–periphery -- spectral methods -- low-rank approximation -- directed networks; Physical sciences -- Periodicals; Engineering -- Periodicals; Mathematics -- Periodicals; 500
• DOI: 10.1098/rspa.2019.0783
• Languages: English
• ISSNs: 1364-5021

Abstract

Abstract : Empirical networks often exhibit different meso-scale structures, such as community and core–periphery structures. Core–periphery structure typically consists of a well-connected core and a periphery that is well connected to the core but sparsely connected internally. Most core–periphery studies focus on undirected networks. We propose a generalization of core–periphery structure to directed networks. Our approach yields a family of core–periphery block model formulations in which, contrary to many existing approaches, core and periphery sets are edge-direction dependent. We focus on a particular structure consisting of two core sets and two periphery sets, which we motivate empirically. We propose two measures to assess the statistical significance and quality of our novel structure in empirical data, where one often has no ground truth. To detect core–periphery structure in directed networks, we propose three methods adapted from two approaches in the literature, each with a different trade-off between computational complexity and accuracy. We assess the methods on benchmark networks where our methods match or outperform standard methods from the literature, with a likelihood approach achieving the highest accuracy. Applying our methods to three empirical networks—faculty hiring, a world trade dataset and political blogs—illustrates that our proposed structure provides novel insights in empirical networks.