Image de couverture de livre

Bayan Algorithm: Detecting Communities in Networks Through Exact and Approximate Optimization of Modularity

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Aref, Samin, Mostajabdaveh, Mahdi, Chheda, Hriday
Format:	Preprint
Publié:	2022
Sujets:	Social and Information Networks Statistical Mechanics Data Structures and Algorithms Machine Learning Optimization and Control 90C90, 90C10, 90C57, 90C59, 90C35, 05C15, 65K05
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Analyzing Modularity Maximization in Approximation, Heuristic, and Graph Neural Network Algorithms for Community Detection
par: Aref, Samin, et autres
Publié: (2023)

Troika algorithm: approximate optimization for accurate clique partitioning and clustering of weighted networks
par: Aref, Samin, et autres
Publié: (2025)

Robust Markov stability for community detection at a scale learned based on the structure
par: Aref, Samin, et autres
Publié: (2025)

Optimality Conditions and Numerical Algorithms for a Class of Minimax Bilevel Optimization Problems
par: Hu, Yaling, et autres
Publié: (2026)

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

Finding Short Paths on Simple Polytopes
par: Black, Alexander E., et autres
Publié: (2026)

An Algorithm to Solve Cardinality Constrained Quadratic Optimization Problem with an Application to the Best Subset Selection in Regression
par: Singh, Vikram, et autres
Publié: (2025)

A New Two-dimensional Model-based Subspace Method for Large-scale Unconstrained Derivative-free Optimization: 2D-MoSub
par: Xie, Pengcheng, et autres
Publié: (2023)

A non-monotone trust-region method with noisy oracles and additional sampling
par: Krejic, Natasa, et autres
Publié: (2023)

The SCIP Optimization Suite 9.0
par: Bolusani, Suresh, et autres
Publié: (2024)

The SCIP Optimization Suite 10.0
par: Hojny, Christopher, et autres
Publié: (2025)

A Canceling Heuristic for the Directed Traveling Salesman Problem
par: Borgwardt, Steffen, et autres
Publié: (2026)

Splitting Algorithms for Distributionally Robust Optimization
par: Briceño-Arias, Luis, et autres
Publié: (2024)

Randomized quasi-Monte Carlo methods for risk-averse stochastic optimization
par: Melnikov, Olena, et autres
Publié: (2024)

On Difference-of-SOS and Difference-of-Convex-SOS Decompositions for Polynomials
par: Niu, Yi-Shuai, et autres
Publié: (2018)

Inexact Riemannian Gradient Descent Method for Nonconvex Optimization
par: Zhou, Juan, et autres
Publié: (2024)

Global optimization of multivariable functions satisfying the Vanderbei condition
par: Arutyunova, Natalya, et autres
Publié: (2019)

On Solution Uniqueness and Robust Recovery for Sparse Regularization with a Gauge: from Dual Point of View
par: He, Jiahuan, et autres
Publié: (2023)

Fast Frank--Wolfe Algorithms with Adaptive Bregman Step-Size for Weakly Convex Functions
par: Takahashi, Shota, et autres
Publié: (2025)

Designing Tractable Piecewise Affine Policies for Multi-Stage Adjustable Robust Optimization
par: Thomä, Simon, et autres
Publié: (2022)

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

A structured L-BFGS method and its application to inverse problems
par: Mannel, Florian, et autres
Publié: (2023)

A structured L-BFGS method with diagonal scaling and its application to image registration
par: Mannel, Florian, et autres
Publié: (2024)

Bounding-Focused Discretization Methods for the Global Optimization of Nonconvex Semi-Infinite Programs
par: Turan, Evren M., et autres
Publié: (2023)

A Single-Loop Stochastic Proximal Quasi-Newton Method for Large-Scale Nonsmooth Convex Optimization
par: Song, Yongcun, et autres
Publié: (2024)

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

Bregman Stochastic Proximal Point Algorithm with Variance Reduction
par: Traoré, Cheik, et autres
Publié: (2025)

Steiner Cut Dominants
par: Conforti, Michele, et autres
Publié: (2022)

Anderson Accelerated Primal-Dual Hybrid Gradient for solving LP
par: Zhou, Yingxin, et autres
Publié: (2025)

Duality of Hoffman constants
par: Pena, Javier F., et autres
Publié: (2023)

A divergence-based condition to ensure quantile improvement in black-box global optimization
par: Guilmeau, Thomas, et autres
Publié: (2024)

A Sequential Quadratic Programming Method for Optimization with Stochastic Objective Functions, Deterministic Inequality Constraints and Robust Subproblems
par: Qiu, Songqiang, et autres
Publié: (2023)

Oracle complexities of augmented Lagrangian methods for nonsmooth manifold optimization
par: Deng, Kangkang, et autres
Publié: (2024)

Efficiency and Convergence Insights in Large-Scale Optimization Using the Improved Inexact-Newton-Smart Algorithm and Interior-Point Framework
par: Renani, Neda Bagheri, et autres
Publié: (2025)

Tight Error Bounds for the Sign-Constrained Stiefel Manifold
par: Chen, Xiaojun, et autres
Publié: (2022)

A novel numerical method tailored for unconstrained optimization problems
par: Li, Lin, et autres
Publié: (2025)

Privacy-Preserving Black-Box Optimization (PBBO): Theory and the Model-Based Algorithm DFOp
par: Xie, Pengcheng
Publié: (2025)

Convergence rate of the (1+1)-evolution strategy on locally strongly convex functions with lipschitz continuous gradient
par: Morinaga, Daiki, et autres
Publié: (2022)

Parameter-Free Accelerated Quasi-Newton Method for Nonconvex Optimization
par: Marumo, Naoki
Publié: (2025)

The Augmented Mixing Method: Computing High-Accuracy Primal-Dual Solutions to Large-Scale SDPs via Column Updates
par: Brosch, Daniel, et autres
Publié: (2025)