Szemerédi's regularity lemma via martingales (Q311501): Difference between revisions

Summary: We prove a variant of the abstract probabilistic version of Szemerédi's regularity lemma, due to \textit{T. Tao} [Contrib. Discrete Math. 1, No. 1, 8--28 (2006; Zbl 1093.05030)], 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.