Cover Image

Analyzing Modularity Maximization in Approximation, Heuristic, and Graph Neural Network Algorithms for Community Detection

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Aref, Samin, Mostajabdaveh, Mahdi
Format:	Preprint
Published:	2023
Subjects:	Social and Information Networks Statistical Mechanics Machine Learning Optimization and Control 90C90, 90C10, 90C57, 90C59, 90C35, 05C15, 65K05
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Bayan Algorithm: Detecting Communities in Networks Through Exact and Approximate Optimization of Modularity
by: Aref, Samin, et al.
Published: (2022)

Robust Markov stability for community detection at a scale learned based on the structure
by: Aref, Samin, et al.
Published: (2025)

Troika algorithm: approximate optimization for accurate clique partitioning and clustering of weighted networks
by: Aref, Samin, et al.
Published: (2025)

A Canceling Heuristic for the Directed Traveling Salesman Problem
by: Borgwardt, Steffen, et al.
Published: (2026)

New finite relaxation hierarchies for concavo-convex, disjoint bilinear programs, and facial disjunctions
by: Tawarmalani, Mohit
Published: (2024)

Designing Tractable Piecewise Affine Policies for Multi-Stage Adjustable Robust Optimization
by: Thomä, Simon, et al.
Published: (2022)

Optimality Conditions and Numerical Algorithms for a Class of Minimax Bilevel Optimization Problems
by: Hu, Yaling, et al.
Published: (2026)

An Algorithm to Solve Cardinality Constrained Quadratic Optimization Problem with an Application to the Best Subset Selection in Regression
by: Singh, Vikram, et al.
Published: (2025)

A non-monotone trust-region method with noisy oracles and additional sampling
by: Krejic, Natasa, et al.
Published: (2023)

A New Two-dimensional Model-based Subspace Method for Large-scale Unconstrained Derivative-free Optimization: 2D-MoSub
by: Xie, Pengcheng, et al.
Published: (2023)

Randomized quasi-Monte Carlo methods for risk-averse stochastic optimization
by: Melnikov, Olena, et al.
Published: (2024)

On Difference-of-SOS and Difference-of-Convex-SOS Decompositions for Polynomials
by: Niu, Yi-Shuai, et al.
Published: (2018)

Global optimization of multivariable functions satisfying the Vanderbei condition
by: Arutyunova, Natalya, et al.
Published: (2019)

On Solution Uniqueness and Robust Recovery for Sparse Regularization with a Gauge: from Dual Point of View
by: He, Jiahuan, et al.
Published: (2023)

Fast Frank--Wolfe Algorithms with Adaptive Bregman Step-Size for Weakly Convex Functions
by: Takahashi, Shota, et al.
Published: (2025)

Finding a second Hamiltonian decomposition of a 4-regular multigraph by integer linear programming
by: Nikolaev, Andrei V., et al.
Published: (2022)

Constrained Consensus-Based Optimization and Numerical Heuristics for the Few Particle Regime
by: Beddrich, Jonas, et al.
Published: (2024)

A structured L-BFGS method and its application to inverse problems
by: Mannel, Florian, et al.
Published: (2023)

A structured L-BFGS method with diagonal scaling and its application to image registration
by: Mannel, Florian, et al.
Published: (2024)

The SCIP Optimization Suite 9.0
by: Bolusani, Suresh, et al.
Published: (2024)

The SCIP Optimization Suite 10.0
by: Hojny, Christopher, et al.
Published: (2025)

A Multi-Reference Relaxation Enforced Neighborhood Search Heuristic in SCIP
by: Bolusani, Suresh, et al.
Published: (2024)

Splitting Algorithms for Distributionally Robust Optimization
by: Briceño-Arias, Luis, et al.
Published: (2024)

Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints
by: Berahas, Albert S., et al.
Published: (2025)

A globalization of L-BFGS and the Barzilai-Borwein method for nonconvex unconstrained optimization
by: Mannel, Florian
Published: (2024)

Bregman Stochastic Proximal Point Algorithm with Variance Reduction
by: Traoré, Cheik, et al.
Published: (2025)

Inexact Riemannian Gradient Descent Method for Nonconvex Optimization
by: Zhou, Juan, et al.
Published: (2024)

Steiner Cut Dominants
by: Conforti, Michele, et al.
Published: (2022)

Anderson Accelerated Primal-Dual Hybrid Gradient for solving LP
by: Zhou, Yingxin, et al.
Published: (2025)

Duality of Hoffman constants
by: Pena, Javier F., et al.
Published: (2023)

Bounding-Focused Discretization Methods for the Global Optimization of Nonconvex Semi-Infinite Programs
by: Turan, Evren M., et al.
Published: (2023)

A Single-Loop Stochastic Proximal Quasi-Newton Method for Large-Scale Nonsmooth Convex Optimization
by: Song, Yongcun, et al.
Published: (2024)

A divergence-based condition to ensure quantile improvement in black-box global optimization
by: Guilmeau, Thomas, et al.
Published: (2024)

Finding Short Paths on Simple Polytopes
by: Black, Alexander E., et al.
Published: (2026)

Oracle complexities of augmented Lagrangian methods for nonsmooth manifold optimization
by: Deng, Kangkang, et al.
Published: (2024)

Tight Error Bounds for the Sign-Constrained Stiefel Manifold
by: Chen, Xiaojun, et al.
Published: (2022)

A novel numerical method tailored for unconstrained optimization problems
by: Li, Lin, et al.
Published: (2025)

Convergence rate of the (1+1)-evolution strategy on locally strongly convex functions with lipschitz continuous gradient
by: Morinaga, Daiki, et al.
Published: (2022)

On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation
by: Bollapragada, Raghu, et al.
Published: (2025)

The Augmented Mixing Method: Computing High-Accuracy Primal-Dual Solutions to Large-Scale SDPs via Column Updates
by: Brosch, Daniel, et al.
Published: (2025)