Szemerédi's regularity lemma via martingales (Q311501)

From MaRDI portal
Revision as of 14:30, 12 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Szemerédi's regularity lemma via martingales
scientific article

    Statements

    Szemerédi's regularity lemma via martingales (English)
    0 references
    0 references
    0 references
    0 references
    13 September 2016
    0 references
    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.
    0 references
    0 references
    0 references
    0 references
    0 references
    Szemerédi's regularity lemma
    0 references
    semiring
    0 references
    norm
    0 references
    martingale difference sequences
    0 references
    0 references