Kolmogorov bounds for decomposable random variables and subgraph counting by the Stein-Tikhomirov method
DOI10.3150/22-bej1522zbMath1515.05159arXiv2107.03775OpenAlexW3181224234MaRDI QIDQ6103216
Peter Eichelsbacher, Benedikt Rednoß
Publication date: 2 June 2023
Published in: Bernoulli (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2107.03775
characteristic functionStein's methodcentral limit theoremKolmogorov distancenormal approximationBerry-Esseen boundErdős-Rényi random graphsubgraph countStein-Tikhomirov method
Geometric probability and stochastic geometry (60D05) Central limit and other weak theorems (60F05) Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fundamentals of Stein's method
- When are small subgraphs of a random graph normally distributed?
- Normal fluctuations and the FKG inequalities
- A central limit theorem for decomposable random variables with applications to random graphs
- Stein's method and the zero bias transformation with application to simple random sampling
- Normal approximation for sums of weighted \(U\)-statistics -- application to Kolmogorov bounds in random subgraph counting
- Discrete Malliavin-Stein method: Berry-Esseen bounds for random graphs and percolation
- Normal Approximation by Stein’s Method
- On the Convergence Rate in the Central Limit Theorem for Weakly Dependent Random Variables
- Dissociated random variables
- Two central limit problems for dependent random variables
- On Stein's Method for Infinitely Divisible Laws with Finite First Moment
- On combining the zero bias transform and the empirical characteristic function to test normality
- KOLMOGOROV BOUNDS FOR THE NORMAL APPROXIMATION OF THE NUMBER OF TRIANGLES IN THE ERDŐS–RÉNYI RANDOM GRAPH
- Mod-ϕ Convergence, II: Estimates on the Speed of Convergence
- Random Graphs
- Association of Random Variables, with Applications
This page was built for publication: Kolmogorov bounds for decomposable random variables and subgraph counting by the Stein-Tikhomirov method
