Berry-Esseen bounds for combinatorial central limit theorems and pattern occurrences, using zero and size biasing
From MaRDI portal
Publication:3367740
DOI10.1239/jap/1127322019zbMath1087.60021arXivmath/0511510OpenAlexW2112005016MaRDI QIDQ3367740
Publication date: 26 January 2006
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0511510
Related Items (35)
A Berry-Esseen bound for the lightbulb process ⋮ Normal approximations for descents and inversions of permutations of multisets ⋮ A central limit theorem for descents of a Mallows permutation and its inverse ⋮ Zero biasing and a discrete central limit theorem ⋮ On the Accuracy in a Combinatorial Central Limit Theorem: The Characteristic Function Method ⋮ An improvement of a non-uniform bound for combinatorial central limit theorem ⋮ On the probabilities of moderate deviations for combinatorial sums ⋮ Central limit theorems for patterns in multiset permutations and set partitions ⋮ On the probabilities of large deviations of combinatorial sums of independent random variables that satisfy the Linnik condition ⋮ Asymptotic normality of consecutive patterns in permutations encoded by generating trees with one‐dimensional labels ⋮ Bounds of the remainder in a combinatorial central limit theorem ⋮ Cramér-type moderate deviations under local dependence ⋮ Moments of permutation statistics and central limit theorems ⋮ From Stein identities to moderate deviations ⋮ New rates for exponential approximation and the theorems of Rényi and Yaglom ⋮ Fundamentals of Stein's method ⋮ A Berry-Esseen bound with applications to vertex degree counts in the Erdős-Rényi random graph ⋮ Exponential bounds for normal approximation of the number of descents and inversions ⋮ On the error bound in the normal approximation for Jack measures ⋮ Esseen type bounds of the remainder in a combinatorial CLT ⋮ Concentration inequalities via zero bias couplings ⋮ \(L^1\) bounds in normal approximation ⋮ On combinatorial strong law of large numbers and rank statistics ⋮ Non uniform exponential bounds on normal approximation by Stein’s method and monotone size bias couplings ⋮ Error bounds in local limit theorems using Stein's method ⋮ Step Size in Stein's Method of Exchangeable Pairs ⋮ Normal approximation for coverage models over binomial point processes ⋮ Distributional transformations, orthogonal polynomials, and Stein characterizations ⋮ Bounds on the constant in the mean central limit theorem ⋮ Functional approximations via Stein's method of exchangeable pairs ⋮ Stein's method using approximate zero bias couplings with applications to combinatorial central limit theorems under the Ewens distribution ⋮ Non uniform bound on a combinatorial central limit theorem ⋮ On large deviations for combinatorial sums ⋮ Zero Biasing and Jack Measures ⋮ On the error bound in a combinatorial central limit theorem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the rate of convergence in the multivariate CLT
- Matching rectangles in d-dimensions: Algorithms and laws of large numbers
- Estimation of the mean of a multivariate normal distribution
- Trailing the dovetail shuffle to its lair
- An \(L_p\) bound for the remainder in a combinatorial central limit theorem
- The rate of convergence for multivariate sampling statistics
- Stein's method and the zero bias transformation with application to simple random sampling
- On coupling constructions and rates in the CLT for dependent summands with applications to the antivoter model and weighted \(U\)-statistics
- Normal approximation for hierarchical structures
- Distributional transformations, orthogonal polynomials, and Stein characterizations
- Normal approximation under local dependence.
- A multivariate CLT for local dependence with \(n^{-1/2}\log n\) rate and applications to multivariate graph related statistics
- Small cliques in random graphs
- An estimate of the remainder in a combinatorial central limit theorem
- Extreme Value Distribution for the Largest Cube in a Random Lattice
- Asymptotic normality of some Graph-Related statistics
- Approximations for Distributions of Scan Statistics
- On a Combinatorial Limit Theorem
- Remainder term estimate in a combinatorial limit theorem
- Error bounds on multivariate Normal approximations for word count statistics
- Multivariate normal approximations by Stein's method and size bias couplings
- Scan statistics
This page was built for publication: Berry-Esseen bounds for combinatorial central limit theorems and pattern occurrences, using zero and size biasing
