Hierarchical core-periphery structure in networks

Abstract

We study core-periphery structure in networks using inference methods based on a flexible network model that allows for traditional onion-like cores within cores, but also for hierarchical tree-like structures and more general non-nested types of structure. We propose an efficient Monte Carlo scheme for fitting the model to observed networks and report results for a selection of real-world data sets. Among other things, we observe an empirical distinction between networks showing traditional core-periphery structure with a dense core weakly connected to a sparse periphery, and an alternative structure in which the core is strongly connected both within itself and to the periphery. Networks vary in whether they are better represented by one type of structure or the other. We also observe structures that are a hybrid between core-periphery structure and community structure, in which networks have a set of non-overlapping cores that correspond roughly to communities, surrounded by a single undifferentiated periphery. Computer code implementing our methods is available.

code available: https://github.com/apolanco115/hcp

References in corpus (10)

• Fast unfolding of communities in large networks
• Modularity and community structure in networks
• Uncovering the overlapping community structure of complex networks in nature and society
• Hierarchical structure and the prediction of missing links in networks
• Stochastic blockmodels and community structure in networks
• New Model of Internet Topology Using k-shell Decomposition
• Emergence of network features from multiplexity
• Core-periphery organization of complex networks
• Identification of core-periphery structure in networks
• Efficient method for estimating the number of communities in a network