Optimizing edge sets in networks to produce ground truth communities based on modularity

DOI10.1002/net.22084zbMath1528.90058arXiv2103.09351OpenAlexW3137415742MaRDI QIDQ6066243

Boleslaw K. Szymanski, Unnamed Author, John E. Mitchell, Thomas C. Sharkey

Publication date: 12 December 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2103.09351

zbMATH Keywords

integer programmingsocial networksnetwork optimizationcommunity detectionmodularity maximizationillicit networks

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Cites Work

• Unnamed Item
• Unnamed Item
• Orbital branching
• Modularity-maximizing graph communities via mathematical programming
• On the Value of Binary Expansions for General Mixed-Integer Linear Programs
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Interdiction Games and Monotonicity, with Application to Knapsack Problems
• Fast unfolding of communities in large networks

This page was built for publication: Optimizing edge sets in networks to produce ground truth communities based on modularity