# Sparse Networks with Core-Periphery Structure

arXiv: https://arxiv.org/abs/1910.09679 · HTML: https://mlsanity.com/paper/1910.09679/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 21 Oct 2019.

## Built on by (most cited first, 1 of 1)

- [Rapidly Varying Completely Random Measures for Modeling Extremely Sparse Networks](https://mlsanity.com/paper/2505.13206/) (2025)

## Abstract (arXiv)

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.