Community detection via an efficient nonconvex optimization approach based on modularity

DOI10.1016/j.csda.2020.107163OpenAlexW3115448423MaRDI QIDQ830497

Quan Yuan, Binghui Liu

Publication date: 7 May 2021

Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.csda.2020.107163

zbMATH Keywords

subset selectionmodularityDC programmingcommunity detectiontruncated \(L_1\) penalty

Mathematics Subject Classification ID

Statistics (62-XX)

Related Items

Detecting communities in complex networks using triangles and modularity density

Uses Software

• GraphBase

Cites Work

• Unnamed Item
• Pseudo-likelihood methods for community detection in large sparse networks
• Network cross-validation by edge sampling
• A novel and efficient algorithm for de novo discovery of mutated driver pathways in cancer
• On semidefinite relaxations for the block model
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• Consistency of spectral clustering in stochastic block models
• Convexified modularity maximization for degree-corrected stochastic block models
• An Efficient Heuristic Procedure for Partitioning Graphs
• Latent Space Approaches to Social Network Analysis
• Likelihood-Based Selection and Sharp Parameter Estimation
• Collective dynamics of ‘small-world’ networks
• Estimating network edge probabilities by neighbourhood smoothing
• Diffusion-based method for producing density-equalizing maps

This page was built for publication: Community detection via an efficient nonconvex optimization approach based on modularity