Local algorithms for Maximum Cut and Minimum Bisection on locally treelike regular graphs of large degree

by   Ahmed El Alaoui, et al.

Given a graph G of degree k over n vertices, we consider the problem of computing a near maximum cut or a near minimum bisection in polynomial time. For graphs of girth L, we develop a local message passing algorithm whose complexity is O(nkL), and that achieves near optimal cut values among all L-local algorithms. Focusing on max-cut, the algorithm constructs a cut of value nk/4+ n𝖯_β‹†βˆš(k/4)+𝖾𝗋𝗋(n,k,L), where 𝖯_β‹†β‰ˆ 0.763166 is the value of the Parisi formula from spin glass theory, and 𝖾𝗋𝗋(n,k,L)=o_n(n)+no_k(√(k))+n √(k) o_L(1) (subscripts indicate the asymptotic variables). Our result generalizes to locally treelike graphs, i.e., graphs whose girth becomes L after removing a small fraction of vertices. Earlier work established that, for random k-regular graphs, the typical max-cut value is nk/4+ n𝖯_β‹†βˆš(k/4)+o_n(n)+no_k(√(k)). Therefore our algorithm is nearly optimal on such graphs. An immediate corollary of this result is that random regular graphs have nearly minimum max-cut, and nearly maximum min-bisection among all regular locally treelike graphs. This can be viewed as a combinatorial version of the near-Ramanujan property of random regular graphs.


page 1

page 2

page 3

page 4

βˆ™ 10/23/2018

A Ramsey-type Theorem on the Max-Cut Value of d-Regular Graphs

In this paper we study the problem of finding large cuts in K_r-free gra...
βˆ™ 06/10/2021

Classical algorithms and quantum limitations for maximum cut on high-girth graphs

We study the performance of local quantum algorithms such as the Quantum...
βˆ™ 08/15/2019

Experimental performance of graph neural networks on random instances of max-cut

This note explores the applicability of unsupervised machine learning te...
βˆ™ 11/26/2019

Faster Algorithms for Parametric Global Minimum Cut Problems

The parametric global minimum cut problem concerns a graph G = (V,E) whe...
βˆ™ 09/22/2020

The Ising antiferromagnet and max cut on random regular graphs

The Ising antiferromagnet is an important statistical physics model with...
βˆ™ 06/03/2021

Oblivious Stacking and MAX k-CUT for Circle Graphs

Stacking is an important process within logistics. Some notable examples...
βˆ™ 04/25/2020

Low-Degree Hardness of Random Optimization Problems

We consider the problem of finding nearly optimal solutions of optimizat...

Please sign up or login with your details

Forgot password? Click here to reset