相关论文: On the mixing time and spectral gap for birth and …

Earlier work by Diaconis and Saloff-Coste gives a spectral criterion for a maximum separation cutoff to occur for birth and death chains. Ding, Lubetzky and Peres gave a related criterion for a maximum total variation cutoff to occur in the…

This paper gives a necessary and sufficient condition for a sequence of birth and death chains to converge abruptly to stationarity, that is, to present a cut-off. The condition involves the notions of spectral gap and mixing time. Y. Peres…

We consider the spectrum of birth and death chains on a $n$-path. An iterative scheme is proposed to compute any eigenvalue with exponential convergence rate independent of $n$. This allows one to determine the whole spectrum in order $n^2$…

The cutoff phenomenon describes a case where a Markov chain exhibits a sharp transition in its convergence to stationarity. In 1996, Diaconis surveyed this phenomenon, and asked how one could recognize its occurrence in families of finite…

We consider families of discrete time birth and death chains on trees, and show that in presence of a drift towards the root of the tree, the chains exhibit cut-off behavior along the drift and escape behavior in the opposite direction.

We show that a sequence of birth-and-death chains, given by lazy random walks in a (transient) environment (RWRE) on [0; n], exhibits a cutoff in the ballistic regime but does not exhibit a cutoff in the (interior of) the subballistic…

We consider the well-known problem of the computation of the (limiting) time-dependent performance characteristics of one-dimensional continuous-time birth and death processes on $\mathbb{Z}$ with time varying and possible state-dependent…

We make a connection between the continuous time and lazy discrete time Markov chains through the comparison of cutoffs and mixing time in total variation distance. For illustration, we consider finite birth and death chains and provide a…

An aperiodic and irreducible Markov chain on a finite state space converges to its stationary distribution. When convergence to equilibrium is measured by total variation distance, there exists an optimal coupling and a maximal coupling…

An elementary proof is given for a theorem showing that certain birth-death chains show martingale-like behavior at large stopping times. This is a generalization of and new proof for a theorem from a earlier paper by the author.

For any distribution $\pi$ with support equal to $[n] = \{1, 2,..., n \}$, we study the set $\mathcal{A}_{\pi}$ of tridiagonal stochastic matrices $K$ satisfying $\pi(i) K[i,j] = \pi(j) K[j,i]$ for all $i, j \in [n]$. These matrices…

We take on a Random Matrix theory viewpoint to study the spectrum of certain reversible Markov chains in random environment. As the number of states tends to infinity, we consider the global behavior of the spectrum, and the local behavior…

Markov chains have long been used for generating random variates from spatial point processes. Broadly speaking, these chains fall into two categories: Metropolis-Hastings type chains running in discrete time and spatial birth-death chains…

A method yielding simple relationships among bilateral birth-and-death processes is outlined. This allows one to relate birth and death rates of two processes in such a way that their transition probabilities, first-passage-time densities…

In this paper we review some results on time-homogeneous birth-death processes. Specifically, for truncated birth-death processes with two absorbing or two reflecting endpoints, we recall the necessary and sufficient conditions on the…

It has been known for a long time that for birth-and-death processes started in zero the first passage time of a given level is distributed as a sum of independent exponentially distributed random variables, the parameters of which are the…

We examine the mixing time for random walks on graphs. In particular we are interested on investigating graphs with bottlenecks. Furthermore, the cutoff phenomenon is examined.

We study mixing times of the symmetric and asymmetric simple exclusion process on the segment where particles are allowed to enter and exit at the endpoints. We consider different regimes depending on the entering and exiting rates as well…

The spatial symmetry property of truncated birth-death processes studied in Di Crescenzo [6] is extended to a wider family of continuous-time Markov chains. We show that it yields simple expressions for first-passage-time densities and…

Let $P$ be a bistochastic matrix of size $n$, and let $\Pi$ be a permutation matrix of size $n$. In this paper, we are interested in the mixing time of the Markov chain whose transition matrix is given by $Q=P\Pi$. In other words, the chain…