Berry-Esseen bounds for combinatorial central limit theorems and pattern occurrences, using zero and size biasing

DOI10.1239/JAP/1127322019zbMATH Open1087.60021arXivmath/0511510OpenAlexW2112005016MaRDI QIDQ3367740FDOQ3367740

Authors: Larry Goldstein 

Publication date: 26 January 2006

Published in: Journal of Applied Probability (Search for Journal in Brave)

Abstract: Berry Esseen type bounds to the normal, based on zero- and size-bias couplings, are derived using Stein's method. The zero biasing bounds are illustrated with an application to combinatorial central limit theorems where the random permutation has either the uniform distribution or one which is constant over permutations with the same cycle type and having no fixed points. The size biasing bounds are applied to the occurrences of fixed relatively ordered sub-sequences (such as rising sequences) in a random permutation, and to the occurrences of patterns, extreme values, and subgraphs on finite graphs.

Full work available at URL: https://arxiv.org/abs/math/0511510

Recommendations

• Stein's method using approximate zero bias couplings with applications to combinatorial central limit theorems under the Ewens distribution
• Stein's method via induction
• scientific article; zbMATH DE number 1195783
• An estimate of the remainder in a combinatorial central limit theorem
• A Berry-Esseen bound with applications to vertex degree counts in the Erdős-Rényi random graph

zbMATH Keywords

graphpermutationStein's methodSmoothing inequality

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Combinatorial probability (60C05)

Cites Work

• Estimation of the mean of a multivariate normal distribution
• 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
• Distributional transformations, orthogonal polynomials, and Stein characterizations
• Title not available (Why is that?)
• Trailing the dovetail shuffle to its lair
• Title not available (Why is that?)
• The rate of convergence for multivariate sampling statistics
• Extreme Value Distribution for the Largest Cube in a Random Lattice
• Title not available (Why is that?)
• Multivariate normal approximations by Stein's method and size bias couplings
• Scan statistics
• On the rate of convergence in the multivariate CLT
• Normal approximation under local dependence.
• Title not available (Why is that?)
• Asymptotic normality of some Graph-Related statistics
• Approximations for Distributions of Scan Statistics
• Title not available (Why is that?)
• Title not available (Why is that?)
• An estimate of the remainder in a combinatorial central limit theorem
• A multivariate CLT for local dependence with \(n^{-1/2}\log n\) rate and applications to multivariate graph related statistics
• An \(L_p\) bound for the remainder in a combinatorial central limit theorem
• Remainder term estimate in a combinatorial limit theorem
• Normal approximation for hierarchical structures
• On a Combinatorial Limit Theorem
• Small cliques in random graphs
• Matching rectangles in d-dimensions: Algorithms and laws of large numbers
• Error bounds on multivariate Normal approximations for word count statistics

Cited In (39)

• Cramér-type moderate deviations under local dependence
• On the accuracy in a combinatorial central limit theorem: the characteristic function method
• Fundamentals of Stein's method
• Zero biasing and a discrete central limit theorem
• Error bounds in local limit theorems using Stein's method
• Moments of permutation statistics and central limit theorems
• On the error bound in a combinatorial central limit theorem
• On combinatorial strong law of large numbers and rank statistics
• Distributional transformations, orthogonal polynomials, and Stein characterizations
• Zero biasing and Jack measures
• A central limit theorem for descents of a Mallows permutation and its inverse
• Central limit theorems for patterns in multiset permutations and set partitions
• Stein's method via induction
• \(L^1\) bounds in normal approximation
• Functional approximations via Stein's method of exchangeable pairs
• On the error bound in the normal approximation for Jack measures
• On the probabilities of large deviations of combinatorial sums of independent random variables that satisfy the Linnik condition
• Explicit constants in the nonuniform local limit theorem for Poisson binomial random variables
• New rates for exponential approximation and the theorems of Rényi and Yaglom
• Bounds of the remainder in a combinatorial central limit theorem
• Bounds on normal approximations for the number of descents and inversions
• Non uniform bound on a combinatorial central limit theorem
• Step size in Stein's method of exchangeable pairs
• Normal approximations for descents and inversions of permutations of multisets
• On large deviations for combinatorial sums
• Asymptotic normality of consecutive patterns in permutations encoded by generating trees with one‐dimensional labels
• Stein's method using approximate zero bias couplings with applications to combinatorial central limit theorems under the Ewens distribution
• Exponential bounds for normal approximation of the number of descents and inversions
• On the probabilities of moderate deviations for combinatorial sums
• From Stein identities to moderate deviations
• Discretized normal approximation for the number of descents
• A Berry-Esseen bound for the lightbulb process
• Normal approximation for coverage models over binomial point processes
• An improvement of a non-uniform bound for combinatorial central limit theorem
• Bounds on the constant in the mean central limit theorem
• A Berry-Esseen bound with applications to vertex degree counts in the Erdős-Rényi random graph
• Esseen type bounds of the remainder in a combinatorial CLT
• Non uniform exponential bounds on normal approximation by Stein's method and monotone size bias couplings
• Concentration inequalities via zero bias couplings

This page was built for publication: Berry-Esseen bounds for combinatorial central limit theorems and pattern occurrences, using zero and size biasing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3367740)