Pages that link to "Item:Q1948698"
From MaRDI portal
The following pages link to A Berry-Esseen bound with applications to vertex degree counts in the Erdős-Rényi random graph (Q1948698):
Displaying 13 items.
- Moderate deviations via cumulants (Q354766) (← links)
- Discretized normal approximation by Stein's method (Q396011) (← links)
- Concentration of measure for the number of isolated vertices in the Erdős-Rényi random graph by size bias couplings (Q643216) (← links)
- Error bounds in local limit theorems using Stein's method (Q1740519) (← links)
- Bounded size biased couplings, log concave distributions and concentration of measure for occupancy models (Q1750085) (← links)
- Stein's method via induction (Q2024519) (← links)
- Discrete Malliavin-Stein method: Berry-Esseen bounds for random graphs and percolation (Q2412666) (← links)
- A simplified second-order Gaussian Poincaré inequality in discrete setting with applications (Q2686615) (← links)
- Exponential approximation by Stein's method and spectral graph theory (Q2863698) (← links)
- (Q3361623) (← links)
- Berry-Esseen bounds for combinatorial central limit theorems and pattern occurrences, using zero and size biasing (Q3367740) (← links)
- KOLMOGOROV BOUNDS FOR THE NORMAL APPROXIMATION OF THE NUMBER OF TRIANGLES IN THE ERDŐS–RÉNYI RANDOM GRAPH (Q5051220) (← links)
- Local limit theorems for occupancy models (Q6049914) (← links)
