2019/10/21 by Naik, Cian, Caron, François, Rousseau, Judith
#05C80. Secondary: 60G55 #FOS: Computer and information sciences #FOS: Physical sciences #Methodology (stat.ME) #Physics and Society (physics.soc-ph) #Primary: 62F15 #Social and Information Networks (cs.SI)
paper · doi:10.48550/arxiv.1910.09679
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.