Random Spatial Network Models with Core-Periphery Structure

Abstract

Core-periphery structure is a common property of complex networks, which is a composition of tightly connected groups of core vertices and sparsely connected periphery vertices. This structure frequently emerges in traffic systems, biology, and social networks via underlying spatial positioning of the vertices. While core-periphery structure is ubiquitous, there have been limited attempts at modeling network data with this structure. Here, we develop a generative, random network model with core-periphery structure that jointly accounts for topological and spatial information by "core scores" of vertices. Our model achieves substantially higher likelihood than existing generative models of core-periphery structure, and we demonstrate how the core scores can be used in downstream data mining tasks, such as predicting airline traffic and classifying fungal networks. We also develop nearly linear time algorithms for learning model parameters and network sampling by using a method akin to the fast multipole method, a technique traditional to computational physics, which allow us to scale to networks with millions of vertices with minor tradeoffs in accuracy.

References in corpus (27)

• Fast unfolding of communities in large networks
• The structure and function of complex networks
• Community detection in graphs
• Lethality and centrality in protein networks
• Spatial Networks
• Community detection algorithms: a comparative analysis
• Mixed membership stochastic blockmodels
• Mixture models and exploratory analysis in networks
• Graph Evolution: Densification and Shrinking Diameters
• Core-periphery organization of complex networks
• Random graphs as models of networks
• Identification of core-periphery structure in networks
• Inferring Network Mechanisms: The Drosophila melanogaster Protein Interaction Network
• Bayesian stochastic blockmodeling
• Higher-order clustering in networks
• Emergence of core-peripheries in networks
• Detection of Core-Periphery Structure in Networks Using Spectral Methods and Geodesic Paths
• Neural development features: Spatio-temporal development of the Caenorhabditis elegans neuronal network
• Rich-cores in networks
• Finding multiple core-periphery pairs in networks
• Density-based and transport-based core-periphery structures in networks
• Core-periphery structure requires something else in the network
• The Computer Science and Physics of Community Detection: Landscapes, Phase Transitions, and Hardness
• Mesoscale analyses of fungal networks as an approach for quantifying phenotypic traits
• Detection of core-periphery structure in networks by 3-tuple motifs
• Found Graph Data and Planted Vertex Covers
• Coin-flipping, ball-dropping, and grass-hopping for generating random graphs from matrices of edge probabilities

Cited by in corpus (5)

• Centrality Measures in Complex Networks: A Survey
• Core-periphery Models for Hypergraphs
• Core-periphery Detection Based on Masked Bayesian Non-negative Matrix Factorization
• Attributed Hypergraph Generation with Realistic Interplay Between Structure and Attributes
• Stochastic Opinion Dynamics for Interest Prediction in Social Networks