Related papers: Birth-death chains on a spider: spectral analysis …

We study standard and higher-order birth-death processes on fully connected networks, within the perspective of large-deviation theory (also referred to as Wentzel-Kramers-Brillouin (WKB) method in some contexts). We obtain a general…

Polymer chains undergoing a continuous adsorption-desorption transition are studied through extensive computer simulations. A three-dimensional self-avoiding walk lattice model of a polymer chain grafted onto a surface has been treated for…

Spectral methods have proven to be a highly effective tool in understanding the intrinsic geometry of a high-dimensional data set $\left\{x_i \right\}_{i=1}^{n} \subset \mathbb{R}^d$. The key ingredient is the construction of a Markov chain…

Continuous-time birth-death-shift (BDS) processes are frequently used in stochastic modeling, with many applications in ecology and epidemiology. In particular, such processes can model evolutionary dynamics of transposable elements -…

Tree graphs are routinely used in statistics. When estimating a Bayesian model with a tree component, sampling the posterior remains a core difficulty. Existing Markov chain Monte Carlo methods tend to rely on local moves, often leading to…

We apply the Wigner function formalism from quantum optics via two approaches, Wootters' discrete Wigner function and the generalized Wigner function, to detect quantum phase transitions in critical spin-$\tfrac{1}{2}$ systems. We develop a…

A well-known theorem usually attributed to Keilson states that, for an irreducible continuous-time birth-and-death chain on the nonnegative integers and any d, the passage time from state 0 to state d is distributed as a sum of d…

The transition matrix of a Markov chain $(X_k,k\geq 0)$ on a finite or infinite rooted tree is said to be almost upper-directed if, given $X_k$, the node $X_{k+1}$ is either a descendant of $X_k$ or the parent of $X_k$. It is said to be…

Many classical randomized algorithms (e.g., approximation algorithms for #P-complete problems) utilize the following random walk algorithm for {\em almost uniform sampling} from a state space $S$ of cardinality $N$: run a symmetric ergodic…

The treatment of two-dimensional random walks in the quarter plane leads to Markov processes which involve semi-infinite matrices having Toeplitz or block Toeplitz structure plus a low-rank correction. Finding the steady state probability…

This paper studies a Markov chain for phylogenetic reconstruction which uses a popular transition between tree topologies known as subtree pruning-and-regrafting (SPR). We analyze the Markov chain in the simpler setting that the generating…

This paper analyzes the dynamics of a level-dependent quasi-birth-death process ${\cal X}=\{(I(t),J(t)): t\geq 0\}$, i.e., a bi-variate Markov chain defined on the countable state space $\cup_{i=0}^{\infty} l(i)$ with $l(i)=\{(i,j) :…

Given a non-negative Jacobi matrix describing higher order recurrence relations for multiple orthogonal polynomials of type~II and corresponding linear forms of type I, a general strategy for constructing a pair of stochastic matrices, dual…

We study the probabilistic evolution of a birth and death continuous time measure-valued process with mutations and ecological interactions. The individuals are characterized by (phenotypic) traits that take values in a compact metric…

Numerical and theoretical studies of a one-dimensional spin model with locally broken spin symmetry are presented. The multi-species annihilating random walk transition found at zero branching rate previously is investigated now concerning…

We show how to construct discrete-time quantum walks on directed, Eulerian graphs. These graphs have tails on which the particle making the walk propagates freely, and this makes it possible to analyze the walks in terms of scattering…

In this paper, we use a linear birth and death process with immigration to model infectious disease propagation when contamination stems from both person-to-person contact and contact with the environment. Our aim is to estimate the…

Many important stochastic counting models can be written as general birth-death processes (BDPs). BDPs are continuous-time Markov chains on the non-negative integers and can be used to easily parameterize a rich variety of probability…

We present a general framework to study the effect of killing sources on moving particles, trafficking inside biological cells. We are merely concerned with the case of spine-dendrite communication, where the number of calcium ions, modeled…

In this paper, we develop an in-depth analysis of non-reversible Markov chains on denumerable state space from a similarity orbit perspective. In particular, we study the class of Markov chains whose transition kernel is in the similarity…