A universal error bound in the CLT for counting monochromatic edges in uniformly colored graphs (Q2517246)

From MaRDI portal
Revision as of 06:59, 19 April 2024 by Importer (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A universal error bound in the CLT for counting monochromatic edges in uniformly colored graphs
scientific article

    Statements

    A universal error bound in the CLT for counting monochromatic edges in uniformly colored graphs (English)
    0 references
    0 references
    17 August 2015
    0 references
    Stein's method
    0 references
    normal approximation
    0 references
    rate of convergence
    0 references
    monochromatic edges
    0 references

    Identifiers