A unified view of graph regularity via matrix decompositions. Issue 1 (11th October 2021)

• Record Type: Journal Article
• Authors: Bodwin, Greg; Vempala, Santosh
• Is Part Of: Random structures & algorithms. Volume 61:Issue 1(2022)
• Page Start: 62
• Page End: 83
• Publication Date: 2021-10-11
• Subjects: approximation algorithms -- graph algorithms -- regularity lemmas; Random graphs -- Periodicals; Mathematical analysis -- Periodicals; 519
• DOI: 10.1002/rsa.21053
• Languages: English
• ISSNs: 1042-9832

Abstract

Abstract: We give a unified proof of algorithmic weak and Szemerédi regularity lemmas for several well‐studied classes of sparse graphs, for which only weak regularity lemmas were previously known. These include core‐dense graphs, low threshold rank graphs, and (a version of) L p upper regular graphs. More precisely, we define cut pseudorandom graphs, we prove our regularity lemmas for these graphs, and then we show that cut pseudorandomness captures all of the above graph classes as special cases. The core of our approach is an abstracted matrix decomposition, which can be computed by a simple algorithm by Charikar. Using work of Oveis Gharan and Trevisan, it also implies new PTASes for MAX‐CUT, MAX‐BISECTION, MIN‐BISECTION for a significantly expanded class of input graphs. (It is NP Hard to get PTASes for these graphs in general.)