Related papers: The Likelihood of Mixed Hitting Times

Let $\{D(s), s \geq 0\}$ be a non-decreasing L\'evy process. The first-hitting time process $\{E(t) t \geq 0\}$ (which is sometimes referred to as an inverse subordinator) defined by $E(t) = \inf \{s: D(s) > t \}$ is a process which has…

For one-dimensional symmetric L\'{e}vy processes, which hit every point with positive probability, we give sharp bounds for the tail function of the first hitting time of B which is either a single point or an interval. The estimates are…

In this paper, we consider the N-urn Ehrenfest model. By utilizing an auxiliary continuous-time Markov chain, we obtain the explicit formula for the Laplace transform of the hitting time from a single state to a set A of states where A…

For a one-dimensional L\'{e}vy process, we derive an explicit formula for the probability of first hitting a specified point among a fixed finite set. Moreover, using this formula, we obtain an explicit expression for each entry of the…

We obtain an exact formula for the first-passage time probability distribution for random walks on complex networks using inverse Laplace transform. We write the formula as the summation of finitely many terms with different frequencies…

We prove sharp two-sided estimates on the tail probability of the first hitting time of bounded interval as well as its asymptotic behaviour for general non-symmetric processes which satisfy an integral condition \[ \int_0^{\infty}…

We present an approximated maximum likelihood method for the multifractal random walk processes of [E. Bacry et al., Phys. Rev. E 64, 026103 (2001)]. The likelihood is computed using a Laplace approximation and a truncation in the…

We provide asymptotic results and develop high frequency statistical procedures for time-changed L\'evy processes sampled at random instants. The sampling times are given by first hitting times of symmetric barriers whose distance with…

In this paper we consider a (reflected) Brownian motion with broken drift hitting a random boundary. Some dedicated calculations allow us to obtain the formula on the joint Laplace transform of the hitting time and hitting position. These…

S. G. Kou and H. Wang [First Passage times of a Jump Diffusion Process \textit{Ann. Appl. Probab.} {\bf 35} (2003) 504--531] give expressions of both the (real) Laplace transform of the distribution of first passage time and the (real)…

Lewis and Mordecki have computed the Wiener-Hopf factorization of a L\'evy process whose restriction on $]0,+\infty[$ of their L\'evy measure has a rational Laplace transform. That allows to compute the distribution of $(X_t,\inf_{0\leq…

We present a novel algorithm to solve a non-linear system of equations, whose solution can be interpreted as a tight lower bound on the vector of expected hitting times of a Markov chain whose transition probabilities are only partially…

We study a time-changed variant of the Erlang queue by taking the first hitting time of a mixed stable subordinator as the time-changing component. We call it the mixed time-changed Erlang queue. We derive the system of fractional…

A popular method to compute first-passage probabilities in continuous-time Markov chains is by numerically inverting their Laplace transforms. Past decades, the scientific computing community has developed excellent numerical methods for…

Time-homogeneous Markov chains are often used as disease progression models in studies of cost-effectiveness and optimal decision-making. Maximum likelihood estimation of these models can be challenging when data are collected at a time…

Let $\{D(s), s \geq 0 \}$ be a L\'evy subordinator, that is, a non-decreasing process with stationary and independent increments and suppose that $D(0) = 0$. We study the first-hitting time of the process $D$, namely, the process $E(t) =…

This paper stidies the first passage times to constant boundaries for mixed-exponential jump diffusion processes. Explicit solutions of the Laplace transforms of the distribution of the first passage times, the joint distribution of the…

The marginal likelihood is a well established model selection criterion in Bayesian statistics. It also allows to efficiently calculate the marginal posterior model probabilities that can be used for Bayesian model averaging of quantities…

Drift analysis is a powerful tool for analyzing the time complexity of evolutionary algorithms. However, it requires manual construction of drift functions to bound hitting time for each specific algorithm and problem. To address this…

The Laplace transform is a widely used tool in the study of probability distributions, often allowing for a probability density functions and distribution functions simpler determination and being a moments generating function. In this…