Sparse Networks with Core-Periphery Structure

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 propertie...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2019-10
Main Authors: Naik, Cian, Caron, François, Rousseau, Judith
Format: Article
Language:English
Subjects:
Computer simulation
Graph theory
Graphs
Statistical models
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2331-8422