Abstract
We propose a statistical model for graphs with a core-periphery structure. We give 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.
Funding Statement
Cian Naik has been supported by the Engineering and Physical Sciences Research Council and Medical Research Council [award reference 1930478]. François Caron has been supported by the Engineering and Physical Sciences Research Council under grant EP/P026753/1. Judith Rousseau has received funding for the project from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 834175).
Citation
Cian Naik. François Caron. Judith Rousseau. "Sparse networks with core-periphery structure." Electron. J. Statist. 15 (1) 1814 - 1868, 2021. https://doi.org/10.1214/21-EJS1819
Information
