Pages that link to "Item:Q5051220"
From MaRDI portal
The following pages link to KOLMOGOROV BOUNDS FOR THE NORMAL APPROXIMATION OF THE NUMBER OF TRIANGLES IN THE ERDŐS–RÉNYI RANDOM GRAPH (Q5051220):
Displaying 11 items.
- Error bounds in local limit theorems using Stein's method (Q1740519) (← links)
- A Berry-Esseen bound with applications to vertex degree counts in the Erdős-Rényi random graph (Q1948698) (← links)
- Berry-Esseen bounds for generalized \(U\)-statistics (Q2084842) (← links)
- Approximating the cumulant generating function of triangles in the Erdös-Rényi random graph (Q2227186) (← links)
- Normal approximation for sums of weighted \(U\)-statistics -- application to Kolmogorov bounds in random subgraph counting (Q2278673) (← links)
- Limit laws for the number of triangles in the generalized random graphs with random node weights (Q2307413) (← links)
- Wasserstein-2 bounds in normal approximation under local dependence (Q2631861) (← links)
- A local central limit theorem for triangles in a random graph (Q5740273) (← links)
- The number of triangles in random intersection graphs (Q6084115) (← links)
- Kolmogorov bounds for decomposable random variables and subgraph counting by the Stein-Tikhomirov method (Q6103216) (← links)
- Normal approximation of subgraph counts in the random-connection model (Q6589590) (← links)
