Related papers: Separation cut-offs for birth and death chains
We study continuous-time Markov chains on the non-negative integers under mild regularity conditions (in particular, the set of jump vectors is finite and both forward and backward jumps are possible). Based on the so-called flux balance…
Given a reversible Markov chain $P_n$ on $n$ states, and another chain $\tilde{P}_n$ obtained by perturbing each row of $P_n$ by at most $\alpha_n$ in total variation, we study the total variation distance between the two stationary…
This paper studies birth and death processes in interactive random environments where the birth and death rates and the dynamics of the state of the environment are dependent on each other. Two models of a random environment are considered:…
Dealing with finite Markov chains in discrete time, the focus often lies on convergence behavior and one tries to make different copies of the chain meet as fast as possible and then stick together. There is, however, a very peculiar kind…
We investigate a quadratic dynamical system known as nonlinear recombinations. This system models the evolution of a probability measure over the Boolean cube, converging to the stationary state obtained as the product of the initial…
Spatial birth-and-death processes with a finite number of particles are obtained as unique solutions to certain stochastic equations. Conditions are given for existence and uniqueness of such solutions, as well as for continuous dependence…
A finite ergodic Markov chain exhibits cutoff if its distance to equilibrium remains close to its initial value over a certain number of iterations and then abruptly drops to near 0 on a much shorter time scale. Originally discovered in the…
We investigate the mixing time of the asymmetric Zero Range process on the segment with a non-decreasing rate. We show that the cutoff holds in the totally asymmetric case with a convex flux, and also with a concave flux if the asymmetry is…
By proving a local limit theorem for higher-order transitions, we determine the time required for necklace chains to be close to stationarity. Because necklace chains, built by arranging identical smaller chains around a directed cycle, are…
It is well-known that 0 is the absorbing state for a branching system. Each particle in the system lives a random long time and gives a random number of new particles at its death time. It stops when the system has no particle. This paper…
We consider symmetric Markov chains on $\Bbb Z^d$ where we do {\bf not} assume that the conductance between two points must be zero if the points are far apart. Under a uniform second moment condition on the conductances, we obtain upper…
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 consider the reversible exclusion process with reservoirs on arbitrary networks. We characterize the spectral gap, mixing time, and mixing window of the process, in terms of certain simple statistics of the underlying network. Among…
This paper provides full classification of dynamics for continuous time Markov chains (CTMCs) on the non-negative integers with polynomial transition rate functions. Such stochastic processes are abundant in applications, in particular in…
We establish connections between the absorption probabilities of a class of birth-death processes with killing, and the stationary tail of a related class of birth-death processes with catastrophes. The major ingredients of the proofs are a…
We consider a continuous time Markov process on $\mathbb{N}_0$ which can be interpreted as generalized alternating birth-death process in a non-autonomous random environment. Depending on the status of the environment the process either…
A sequence of chains exhibits (total-variation) cutoff (resp., pre-cutoff) if for all $0<\epsilon< 1/2$, the ratio $t_{\mathrm{mix}}^{(n)}(\epsilon)/t_{\mathrm{mix}}^{(n)}(1-\epsilon)$ tends to 1 as $n \to \infty $ (resp., the $\limsup$ of…
We compute the stationary distribution of a continuous-time Markov chain which is constructed by gluing together two finite, irreducible Markov chains by identifying a pair of states of one chain with a pair of states of the other and…
Catastrophe Markov chain population models have received a lot of attention in the recent past. We herewith consider two special cases of such models involving total disasters, both in discrete and in continuous-time. Depending on the…
How fast a state of a system converges to a stationary state is one of the fundamental questions in science. Some Markov chains and random walks on finite groups are known to exhibit the non-asymptotic convergence to a stationary…