DeepAI AI Chat
Log In Sign Up

A fast new algorithm for weak graph regularity

by   Jacob Fox, et al.
Stanford University

We provide a deterministic algorithm that finds, in ϵ^-O(1) n^2 time, an ϵ-regular Frieze-Kannan partition of a graph on n vertices. The algorithm outputs an approximation of a given graph as a weighted sum of ϵ^-O(1) many complete bipartite graphs. As a corollary, we give a deterministic algorithm for estimating the number of copies of H in an n-vertex graph G up to an additive error of at most ϵ n^v(H), in time ϵ^-O_H(1)n^2.


page 1

page 2

page 3

page 4


Approximately counting independent sets in bipartite graphs via graph containers

By implementing algorithmic versions of Sapozhenko's graph container met...

Biclique immersions in graphs with independence number 2

The analog of Hadwiger's conjecture for the immersion relation states th...

Algorithms for weighted independent transversals and strong colouring

An independent transversal (IT) in a graph with a given vertex partition...

Local Algorithms for Estimating Effective Resistance

Effective resistance is an important metric that measures the similarity...

Explicit expanders of every degree and size

An (n,d,λ)-graph is a d regular graph on n vertices in which the absolut...

Fast algorithms for general spin systems on bipartite expanders

A spin system is a framework in which the vertices of a graph are assign...

Revealing Structure in Large Graphs: Szemerédi's Regularity Lemma and its Use in Pattern Recognition

Introduced in the mid-1970's as an intermediate step in proving a long-s...