Szemer\'edi's regularity lemma via martingales
  We prove a variant of the abstract probabilistic version of Szemer\'edi'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. 
Pandelis Dodos, Vassilis Kanellopoulos and Thodoris Karageorgos
math.CO math.FA math.PR