Informative core identification in complex networks
Not on the map. Why?
Abstract (arXiv)
In network analysis, the core structure of modeling interest is usually hidden in a larger network in which most structures are not informative. The noise and bias introduced by the non-informative component in networks can obscure the salient structure and limit many network modeling procedures' effectiveness. This paper introduces a novel core-periphery model for the non-informative periphery structure of networks without imposing a specific form for the informative core structure. We propose spectral algorithms for core identification as a data preprocessing step for general downstream network analysis tasks based on the model. The algorithm enjoys a strong theoretical guarantee of accuracy and is scalable for large networks. We evaluate the proposed method by extensive simulation studies demonstrating various advantages over many traditional core-periphery methods. The method is applied to extract the informative core structure from a citation network and give more informative results in the downstream hierarchical community detection.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 24 of its 58 references that are in the map. First posted on arXiv 16 Jan 2021.
Builds on
24 of 58 references.
References · 24
- 2013Consistency of spectral clustering in stochastic block modelscited by 128
- 2017Statistical inference on random dot product graphs: a surveycited by 70
- 2013Regularized Spectral Clustering under the Degree-Corrected Stochastic Blockmodelcited by 45
- 2015Achieving Optimal Misclassification Proportion in Stochastic Block Modelcited by 35
- 2015Estimating network edge probabilities by neighborhood smoothingcited by 28
- 2013Incoherence-Optimal Matrix Completioncited by 27
- 2016Network cross-validation by edge samplingcited by 26
- 2018On a 'Two Truths' Phenomenon in Spectral Graph Clusteringcited by 24
- 2014Coauthorship and Citation Networks for Statisticianscited by 22
- 2015Information Limits for Recovering a Hidden Communitycited by 18
- 2020Spectral Algorithms for Community Detection in Directed Networkscited by 17
- 2018Hierarchical community detection by recursive partitioningcited by 16
12 more
- 2015Computational and Statistical Boundaries for Submatrix Localization in a Large Noisy Matrixcited by 12
- 2014Identification of core-periphery structure in networkscited by 11
- 2016Community detection in networks: Modularity optimization and maximum likelihood are equivalentcited by 10
- 2015Improved Sum-of-Squares Lower Bounds for Hidden Clique and Hidden Submatrix Problemscited by 9
- 2017Testing for Global Network Structure Using Small Subgraph Statisticscited by 9
- 2013Subgraph Frequencies: Mapping the Empirical and Extremal Geography of Large Graph Collectionscited by 8
- 2014Detection of Core-Periphery Structure in Networks Using Spectral Methods and Geodesic Pathscited by 5
- 2020Consistency of Spectral Clustering on Hierarchical Stochastic Block Modelscited by 5
- 2017Core-periphery structure requires something else in the networkcited by 2
- 2013Density-based and transport-based core-periphery structures in networkscited by 1
- 2015Centrality metrics and localization in core-periphery networkscited by 1
- 2020Community models for networks observed through edge nominationscited by 1
Built on by
Citing papers per year: 2021: 3.
3 papers.