Related papers: Renewal Theory for Transient Markov Chains with As…

The model is a "generalized switch", serving multiple traffic flows in discrete time. The switch uses MaxWeight algorithm to make a service decision (scheduling choice) at each time step, which determines the probability distribution of the…

It is our intention to provide via fractional calculus a generalization of the pure and compound Poisson processes, which are known to play a fundamental role in renewal theory, without and with reward, respectively. We first recall the…

We derive subexponential tail asymptotics for the distribution of the maximum of a compound renewal process with linear component and of a L\'evy process, both with negative drift, over random time horizon $\tau$ that does not depend on the…

The martingale characterizes a kind of fairness or unbiased nature of the stochastic process which is associated with another stochastic process. If $x_t$ evolves according to the Langevin equation whose mean drift is $a_t$ as function of…

A branching process in a Markovian environment consists of an irreducible Markov chain on a set of "environments" together with an offspring distribution for each environment. At each time step the chain transitions to a new random…

We develop a method for deriving thermodynamic bounds for first-passage problems of currents with two boundaries in Markov chains. Using this method, we derive a thermodynamic bound on the rate of dissipation in terms of the splitting…

The versatility of renewal theory is owed to its abstract formulation. Renewals can be interpreted as steps of a random walk, switching events in two-state models, domain crossings of a random motion, etc. We here discuss a renewal process…

In this paper, we reveal a general relationship between model simplification and irreversibility based on the model of continuous-time Markov chains with time-scale separation. According to the topological structure of the fast process, we…

Random walks cannot, in general, be pushed forward by quasi-isometries. Tame Markov chains were introduced as a `quasi-isometry invariant' are a generalization of random walks. In this paper, we construct several examples of tame Markov…

Let $X$ be the constrained random walk on ${\mathbb Z}_+^2$ having increments $(1,0)$, $(-1,1)$, $(0,-1)$ with jump probabilities $\lambda(M_k)$, $\mu_1(M_k)$, and $\mu_2(M_k)$ where $M$ is an irreducible aperiodic finite state Markov…

We consider renewal-type processes whose positive inter-renewal times may be dependent, non-identically distributed, and may have mixed distributions. We introduce a generalised intensity measure extending the classical hazard-rate…

The study of discrete-time stochastic processes on the half-line with mean drift at $x$ given by $\mu_1 (x) \to 0$ as $x \to \infty$ is known as Lamperti's problem. We give sharp almost-sure bounds for processes of this type in the case…

Let $P$ be the transition matrix of a finite, irreducible and reversible Markov chain. We say the continuous time Markov chain $X$ has transition matrix $P$ and speed $\lambda$ if it jumps at rate $\lambda$ according to the matrix $P$. Fix…

Markovian models of turbulence can be derived from the renormalized statistical closure equations of the direct-interaction approximation (DIA). Various simplifications are often introduced, including an assumption that the two-time…

By appealing to renewal theory we determine the equations that the mean exit time of a continuous-time random walk with drift satisfies both when the present coincides with a jump instant or when it does not. Particular attention is paid to…

Markov branching systems form a fundamental class of stochastic models that are extensively applied in biology, physics, finance, and other domains. These systems are distinguished by their continuous-time evolution and inherent branching…

We study the ergodic behaviour of a discrete-time process $X$ which is a Markov chain in a stationary random environment. The laws of $X_t$ are shown to converge to a limiting law in (weighted) total variation distance as $t\to\infty$.…

Consider a sequence $(\eta^N(t) :t\ge 0)$ of continuous-time, irreducible Markov chains evolving on a fixed finite set $E$, indexed by a parameter $N$. Denote by $R_N(\eta,\xi)$ the jump rates of the Markov chain $\eta^N_t$, and assume that…

If $(C_n)$ is a Markov chain on a discrete state space ${\mathcal{S}}$, a Markov chain $(C_n,M_n)$ on the product space ${\mathcal{S}}\times{\mathcal{S}}$, the cat and mouse Markov chain, is constructed. The first coordinate of this Markov…

We prove the convergence of the law of grid-valued random walks, which can be seen as time-space Markov chains, to the law of a general diffusion process. This includes processes with sticky features, reflecting or absorbing boundaries and…