A testing based extraction algorithm for identifying significant communities in networks
From MaRDI portal
Publication:484064
DOI10.1214/14-AOAS760zbMath1304.05141arXiv1308.0777WikidataQ103589709 ScholiaQ103589709MaRDI QIDQ484064
James D. Wilson, Shankar Bhamidi, Peter J. Mucha, Simi Wang, Andrew B. Nobel
Publication date: 17 December 2014
Published in: The Annals of Applied Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1308.0777
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Social networks; opinion dynamics (91D30) Graph algorithms (graph-theoretic aspects) (05C85) Paired and multiple comparisons; multiple testing (62J15)
Related Items
A testing based approach to the discovery of differentially correlated variable sets, Validation of community robustness, An Escape Time Formulation for Subgraph Detection and Partitioning of Directed Graphs, A testing based extraction algorithm for identifying significant communities in networks, Computing exact \(p\)-values for community detection, Fusing data depth with complex networks: community detection with prior information, Unnamed Item, Unnamed Item, Compressive Sensing for Cut Improvement and Local Clustering
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Pseudo-likelihood methods for community detection in large sparse networks
- A testing based extraction algorithm for identifying significant communities in networks
- Finding large average submatrices in high dimensional data
- The asymptotic number of labeled graphs with given degree sequences
- Estimation and prediction for stochastic blockmodels for graphs with latent block structure
- A decision-theoretic generalization of on-line learning and an application to boosting
- Consistency of community detection in networks under degree-corrected stochastic block models
- A nonparametric view of network models and Newman–Girvan and other modularities
- Spectral redemption in clustering sparse networks
- Mixed membership stochastic blockmodels
- Emergence of Scaling in Random Networks
- Community Structure in Time-Dependent, Multiscale, and Multiplex Networks
- Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
- Information, Physics, and Computation
- Communities in Networks
- A new approach to the maximum-flow problem
- Tabu Search—Part I
- Estimation and Prediction for Stochastic Blockstructures
- Latent Space Approaches to Social Network Analysis
- Community structure in social and biological networks
- A critical point for random graphs with a given degree sequence
- A Survey of Statistical Network Models
- Overlapping community detection in networks
- The elements of statistical learning. Data mining, inference, and prediction
