A testing based extraction algorithm for identifying significant communities in networks
From MaRDI portal
(Redirected from Publication:484064)
Abstract: A common and important problem arising in the study of networks is how to divide the vertices of a given network into one or more groups, called communities, in such a way that vertices of the same community are more interconnected than vertices belonging to different ones. We propose and investigate a testing based community detection procedure called Extraction of Statistically Significant Communities (ESSC). The ESSC procedure is based on -values for the strength of connection between a single vertex and a set of vertices under a reference distribution derived from a conditional configuration network model. The procedure automatically selects both the number of communities in the network and their size. Moreover, ESSC can handle overlapping communities and, unlike the majority of existing methods, identifies "background" vertices that do not belong to a well-defined community. The method has only one parameter, which controls the stringency of the hypothesis tests. We investigate the performance and potential use of ESSC and compare it with a number of existing methods, through a validation study using four real network data sets. In addition, we carry out a simulation study to assess the effectiveness of ESSC in networks with various types of community structure, including networks with overlapping communities and those with background vertices. These results suggest that ESSC is an effective exploratory tool for the discovery of relevant community structure in complex network systems. Data and software are available at urlhttp://www.unc.edu/~jameswd/research.html.
Recommendations
- scientific article; zbMATH DE number 6982944
- Community extraction in multilayer networks with heterogeneous community structure
- A Hypothesis Testing Framework for Modularity Based Network Community Detection
- Hypothesis testing for automated community detection in networks
- Computing exact \(p\)-values for community detection
Cites work
- scientific article; zbMATH DE number 3645126 (Why is no real title available?)
- scientific article; zbMATH DE number 3168330 (Why is no real title available?)
- scientific article; zbMATH DE number 720689 (Why is no real title available?)
- A critical point for random graphs with a given degree sequence
- A decision-theoretic generalization of on-line learning and an application to boosting
- A new approach to the maximum-flow problem
- A nonparametric view of network models and Newman–Girvan and other modularities
- A survey of statistical network models
- A testing based extraction algorithm for identifying significant communities in networks
- Communities in 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
- Community structure in social and biological networks
- Consistency of community detection in networks under degree-corrected stochastic block models
- Emergence of Scaling in Random Networks
- Estimation and Prediction for Stochastic Blockstructures
- Estimation and prediction for stochastic blockmodels for graphs with latent block structure
- Finding large average submatrices in high dimensional data
- Information, Physics, and Computation
- Latent Space Approaches to Social Network Analysis
- Mixed membership stochastic blockmodels
- Overlapping community detection in networks
- Pseudo-likelihood methods for community detection in large sparse networks
- Spectral redemption in clustering sparse networks
- Tabu Search—Part I
- The asymptotic number of labeled graphs with given degree sequences
- The elements of statistical learning. Data mining, inference, and prediction
Cited in
(13)- Computing exact \(p\)-values for community detection
- An Escape Time Formulation for Subgraph Detection and Partitioning of Directed Graphs
- Discovery of extreme events-related communities in contrasting groups of physical system networks
- Fusing data depth with complex networks: community detection with prior information
- A testing based approach to the discovery of differentially correlated variable sets
- An interactive graphical method for community detection in network data
- scientific article; zbMATH DE number 6982944 (Why is no real title available?)
- Validation of community robustness
- PCABM: Pairwise Covariates-Adjusted Block Model for Community Detection
- A testing based extraction algorithm for identifying significant communities in networks
- A Hypothesis Testing Framework for Modularity Based Network Community Detection
- Compressive sensing for cut improvement and local clustering
- Community extraction in multilayer networks with heterogeneous community structure
This page was built for publication: A testing based extraction algorithm for identifying significant communities in networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q484064)
