How Can We Estimate Bounds on the Sum of Distributions?

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

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

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

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))

for x>=0 and thus

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

however these bounds rapidly tend to 0 and 1 respectively as n increases. Are any tighter bounds known?
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.
Back
Top