1997
DOI: 10.1016/s0304-4149(96)00118-4
|View full text |Cite
|
Sign up to set email alerts
|

Tails of passage-times and an application to stochastic processes with boundary reflection in wedges

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
40
0

Year Published

1999
1999
2020
2020

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 14 publications
(41 citation statements)
references
References 8 publications
1
40
0
Order By: Relevance
“…Lamperti [31] was the first to systematically study the problem of the existence or non-existence of moments E[η q 1 ]: his results covered only integer q. Subsequently Aspandiiarov et al extended Lamperti's results to all q > 0 (see the Appendix of [5]), but neither [31] nor the results of [5] determine whether the boundary case E[η (1+r)/2 ] is finite or infinite; as mentioned above, results of [3] can be used to settle the boundary case, but under more restrictive conditions on the increments than we use in Theorem 2.3. (The results of [5,31] related to Theorem 2.3 are stated in the Markovian setting, but their methods, similar to ours, work more generally.…”
Section: The Duration Of An Excursionmentioning
confidence: 99%
“…Lamperti [31] was the first to systematically study the problem of the existence or non-existence of moments E[η q 1 ]: his results covered only integer q. Subsequently Aspandiiarov et al extended Lamperti's results to all q > 0 (see the Appendix of [5]), but neither [31] nor the results of [5] determine whether the boundary case E[η (1+r)/2 ] is finite or infinite; as mentioned above, results of [3] can be used to settle the boundary case, but under more restrictive conditions on the increments than we use in Theorem 2.3. (The results of [5,31] related to Theorem 2.3 are stated in the Markovian setting, but their methods, similar to ours, work more generally.…”
Section: The Duration Of An Excursionmentioning
confidence: 99%
“….}. The possible transitions of the chain are specified by a 2 × 2 reinforcement matrix A = (a ij ) 2 i,j=1 and the transition probabilities depend on the current state:…”
mentioning
confidence: 99%
“…Fundamental work of Lamperti [25,26] showed that such processes are near-critical from the point of view of recurrence classification. We prove Proposition 3.1 using results from [1,2], which generalize Lamperti's work [26].…”
Section: Heavy-tailed Random Walks On Stripsmentioning
confidence: 61%