Numerical Computation of First-Passage Times of Increasing Lévy Processes
نویسندگان
چکیده
منابع مشابه
Convolution Equivalent Lévy Processes and First Passage Times
We investigate the behavior of Lévy processes with convolution equivalent Lévy measures, up to the time of first passage over a high level u. Such problems arise naturally in the context of insurance risk where u is the initial reserve. We obtain a precise asymptotic estimate on the probability of first passage occurring by time T . This result is then used to study the process conditioned on f...
متن کاملCrossover between Lévy and Gaussian regimes in first-passage processes.
We propose an approach to the problem of the first-passage time. Our method is applicable not only to the Wiener process but also to the non-Gaussian Lévy flights or to more complicated stochastic processes whose distributions are stable. To show the usefulness of the method, we particularly focus on the first-passage time problems in the truncated Lévy flights (the so-called KoBoL processes fr...
متن کاملDouble-barrier first-passage times of jump-diffusion processes
Required in a wide range of applications in, e.g., finance, engineering, and physics, first-passage time problems have attracted considerable interest over the past decades. Since analytical solutions often do not exist, one strand of research focuses on fast and accurate numerical techniques. In this paper, we present an efficient and unbiased Monte-Carlo simulation to obtain double-barrier fi...
متن کاملMoments of first passage times in general birth-death processes
We consider ordinary and conditional first passage times in a general birth–death process. Under existence conditions, we derive closed-form expressions for the kth order moment of the defined random variables, k ≥ 1. We also give an explicit condition for a birth–death process to be ergodic degree 3. Based on the obtained results, we analyze some applications for Markovian queueing systems. In...
متن کاملWeak Concentration for First Passage Percolation Times on Graphs and General Increasing Set-valued Processes
A simple lemma bounds s.d.(T )/ET for hitting times T in Markov chains with a certain strong monotonicity property. We show how this lemma may be applied to several increasing set-valued processes. Our main result concerns a model of first passage percolation on a finite graph, where the traversal times of edges are independent Exponentials with arbitrary rates. Consider the percolation time X ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Methodology and Computing in Applied Probability
سال: 2009
ISSN: 1387-5841,1573-7713
DOI: 10.1007/s11009-009-9158-y