1951
DOI: 10.1090/memo/0006
|View full text |Cite
|
Sign up to set email alerts
|

On the distribution of values of sums of random variables

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
140
0

Year Published

1969
1969
2010
2010

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 162 publications
(140 citation statements)
references
References 0 publications
0
140
0
Order By: Relevance
“…The discrete-time process {X n } ∞ n=1 is a one-dimensional mean-zero [in fact symmetric] random walk, which is necessarily recurrent thanks to the Chung-Fuchs theorem [8]. Consequently, the Lévy process {X t } t≥0 is recurrent as well.…”
Section: Proof Of Theorem 11: Lower Boundmentioning
confidence: 99%
“…The discrete-time process {X n } ∞ n=1 is a one-dimensional mean-zero [in fact symmetric] random walk, which is necessarily recurrent thanks to the Chung-Fuchs theorem [8]. Consequently, the Lévy process {X t } t≥0 is recurrent as well.…”
Section: Proof Of Theorem 11: Lower Boundmentioning
confidence: 99%
“…Let psx = the distribution of the first hit in (a+s, b + s) starting at x. For x large enough and |j| < / we have (1) J' \ps,x~Po,x\ < ia-(To see this let p be the distribution of the first hit in (a-s, b + s). Then |p-Po.…”
Section: Preliminariesmentioning
confidence: 99%
“…To see (1) note that for a given large number L we can choose v so that j/+b 2?=i T'r>L for all b by T0.4 (the integral does not depend on b). Next given e we can choose b so large that fl/2 J T Tr < - (2) For fixed C, j°_c 2¡"=i f\ is bounded independently of b.…”
Section: J ¡=Imentioning
confidence: 99%
“…be independent, identically distributed random variables in Rk, k > 1, with common distribution F, and let for n > 1, S" = 2" X¡, S0 = 0. The random walk S = (SJ™ has a point of recurrence at x if, for every e > 0,It is well known that the set of recurrence points is either empty or equals the smallest closed additive group containing the support of F, see [1] or [3, §8.3]. In the latter case we say that S is recurrent.…”
mentioning
confidence: 99%
“…It is well known that the set of recurrence points is either empty or equals the smallest closed additive group containing the support of F, see [1] or [3, §8.3]. In the latter case we say that S is recurrent.…”
mentioning
confidence: 99%