A universal error bound in the CLT for counting monochromatic edges in uniformly colored graphs (Q2517246): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:51, 3 February 2024
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
17 August 2015
0 references
Stein's method
0 references
normal approximation
0 references
rate of convergence
0 references
monochromatic edges
0 references
