Computing exact p-values for community detection

DOI10.1007/S10618-020-00681-0MaRDI QIDQ1987192zbMATH OpenOpenAlexFDO

Authors Zengyou He, Hao Liang, Zheng Chen, Can Zhao, Yan Liu

Publication date 9 April 2020

Published in Data Mining and Knowledge Discovery (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10618-020-00681-0

zbMATH Keywords

community detectionErdős-Rényi modelrandom graphsstatistical significance

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of statistics to economics (62P20) Statistical aspects of big data and data science (62R07) Social networks; opinion dynamics (91D30)

Recommendations

• Optimal Estimation of the Number of Network Communities
• Computational complexity, phase transitions, and message-passing for community detection
• Community detection in degree-corrected block models
• Community detection in dense random networks
• Probabilistic Community Detection With Unknown Number of Communities
• Community detection with the weighted parsimony criterion
• An axiomatic approach to community detection
• Community detection in sparse networks via Grothendieck's inequality
• Community detection in sparse random networks

Cites work

• A testing based extraction algorithm for identifying significant communities in networks
• Algorithms for graph partitioning on the planted partition model
• Clustering coefficients of large networks
• Community structure in social and biological networks
• Fast unfolding of communities in large networks
• scientific article; zbMATH DE number 6982944 (Why is no real title available?)
• Hypothesis testing for automated community detection in networks
• Network cross-validation for determining the number of communities in network data
• Networks
• On community structure validation in real networks
• On the statistical detection of clusters in undirected networks
• Random graph dynamics
• Validation of community robustness
• When are networks truly modular?

Cited in

(4)

• Validation of community robustness
• Community detection based on significance optimization in complex networks
• A testing based extraction algorithm for identifying significant communities in networks
• Community detection in complex networks: from statistical foundations to data science applications

Describes a project that uses

Uses Software

• ESSC
• qstest

This page was built for publication: Computing exact \(p\)-values for community detection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1987192)