DeepAI AI Chat
Log In Sign Up

Sparse Networks with Core-Periphery Structure

by   Cian Naik, et al.

We propose a statistical model for graphs with a core-periphery structure. To do this we define a precise notion of what it means for a graph to have this structure, based on the sparsity properties of the subgraphs of core and periphery nodes. We present a class of sparse graphs with such properties, and provide methods to simulate from this class, and to perform posterior inference. We demonstrate that our model can detect core-periphery structure in simulated and real-world networks.


page 1

page 2

page 3

page 4


Learning Sparse Graphs with a Core-periphery Structure

In this paper, we focus on learning sparse graphs with a core-periphery ...

Generative Models and Learning Algorithms for Core-Periphery Structured Graphs

We consider core-periphery structured graphs, which are graphs with a gr...

Exchangeable Random Measures for Sparse and Modular Graphs with Overlapping Communities

We propose a novel statistical model for sparse networks with overlappin...

Random Graphs with Prescribed K-Core Sequences: A New Null Model for Network Analysis

In the analysis of large-scale network data, a fundamental operation is ...

Core-periphery structure in networks: a statistical exposition

Many real-world networks are theorized to have core-periphery structure ...

Calibrated Nonparametric Scan Statistics for Anomalous Pattern Detection in Graphs

We propose a new approach, the calibrated nonparametric scan statistic (...

Perturb and Combine to Identify Influential Spreaders in Real-World Networks

Recent research has shown that graph degeneracy algorithms, which decomp...