Szemerédi's Regularity Lemma via Martingales

Pandelis Dodos, Vassilis Kanellopoulos, Thodoris Karageorgos


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 $L_p$ for any $p>1$. Our approach is based on martingale difference sequences.


Szemerédi's regularity lemma, Semiring, Norm, Martingale difference sequences

Full Text: