Total variation error bounds for geometric approximation
From MaRDI portal
Abstract: We develop a new formulation of Stein's method to obtain computable upper bounds on the total variation distance between the geometric distribution and a distribution of interest. Our framework reduces the problem to the construction of a coupling between the original distribution and the "discrete equilibrium" distribution from renewal theory. We illustrate the approach in four non-trivial examples: the geometric sum of independent, non-negative, integer-valued random variables having common mean, the generation size of the critical Galton-Watson process conditioned on non-extinction, the in-degree of a randomly chosen node in the uniform attachment random graph model and the total degree of both a fixed and randomly chosen node in the preferential attachment random graph model.
Recommendations
- Error bounds for discrete geometric approach
- Non-uniform bounds for geometric approximation
- scientific article; zbMATH DE number 1786519
- Error bounds for exponential approximations of geometric convolutions
- Optimal lower and upper bounds for the geometric convex combination of the error function
- Error estimates for finite differences approximations of the total variation
- scientific article; zbMATH DE number 3859667
Cites work
- scientific article; zbMATH DE number 52632 (Why is no real title available?)
- scientific article; zbMATH DE number 1040052 (Why is no real title available?)
- A shorter proof of Kanter's Bessel function concentration bound
- Approximation of sums of conditionally independent variables by the translated Poisson distribution
- Conceptual proofs of L L criteria for mean behavior of branching processes
- Degree asymptotics with rates for preferential attachment random graphs
- Error bounds for exponential approximations of geometric convolutions
- Fundamentals of Stein's method
- Multivariate normal approximations by Stein's method and size bias couplings
- New rates for exponential approximation and the theorems of Rényi and Yaglom
- Non-uniform bounds for geometric approximation
- Normal Approximation by Stein’s Method
- Occupation statistics of critical branching random walks in two or higher dimensions
- Probability approximations via the Poisson clumping heuristic
- Stein's method and the zero bias transformation with application to simple random sampling
- Stein's method for compound geometric approximation
- Symmetric and centered binomial approximation of sums of locally dependent random variables
- The degree sequence of a scale-free random graph process
- The first divisible sum
- Total variation asymptotics for sums of independent integer random variables
- Upper bounds for Stein-type operators
Cited in
(14)- Joint degree distributions of preferential attachment random graphs
- Stein's method for the single server queue in heavy traffic
- scientific article; zbMATH DE number 1786519 (Why is no real title available?)
- Wasserstein and Kolmogorov error bounds for variance-gamma approximation via Stein's method. I
- Convergence rates for the degree distribution in a dynamic network model
- Convergence rate of random geometric sum distributions to the Laplace law
- Binomial approximation for sum of indicators with dependent neighborhoods
- Degree asymptotics with rates for preferential attachment random graphs
- Generalized gamma approximation with rates for urns, walks and trees
- Fluctuations in a general preferential attachment model via Stein's method
- Power laws in preferential attachment graphs and Stein's method for the negative binomial distribution
- New error bounds for Laplace approximationviaStein’s method
- Pólya urns with immigration at random times
- Geometric Upper Bounds on Rates of Variable-Basis Approximation
This page was built for publication: Total variation error bounds for geometric approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1952436)
