Multilevel local optimization of modularity

MaRDI QIDQ2912427zbMATH OpenFDO

Authors Thomas Aynaud, Vincent D. Blondel, Jean-Loup Guillaume, Renaud Lambiotte

Publication date 14 September 2012

zbMATH Keywords

Louvain methodmodularity optimization

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Applications of graph theory (05C90) Network design and communication in computer systems (68M10) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Using graph partitioning for efficient network modularity optimization
• A Scalable Multilevel Algorithm for Graph Clustering and Community Structure Detection
• Multilevel local search algorithms for modularity clustering
• Fast unfolding of communities in large networks
• On Finding Graph Clusterings with Maximum Modularity

Cited in

(7)

• Bulk locality from modular flow
• Efficient modularity density heuristics for large graphs
• Nonlinear consensus on networks: equilibria, effective resistance, and trees of motifs
• Using graph partitioning for efficient network modularity optimization
• Multilevel local search algorithms for modularity clustering
• Post-processing hierarchical community structures: quality improvements and multi-scale view
• Fast unfolding of communities in large networks: 15 years later

This page was built for publication: Multilevel local optimization of modularity

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