Related papers: Strong times and first hitting

We prove that for any $\alpha$-mixing stationnary process the hitting time of any $n$-string $A_n$ converges, when suitably normalized, to an exponential law. We identify the normalization constant $\lambda(A_n)$. A similar statement holds…

We determine the full distribution and moments of the first passage time for a wide class of stochastic search processes in the limit of frequent stochastic resetting. Our results apply to any system whose short-time behavior of the search…

Backward stochastic differential equations extend the martingale representation theorem to the nonlinear setting. This can be seen as path-dependent counterpart of the extension from the heat equation to fully nonlinear parabolic equations…

We develop some sufficient conditions for the stochastic ordering between hitting times, in a fixed state, for two Markov chains. In particular, we focus attention on the so called \emph{skip-free} case. In the analysis of such a case, we…

Many researchers have investigated first hitting times as models for survival data. First hitting times arise naturally in many types of stochastic processes, ranging from Wiener processes to Markov chains. In a survival context, the state…

We study the long time behaviour of a Markov process evolving in $\mathbb{N}$ and conditioned not to hit 0. Assuming that the process comes back quickly from infinity, we prove that the process admits a unique quasi-stationary distribution…

In the standard models for optimal multiple stopping problems it is assumed that between two exercises there is always a time period of deterministic length $\delta$, the so called refraction period. This prevents the optimal exercise times…

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 consider discrete time dynamical systems and show the link between Hitting Time Statistics (the distribution of the first time points land in asymptotically small sets) and Extreme Value Theory (distribution properties of the partial…

Using the results of Ding, Lee, Peres [3], we develop formulas to compute the hitting times and cover times for random walks on groups. We developed an explicit formula for hitting times in terms of the irreducible representations of the…

A general theory is derived for the moments of the first passage time of a one-dimensional Markov process in presence of a weak time-dependent forcing. The linear corrections to the moments can be expressed by quadratures of the potential…

We consider the first hitting times of the Bessel processes. We give explicit expressions for the distribution functions and for the densities by means of the zeros of the Bessel functions. The results extend the classical ones and cover…

The construction presented in this paper can be briefly described as follows: starting from any "finite-dimensional" Markov transition function p_t, on a measurable state space (E,B), we construct a strong Markov process on a certain…

We consider finite irreducible Markov chains. It was shown that mean hitting time from one state to another satisfies the triangle inequality. Hence, sum of mean hitting time between couple of states in both directions is a metric on the…

In the present paper, we give some examples of stochastic differential equations which have delicateness in the Markov and strong Markov properties, the uniqueness locally in time and globally in time, and initial conditions. Moreover, we…

We describe an exact approach for calculating transition probabilities and waiting times in finite-state discrete-time Markov processes. All the states and the rules for transitions between them must be known in advance. We can then…

We consider a stochastic process undergoing resetting after which a random refractory period is imposed. In this period the process is quiescent and remains at the resetting position. Using a first-renewal approach, we compute exactly the…

We establish strong invariance principles for sums of stationary and ergodic processes with nearly optimal bounds. Applications to linear and some nonlinear processes are discussed. Strong laws of large numbers and laws of the iterated…

For a finite state Markov process and a finite collection $\{ \Gamma_k, k \in K \}$ of subsets of its state space, let $\tau_k$ be the first time the process visits the set $\Gamma_k$. We derive explicit/recursive formulas for the joint…

We introduce a formalism for the calculation of the time of arrival t at a space point for particles traveling through interacting media. We develop a general formulation that employs quantum canonical transformations from the free to the…