Related papers: Strong times and first hitting

We prove generalizations of the first and second Ray-Knight theorems, for a large class of non-symmetric strong Markov processes. These results link the local times of the Markov process with the squares of associated Gaussian processes.…

We prove an explicit formula of hitting times in terms of enumerations of spanning trees for random walks on general connected graphs. We apply the formula to improve Lawler's bound of hitting times for general graphs, prove a sharp bound…

Let $T_1^{(\mu)}$ be the first hitting time of the point 1 by the Bessel process with index $\mu\in \R$ starting from $x>1$. Using an integral formula for the density $q_x^{(\mu)}(t)$ of $T_1^{(\mu)}$, obtained in Byczkowski, Ryznar (Studia…

For continuous-time ergodic Markov processes, the Kemeny time $\tau_*$ is the characteristic time needed to converge towards the steady state $P_*(x)$ : in real-space, the Kemeny time $\tau_*$ corresponds to the average of the…

Let X_{n} be an integer valued Markov Chain with finite state space. Let S_{n}=\sum_{k=0}^{n}X_{k} and let L_{n}(x) be the number of times S_{k} hits x up to step n. Define the normalized local time process t_{n}(x) by…

We propose a new concept of lifts of reversible diffusion processes and show that various well-known non-reversible Markov processes arising in applications are lifts in this sense of simple reversible diffusions. Furthermore, we introduce…

We study perturbation theory and uniform ergodicity for discrete-time Markov chains on general state spaces in terms of the uniform moments of the first hitting times on some set. The methods we adopt are different from previous ones. For…

A necessary and sufficient condition is obtained for the existence of strong stationary times for ergodic one-dimensional diffusions, whatever the initial distribution. The strong stationary times are constructed through intertwinings with…

Causal reversibility blends reversibility and causality for concurrent systems. It indicates that an action can be undone provided that all of its consequences have been undone already, thus making it possible to bring the system back to a…

First-passage properties are central to the kinetics of target-search processes. Theoretical approaches so far primarily focused on predicting first-passage statistics for a given process or model. In practice, however, one faces the…

We consider the problem of inference for non-stationary time series with heavy-tailed error distribution. Under a time-varying linear process framework we show that there exists a suitable local approximation by a stationary process with…

The first passage time (FPT) problem is studied for superstatistical models assuming that the mesoscopic system dynamics is described by a Fokker-Planck equation. We show that all moments of the random intensive parameter associated to the…

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…

A well-known theorem for an irreducible skip-free chain with absorbing state $d$, under some conditions, is that the hitting (absorbing) time of state $d$ starting from state 0 is distributed as the sum of $d$ independent geometric (or…

The analysis of many problems of interest associated with Markov chains, e.g. stationary distributions, moments of first passage time distributions and moments of occupation time random variables, involves the solution of a system of linear…

We study optimal multiple stopping of strong Markov processes with random refraction periods. The refraction periods are assumed to be exponentially distributed with a common rate and independent of the underlying dynamics. Our main tool is…

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…

It is considered the integrated process $X(t)= x + \int _0^t Y(s) ds ,$ where $Y(t)$ is a Gauss-Markov process starting from $y.$ The first-passage time (FPT) of $X$ through a constant boundary and the first-exit time of $X$ from an…

We consider a simple but important class of metastable discrete time Markov chains, which we call perturbed Markov chains. Basically, we assume that the transition matrices depend on a parameter $\varepsilon$, and converge as $\varepsilon$.…

Natural disasters may have considerable impact on society as well as on (re)insurance industry. Max-stable processes are ideally suited for the modeling of the spatial extent of such extreme events, but it is often assumed that there is no…