Adding cohesion constraints to models for modularity maximization in networks

DOI10.1093/COMNET/CNU045MaRDI QIDQ4689363zbMATH OpenOpenAlexFDO

Authors Sonia Cafieri, Pierre Hansen, Alberto Costa

Publication date 16 October 2018

Published in Journal of Complex Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/comnet/cnu045

zbMATH Keywords

clusteringcommunity detectionmodularitycomplex networksmathematical modellingcohesion conditions

Mathematics Subject Classification ID

Quadratic programming (90C20) Deterministic network models in operations research (90B10) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Recommendations

• The maximum community partition problem in networks
• Toward optimal community detection: from trees to general weighted networks
• Modularity-maximizing graph communities via mathematical programming
• Finding network communities using modularity density
• Maximizing modularity intensity for community partition and evolution

Cited in

(5)

• Efficient modularity density heuristics for large graphs
• Divisive heuristic for modularity density maximization
• A branch-and-price procedure for clustering data that are graph connected
• Cohesiveness: general systems and contra-reductionism revolution
• Comparison of linear modularization criteria using the relational formalism, an approach to easily identify resolution limit

This page was built for publication: Adding cohesion constraints to models for modularity maximization in networks

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