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 |
Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1408.0509 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 06:59, 19 April 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
