How Can We Estimate Bounds on the Sum of Distributions?

Click For Summary
SUMMARY

This discussion focuses on estimating bounds for the n-fold convolution of a distribution function F(x) when F_n(x) is difficult to compute. The key technique involves segmenting the real line into intervals and applying properties of non-decreasing functions to derive inequalities. Specifically, the bounds are expressed as F_k(x)F(0) + F_k(0)(F(x)-F(0)) ≤ F_{k+1}(x) ≤ F(0) + F_k(x)(F(x)-F(0)) + F_k(0)(1-F(x)). As n increases, these bounds converge towards 0 and 1, raising the question of whether tighter bounds exist.

PREREQUISITES
  • Understanding of convolution in probability theory
  • Familiarity with distribution functions and their properties
  • Knowledge of non-decreasing functions
  • Basic calculus for integration and inequalities
NEXT STEPS
  • Research advanced techniques for bounding convolutions in probability distributions
  • Explore the implications of finite vs. infinite moments in distribution analysis
  • Study the properties of non-decreasing functions in the context of probability theory
  • Investigate existing literature on tighter bounds for n-fold convolutions
USEFUL FOR

Mathematicians, statisticians, and data scientists involved in probability theory, particularly those focusing on convolution operations and distribution analysis.

bpet
Messages
531
Reaction score
7
Take any distribution function F(x) where the n-fold convolution F_n(x) is unknown or difficult to calculate. Here

[tex]F_{k+1}(x) = \int_{-\infty}^{\infty}F_k(x-t)dF(t).[/tex]

Are there any good techniques for estimating bounds on F_n(x), given F(x) ?

Suppose the distribution does not have finite moments?
 
Physics news on Phys.org
Ok so one approach to derive bounds on F_n(x) is to break up (-inf,inf) into (-inf,0), (0,x), and (x,inf). Using the fact that F_n(x) is non-decreasing, we get

[tex]F_k(x)F(0) + F_k(0)(F(x)-F(0)) \le F_{k+1}(x) \le F(0)+F_k(x)(F(x)-F(0))+F_k(0)(1-F(x))[/tex]

for x>=0 and thus

[tex]F(0)^{n-1}(n(F(x)-F(0))+F(0)) \le F_n(x) \le 1-(1-F(0))^n+(F(x)-F(0))^n[/tex]

however these bounds rapidly tend to 0 and 1 respectively as n increases. Are any tighter bounds known?
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 9 ·
Replies
9
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 0 ·
Replies
0
Views
2K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 25 ·
Replies
25
Views
3K
Replies
5
Views
6K
  • · Replies 7 ·
Replies
7
Views
3K
Replies
1
Views
4K