Modularity-maximizing graph communities via mathematical programming
From MaRDI portal
Publication:977873
DOI10.1140/epjb/e2008-00425-1zbMath1188.90262arXiv0710.2533OpenAlexW2057504236MaRDI QIDQ977873
Publication date: 23 June 2010
Published in: The European Physical Journal B. Condensed Matter and Complex Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0710.2533
Programming involving graphs or networks (90C35) Applications of graph theory (05C90) Deterministic network models in operations research (90B10) Models of societies, social and urban evolution (91D10)
Related Items (39)
Modularity maximization using completely positive programming ⋮ A dimensionality reduction framework for detection of multiscale structure in heterogeneous networks ⋮ Community detection by modularity maximization using GRASP with path relinking ⋮ Exact computational solution of modularity density maximization by effective column generation ⋮ Searching Graph Communities by Modularity Maximization via Convex Optimization ⋮ Clustering of high throughput gene expression data ⋮ Divisive heuristic for modularity density maximization ⋮ Optimal Containment of Misinformation in Social Media: A Scenario-Based Approach ⋮ Community detection in networks via a spectral heuristic based on the clustering coefficient ⋮ Optimizing edge sets in networks to produce ground truth communities based on modularity ⋮ Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem ⋮ Improving heuristics for network modularity maximization using an exact algorithm ⋮ A study on modularity density maximization: column generation acceleration and computational complexity analysis ⋮ Maximum modular graphs ⋮ Fractional interaction of financial agents in a stock market network ⋮ A combinatorial model and algorithm for globally searching community structure in complex networks ⋮ A constrained power method for community detection in complex networks ⋮ A DC Programming Approach for Finding Communities in Networks ⋮ Additive approximation algorithms for modularity maximization ⋮ Reformulation of a model for hierarchical divisive graph modularity maximization ⋮ On the relationship between Gaussian stochastic blockmodels and label propagation algorithms ⋮ Enhancing community detection by using local structural information ⋮ Community detection based on significance optimization in complex networks ⋮ A near-optimal adaptive algorithm for maximizing modularity in dynamic scale-free networks ⋮ A novel mixed integer linear programming model for clustering relational networks ⋮ A modularity-maximization-based approach for detecting multi-communities in social networks ⋮ Efficient modularity density heuristics for large graphs ⋮ Redundant constraints in the standard formulation for the clique partitioning problem ⋮ Simplified Energy Landscape for Modularity Using Total Variation ⋮ A hybrid artificial immune network for detecting communities in complex networks ⋮ A classification for community discovery methods in complex networks ⋮ Toward Optimal Community Detection: From Trees to General Weighted Networks ⋮ Social Network Optimization for Cluster Ensemble Selection ⋮ Identifying multi-scale communities in networks by asymptotic surprise ⋮ Using Mathematical Programming to Refine Heuristic Solutions for Network Clustering ⋮ Modified modularity density maximization and density ratio heuristic ⋮ Metric-Constrained Optimization for Graph Clustering Algorithms ⋮ Maximizing Barber's bipartite modularity is also hard ⋮ The maximum balanced subgraph of a signed graph: applications and solution approaches
Uses Software
Cites Work
This page was built for publication: Modularity-maximizing graph communities via mathematical programming
