A universal error bound in the CLT for counting monochromatic edges in uniformly colored graphs
From MaRDI portal
Publication:2517246
DOI10.1214/ECP.v20-3707zbMath1320.05039arXiv1408.0509MaRDI QIDQ2517246
Publication date: 17 August 2015
Published in: Electronic Communications in Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1408.0509
Related Items (6)
A fourth‐moment phenomenon for asymptotic normality of monochromatic subgraphs ⋮ Normal approximation and fourth moment theorems for monochromatic triangles ⋮ Berry-Esseen bounds of normal and nonnormal approximation for unbounded exchangeable pairs ⋮ Asymptotic distribution of Bernoulli quadratic forms ⋮ Limit theorems for monochromatic stars ⋮ Monochromatic subgraphs in randomly colored graphons
This page was built for publication: A universal error bound in the CLT for counting monochromatic edges in uniformly colored graphs
