相关论文: The Likelihood of Mixed Hitting Times

Several aspects of the laws of first hitting times of points are investigated for one-dimensional symmetric stable L\'evy processes. It\^o's excursion theory plays a key role in this study.

For an arbitrary L\'evy process $X$ which is not a compound Poisson process, we are interested in its occupation times. We use a quite novel and useful approach to derive formulas for the Laplace transform of the joint distribution of $X$…

This paper considers the class of L\'evy processes that can be written as a Brownian motion time changed by an independent L\'evy subordinator. Examples in this class include the variance gamma model, the normal inverse Gaussian model, and…

This paper considers the problem of estimating probabilities of the form $\mathbb{P}(Y \leq w)$, for a given value of $w$, in the situation that a sample of i.i.d.\ observations $X_1, \ldots, X_n$ of $X$ is available, and where we…

We study map lattices coupled by collision and show how perturbations of transfer operators associated with the spatially periodic approximation of the model can be used to extract information about collisions per lattice unit. More…

We prove the asymptotic properties of the maximum likelihood estimator (MLE) in time-varying transition probability (TVTP) regime-switching models. This class of models extends the constant regime transition probability in Markov-switching…

In this paper we analyze the quasi-stationary workload of a L\'evy-driven storage system. More precisely, assuming the system is in stationarity, we study its behavior conditional on the event that the busy period $T$ in which time 0 is…

Using a new approach, for spectrally negative L\'evy processes we find joint Laplace transforms involving the last exit time (from a semi-infinite interval), the value of the process at the last exit time and the associated occupation time,…

For both Levy flight and Levy walk search processes we analyse the full distribution of first-passage and first-hitting (or first-arrival) times. These are, respectively, the times when the particle moves across a point at some given…

In this paper we propose a transform method to compute the prices and greeks of barrier options driven by a class of Levy processes. We derive analytical expressions for the Laplace transforms in time of the prices and sensitivities of…

Several long-time limit theorems of one-dimensional L\'{e}vy processes weighted and normalized by functions of the local time are studied. The long-time limits are taken via certain families of random times, called clocks: exponential…

We prove two martingale identities which involve exit times of Levy-driven Ornstein--Uhlenbeck processes. Using these identities we find an explicit formula for the Laplace transform of the exit time under the assumption that positive jumps…

In the present paper, we investigate the relationship between hitting times and hitting probabilities in discrete-time imprecise Markov chains (IMCs). We define lower and upper hitting times and probabilities for IMCs whose set of…

For spectrally negative L\'evy processes, adapting an approach from \cite{BoLi:sub1} we identify joint Laplace transforms involving local times evaluated at either the first passage times, or independent exponential times, or inverse local…

We develop a computational method for expected functionals of the drawdown and its duration in exponential L\'evy models. It is based on a novel simulation algorithm for the joint law of the state, supremum and time the supremum is attained…

This paper studies a class of optimal multiple stopping problems driven by L\'evy processes. Our model allows for a negative effective discount rate, which arises in a number of financial applications, including stock loans and real…

We study the problem of characterizing the expected hitting times for a robust generalization of continuous-time Markov chains. This generalization is based on the theory of imprecise probabilities, and the models with which we work…

We study a multiple-urn version of the Ehrenfest model. In this setting, we denote the n urns by Urn 1 to Urn n, where n>=2. Initially, M balls are randomly placed in the n urns. At each subsequent step, a ball is selected and put into the…

A survey of a variety of computational procedures for finding the mean first passage times in Markov chains is presented. The author recently developed a new accurate computational technique, an Extended GTH Procedure, Hunter (Special…

In this paper we study the problem of statistical inference for a continuous-time moving average L\'evy process of the form $$Z_{t} = \int_{\mathbb{R}}\mathcal{K}(t-s)\, dL_{s},\quad t\in\mathbb{R}$$ with a deterministic kernel (\K\) and a…