1984
DOI: 10.1214/aop/1176993296
|View full text |Cite
|
Sign up to set email alerts
|

The Minimal Growth Rate of Partial Maxima

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
21
0

Year Published

1985
1985
2020
2020

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 23 publications
(23 citation statements)
references
References 9 publications
2
21
0
Order By: Relevance
“…whereF = 1 − F and a n = F ← (1 − 1/n) (with F ← (t) = inf{x : F (x) ≥ t}). More recently, Klass [12] gave a different proof of the same result using a blocking technique argument. In this paper, the independence assumption is removed.…”
Section: Introductionmentioning
confidence: 94%
“…whereF = 1 − F and a n = F ← (1 − 1/n) (with F ← (t) = inf{x : F (x) ≥ t}). More recently, Klass [12] gave a different proof of the same result using a blocking technique argument. In this paper, the independence assumption is removed.…”
Section: Introductionmentioning
confidence: 94%
“…Proof of Lemma 2. Fix a sequence of standard exponential random variables (τ e i ) i∈N and assume without loss of generality that the sequence (z n ) n∈N is constructed from (τ e i ) i∈N via formula (16). The subsequent proof is divided into two steps.…”
Section: Preliminariesmentioning
confidence: 99%
“…(iii) The monotonicity requirement on b t can be relaxed somewhat, analogous to the discrete situation, as discussed by Klass [11]. We omit the details.…”
Section: Lower Classes For (R) Atmentioning
confidence: 99%
“…(Resnick and Rubinovitch [17] mentioned continuous-time, small-, and largetime, versions of this result.) Klass [11], [12] removed the side condition, thus giving clean necessary and sufficient conditions for the partial maximum of a sequence of i.i.d. random variables to be in the lower class (according to our usage of the term).…”
Section: Further Background and Connectionsmentioning
confidence: 99%
See 1 more Smart Citation