Szemerédi's Regularity Lemma via Martingales


We prove a variant of the abstract probabilistic version of Szemerédi’s regularity lemma, due to Tao, which applies to a number of structures (including graphs, hypergraphs, hypercubes, graphons, and many more) and works for random variables in Lp for any p > 1. Our approach is based on martingale difference sequences. 


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics