Modularity maximization using completely positive programming

DOI10.1016/J.PHYSA.2016.11.108zbMath1400.91499OpenAlexW2555301475MaRDI QIDQ1620447

Sakineh Yazdanparast, Timothy C. Havens

Publication date: 13 November 2018

Published in: Physica A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.physa.2016.11.108

zbMATH Keywords

linear programmingquadratic programmingcommunity detectioncompletely positive programmingmodularity maximization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Social networks; opinion dynamics (91D30) Linear programming (90C05) Network design and communication in computer systems (68M10)

Uses Software

• GraphBase
• SeDuMi

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Alternating direction augmented Lagrangian methods for semidefinite programming
• Optimizing a polyhedral-semidefinite relaxation of completely positive programs
• Modularity-maximizing graph communities via mathematical programming
• Revealing network communities with a nonlinear programming method
• Copositive Programming
• Strong Duality for Semidefinite Programming
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• Community structure in social and biological networks
• Community Detection Using Spectral Clustering on Sparse Geosocial Data
• Fast unfolding of communities in large networks

This page was built for publication: Modularity maximization using completely positive programming