1970
DOI: 10.1214/aoms/1177697092
|View full text |Cite
|
Sign up to set email alerts
|

On Excess Over the Boundary

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

1
82
0
10

Year Published

1986
1986
2020
2020

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 183 publications
(93 citation statements)
references
References 5 publications
1
82
0
10
Order By: Relevance
“…√ log a . Using Theorem 4 of Lorden [14], for some K > 0, P X τ − a ≥ ǫa (1−δ)/2 ≤ KE X; X ≥ ǫa Similarly, applying Theorem 1.1 to two dimensional random walks where the second coordinates are projections of W n , for some K > 0,…”
mentioning
confidence: 99%
“…√ log a . Using Theorem 4 of Lorden [14], for some K > 0, P X τ − a ≥ ǫa (1−δ)/2 ≤ KE X; X ≥ ǫa Similarly, applying Theorem 1.1 to two dimensional random walks where the second coordinates are projections of W n , for some K > 0,…”
mentioning
confidence: 99%
“…The paper by J. T. Chang [1] established moment inequalities and almost sure upper bounds for the residual lifetime of a usual renewal process. This paper also contains bounds for the tail P{ζ t > x} and, in general, improves the results obtained earlier by G. Lorden [2]. Fundamental works by C. D. Fuh and T. L. Lai [3,4] deal with Markov random walks.…”
Section: Set (3)supporting
confidence: 76%
“…for p > 0 (see [2], [1, p. 1224]). Therefore these estimates also hold for the process generated by the sequence {X n }.…”
Section: The Variance Of the Counting Processmentioning
confidence: 99%
“…Due to Lorden's inequality [31], we have 13 Assuming that the first two moments of log-likelihood ration are finite, then we have…”
Section: Appendix a Proof Of One Target Detectionmentioning
confidence: 99%