2009
DOI: 10.1007/s11009-009-9158-y
|View full text |Cite
|
Sign up to set email alerts
|

Numerical Computation of First-Passage Times of Increasing Lévy Processes

Abstract: Let {D(s), s ≥ 0} be a non-decreasing Lévy process. The first-hitting time process {E(t) t ≥ 0}(which is sometimes referred to as an inverse subordinator) defined by E(t) = inf{s : D(s) > t} is a process which has arisen in many applications. Of particular interest is the mean first-hitting timeThis function characterizes all finite-dimensional distributions of the process E. The function U can be calculated by inverting the Laplace transform of the function e U (λ) = (λφ(λ)) −1 ,where φ is the Lévy exponent o… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

1
34
0

Year Published

2012
2012
2020
2020

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 32 publications
(35 citation statements)
references
References 32 publications
1
34
0
Order By: Relevance
“…It turns out that both Gaver's and Post-Widder formulas have a very slow convergence rate, therefore one has to apply some acceleration algorithm, such as Salzer transformation for the Gaver's formula, which was proposed by Stehfest [98], or Richardson extrapolation for Post-Widder formula which was used by Veillette and Taqqu [105]. We refer to [4] for all the details and background on the Gaver-Stehfest algorithm, here we just present the final expression.…”
Section: The Gaver-stehfest Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…It turns out that both Gaver's and Post-Widder formulas have a very slow convergence rate, therefore one has to apply some acceleration algorithm, such as Salzer transformation for the Gaver's formula, which was proposed by Stehfest [98], or Richardson extrapolation for Post-Widder formula which was used by Veillette and Taqqu [105]. We refer to [4] for all the details and background on the Gaver-Stehfest algorithm, here we just present the final expression.…”
Section: The Gaver-stehfest Algorithmmentioning
confidence: 99%
“…Surya [100] presents an algoritm for evaluating the scale function using exponential dampening followed by Laplace inversion; the latter performed in a similar way as Rogers [90]. In a recent paper Veillette and Taqqu [105] compute the distribution of the first passage time for subordinators using two techniques. These are the discretization of the Bromwich integral and Post-Widder formula coupled with Richardson extrapolation.…”
Section: Introductionmentioning
confidence: 99%
“…and it is known [39,41,49,50] that for any p > 0, EY p (t) < ∞. Let U (t) = EY (t) be the renewal function.…”
Section: This Means Thatmentioning
confidence: 99%
“…Finally, we study Mixed-Fractional Poisson processes.The paper is organized as follows. In the next section, we collect some known results from the theory of subordinators and inverse subordinators, see [8,36,49,50] among others. In Section 2, we prove a martingale characterization of the FPP, which is a generalization of the Watanabe Theorem.…”
mentioning
confidence: 99%
See 1 more Smart Citation