2021
DOI: 10.1214/21-ejp723
|View full text |Cite
|
Sign up to set email alerts
|

Poisson approximation with applications to stochastic geometry

Abstract: This article compares the distributions of integer-valued random variables and Poisson random variables. It considers the total variation and the Wasserstein distance and provides, in particular, explicit bounds on the pointwise difference between the cumulative distribution functions. Special attention is dedicated to estimating the difference when the cumulative distribution functions are evaluated at 0. This permits to approximate the minimum (or maximum) of a collection of random variables by a suitable ra… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2022
2022
2025
2025

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 36 publications
0
3
0
Order By: Relevance
“…Note that, since the indicator functions defined on N d 0 are Lipschitz continuous, for random vectors in N d 0 the Wasserstein distance dominates the total variation distance, and it is not hard to find sequences that converge in total variation distance but not in Wasserstein distance. Our goal is to extend the approach developed in [25] for the Poisson approximation of random variables to the multivariate case.…”
Section: E[g(x)] − E[g(p)]mentioning
confidence: 98%
See 2 more Smart Citations
“…Note that, since the indicator functions defined on N d 0 are Lipschitz continuous, for random vectors in N d 0 the Wasserstein distance dominates the total variation distance, and it is not hard to find sequences that converge in total variation distance but not in Wasserstein distance. Our goal is to extend the approach developed in [25] for the Poisson approximation of random variables to the multivariate case.…”
Section: E[g(x)] − E[g(p)]mentioning
confidence: 98%
“…It should be noted that a bound that slightly improves (1.2) can easily be obtained as shown in the following section in Remark 2.1, which corresponds to (1.8) in [25,Theorem 1.3] when d = 1.…”
Section: E[g(x)] − E[g(p)]mentioning
confidence: 99%
See 1 more Smart Citation