Detecting a planted community in an inhomogeneous random graph

DOI10.3150/20-BEJ1269zbMath1468.91113arXiv1909.03217MaRDI QIDQ2040057

Remco van der Hofstad, Nicolas Verzelen, Rui M. Castro, Kay Bogerd

Publication date: 9 July 2021

Published in: Bernoulli (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1909.03217

zbMATH Keywords

scan statisticscommunity detectionminimax hypothesis testinginhomogeneous random graphs

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Random graphs (graph-theoretic aspects) (05C80)

Related Items

Detecting a botnet in a network

Cites Work

• Reconstruction and estimation in the planted partition model
• Generating simple random graphs with prescribed degree distribution
• Community detection in sparse random networks
• Some problems of hypothesis testing leading to infinitely divisible distributions
• An impossibility result for reconstruction in the degree-corrected stochastic block model
• A proof of the block model threshold conjecture
• Nonbacktracking spectrum of random graphs: community detection and nonregular Ramanujan graphs
• Community detection in degree-corrected block models
• Parameterized clique on inhomogeneous random graphs
• Detection of a sparse submatrix of a high-dimensional noisy matrix
• Community detection in dense random networks
• Concentration Inequalities
• Random Graphs and Complex Networks
• Community structure in social and biological networks
• Community Detection and Stochastic Block Models
• A spectral method for community detection in moderately sparse degree-corrected stochastic block models
• Community detection thresholds and the weak Ramanujan property