A Clarified Typology of Core-Periphery Structure in Networks

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.

[1]  David J. C. MacKay,et al.  Information Theory, Inference, and Learning Algorithms , 2004, IEEE Transactions on Information Theory.

[2]  Ling-Yun Wu,et al.  Structure and dynamics of core/periphery networks , 2013, J. Complex Networks.

[3]  Daniel B. Larremore,et al.  Efficiently inferring community structure in bipartite networks , 2014, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  Mark E. J. Newman,et al.  Stochastic blockmodels and community structure in networks , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5]  Alessandro Vespignani,et al.  K-core decomposition of Internet graphs: hierarchies, self-similarity and measurement biases , 2005, Networks Heterog. Media.

[6]  Elizabeth Stowell,et al.  Reclaiming Stigmatized Narratives , 2019, Proc. ACM Hum. Comput. Interact..

[7]  Zhong-Yuan Zhang,et al.  Comment on "Improved mutual information measure for clustering, classification, and community detection" , 2020, ArXiv.

[8]  Jean-Gabriel Young,et al.  Universality of the stochastic block model , 2018, Physical Review E.

[9]  Antoine Allard,et al.  Multi-scale structure and topological anomaly detection via a new network statistic: The onion decomposition , 2015, Scientific Reports.

[10]  Fabio Della Rossa,et al.  Profiling core-periphery network structure by random walkers , 2013, Scientific Reports.

[11]  Kathryn B. Laskey,et al.  Stochastic blockmodels: First steps , 1983 .

[12]  Martin G. Everett,et al.  Models of core/periphery structures , 2000, Soc. Networks.

[13]  Stephen B. Seidman,et al.  Network structure and minimum degree , 1983 .

[14]  Joshua A. Tucker,et al.  The Critical Periphery in the Growth of Social Protests , 2015, PloS one.

[15]  David A. Smith,et al.  Computing continuous core/periphery structures for social relations data with MINRES/SVD , 2010, Soc. Networks.

[16]  Desmond J. Higham,et al.  A Nonlinear Spectral Method for Core-Periphery Detection in Networks , 2018, SIAM J. Math. Data Sci..

[17]  M. Small,et al.  Detection of core-periphery structure in networks based on 3-tuple motifs. , 2017, Chaos.

[18]  Sang Hoon Lee,et al.  Detection of core–periphery structure in networks using spectral methods and geodesic paths , 2014, European Journal of Applied Mathematics.

[19]  S. Fortunato,et al.  Resolution limit in community detection , 2006, Proceedings of the National Academy of Sciences.

[20]  Tiago P. Peixoto.  Efficient Monte Carlo and greedy heuristic for the inference of stochastic block models , 2013, Physical review. E, Statistical, nonlinear, and soft matter physics.

[21]  Naoki Masuda,et al.  Finding multiple core-periphery pairs in networks , 2017, Physical review. E.

[22]  Jock Given,et al.  The wealth of networks: How social production transforms markets and freedom , 2007, Inf. Econ. Policy.

[23]  Yuval Shavitt,et al.  A model of Internet topology using k-shell decomposition , 2007, Proceedings of the National Academy of Sciences.

[24]  Jérôme Kunegis,et al.  KONECT: the Koblenz network collection , 2013, WWW.

[25]  Yong-Yeol Ahn,et al.  CluSim: a python package for calculating clustering similarity , 2019, J. Open Source Softw..

[26]  Tiago P. Peixoto.  Nonparametric Bayesian inference of the microcanonical stochastic block model. , 2016, Physical review. E.

[27]  Mason A. Porter,et al.  Core-Periphery Structure in Networks , 2012, SIAM J. Appl. Math..

[28]  Zizi Papacharissi.  Affective Publics: Sentiment, Technology, and Politics , 2014 .

[29]  Vladimir Batagelj,et al.  An O(m) Algorithm for Cores Decomposition of Networks , 2003, ArXiv.

[30]  Cristopher Moore,et al.  Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[31]  Patrick J. Wolfe,et al.  Network histograms and universality of blockmodel approximation , 2013, Proceedings of the National Academy of Sciences.

[32]  Sergey N. Dorogovtsev,et al.  k-core (bootstrap) percolation on complex networks: Critical phenomena and nonlocal effects , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[33]  M. Meilă.  Comparing clusterings---an information based distance , 2007 .

[34]  Xiao Zhang,et al.  Identification of core-periphery structure in networks , 2014, Physical review. E, Statistical, nonlinear, and soft matter physics.

[35]  Tiago P Peixoto,et al.  Parsimonious module inference in large networks. , 2012, Physical review letters.

[36]  Tiago P. Peixoto.  Bayesian Stochastic Blockmodeling , 2017, Advances in Network Clustering and Blockmodeling.

[37]  Leto Peel,et al.  The ground truth about metadata and community detection in networks , 2016, Science Advances.

[38]  Michalis Vazirgiannis,et al.  The core decomposition of networks: theory, algorithms and applications , 2019, The VLDB Journal.

[39]  Sarah J. Jackson,et al.  #HashtagActivism: Networks of Race and Gender Justice , 2020 .

[40]  James Bailey,et al.  Information Theoretic Measures for Clusterings Comparison: Variants, Properties, Normalization and Correction for Chance , 2010, J. Mach. Learn. Res..

[41]  Tiago P. Peixoto,et al.  A network approach to topic models , 2017, Science Advances.

[42]  Robin Wilson,et al.  Modern Graph Theory , 2013 .

[43]  Mason A. Porter,et al.  Task-Based Core-Periphery Organization of Human Brain Dynamics , 2012, PLoS Comput. Biol..

[44]  Lev Muchnik,et al.  Identifying influential spreaders in complex networks , 2010, 1001.5285.

[45]  Sean Z. W. Lip.  A Fast Algorithm for the Discrete Core/Periphery Bipartitioning Problem , 2011, ArXiv.