Related papers: Strong times and first hitting
We prove a refined version of the Aldous and Brown's exponential approximation of stationary hitting times. These are valid for all reversible Markov chains. We then specialise our estimates for vertex-transitive graphs, where we obtain…
Understanding temporal processes and their correlations in time is of paramount importance for the development of near-term technologies that operate under realistic conditions. Capturing the complete multi-time statistics defining a…
We consider the fluctuations of a time-integrated particle current around an atypical value in a generic stochastic Markov process involving classical particles with two-site interaction and hardcore repulsion on a finite one-dimensional…
Reinforced processes are known to provide a stochastic representation for the quasi-stationary distribution of a given killed Markov process - describing the killed Markov process at fixed time instants. In this paper we shall adapt the…
We consider the problem of bounding mean first passage times for a class of continuous-time Markov chains that captures stochastic interactions between groups of identical agents. The quantitative analysis of such probabilistic population…
We propose a new definition of metastability of Markov processes on countable state spaces. We obtain sufficient conditions for a sequence of processes to be metastable. In the reversible case these conditions are expressed in terms of the…
We present an algorithm that can efficiently compute a broad class of inferences for discrete-time imprecise Markov chains, a generalised type of Markov chains that allows one to take into account partially specified probabilities and other…
We are concerned with the first hitting times of the Bessel processes. We give explicit expressions for the densities by means of the zeros of the Bessel functions and show their asymptotic behavior.
Questions are posed regarding the influence that the column sums of the transition probabilities of a stochastic matrix (with row sums all one) have on the stationary distribution, the mean first passage times and the Kemeny constant of the…
Given a large connected graph $G=(V,E)$, and two vertices $w,\neq v$, let $T_{w,v}$ be the first hitting time to $v$ starting from $w$ for the simple random walk on $G$. We prove a general theorem that guarantees, under some assumptions on…
We analyze the asymptotic behavior of sequences of random variables defined by an initial condition, a stationary and ergodic sequence of random matrices, and an induction formula involving multiplication is the so-called max-plus algebra.…
We present a novel computational method of first-passage times between a starting site and a target site of regular bounded lattices. We derive accurate expressions for all the moments of this first-passage time, validated by numerical…
We give an explicit formula for the time projection in an arbitrary von Neumann algebra from which all its basic properties can be easily derived. The analysis of the situation when this time projection is a conditional expectation is also…
Stochastic processes find applications in modelling systems in a variety of disciplines. A large number of stochastic models considered are Markovian in nature. It is often observed that higher order Markov processes can model the data…
Certain biochemical reactions can only be triggered after binding of a sufficient number of particles to a specific target region such as an enzyme or a protein sensor. We investigate the distribution of the reaction time, i.e., the first…
In the paper we study continuous time controlled Markov processes using discrete time controlled Markov processes. We consider long run functionals: average reward per unit time or long run risk sensitive functional. We also investigate…
Irreversibility is commonly quantified by entropy production. An external observer can estimate it through measuring an observable that is antisymmetric under time-reversal like a current. We introduce a general framework that, inter alia,…
We derive the effective theories for heavy particles with a functional integral approach by integrating away the states with high velocity and with high virtuality. This formulation is non-perturbative and has a close connection with the…
There exists a simple, didactically useful one-to-one relationship between stopping times and adapted c\`agl\`ad (LCRL) processes that are non-increasing and take the values 0 and 1 only. As a consequence, stopping times are always hitting…
We continue development of the theory of Markov systems initiated in \cite{Wer1}. In this paper, we introduce fundamental Markov systems associated with random dynamical systems and show that the proof of the uniqueness and empiricalness of…