Related papers: Some limit results for Markov chains indexed by tr…
We consider a $\mathbb{R}^d$-valued branching random walk with a stationary and ergodic environment $\xi=(\xi_n)$ indexed by time $n\in\mathbb{N}$. Let $Z_n$ be the counting measure of particles of generation $n$. With the help of the…
We consider a family of measure preserving transformations, which act on a common probability space and are chosen at random by a stationary ergodic Markov chain. This setting defines an instance of a random dynamical system (RDS), which…
(Multi-type) branching processes are a natural and well-studied model for generating random infinite trees. Branching processes feature both nondeterministic and probabilistic branching, generalizing both transition systems and Markov…
Given a permutation sigma of the integers {-n,-n+1,...,n} we consider the Markov chain X_{sigma}, which jumps from k to sigma (k\pm 1) equally likely if k\neq -n,n. We prove that the expected hitting time of {-n,n} starting from any point…
A discrete time branching process where the offspring distribution is generation-dependent, and the number of reproductive individuals is controlled by a random mechanism is considered. This model is a Markov chain but, in general, the…
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 trap models on Z^d, namely continuous time Markov jump process on Z^d with embedded chain given by a generic discrete time random walk, and whose mean waiting time at x is given by tau_x, with tau = (tau_x, x in Z^d) a family of…
Let $X_{t}$ and $Y_{t}$ be two Markov chains, on state spaces $\Omega \subset \hat{\Omega}$. In this paper, we discuss how to prove bounds on the spectrum of $X_{t}$ based on bounds on the spectrum of $Y_{t}$. This generalizes work of…
We introduce the concept of asymptotic period for an irreducible and aperiodic, discrete-time Markov chain X on a countable state space, and develop the theory leading to its formal definition. The asymptotic period of X equals one - its…
Given an irreducible discrete-time Markov chain on a finite state space, we consider the largest expected hitting time $T(\alpha)$ of a set of stationary measure at least $\alpha$ for $\alpha\in(0,1)$. We obtain tight inequalities among the…
We study a Markov chain on $\mathbb{R}_+ \times S$, where $\mathbb{R}_+$ is the non-negative real numbers and $S$ is a finite set, in which when the $\mathbb{R}_+$-coordinate is large, the $S$-coordinate of the process is approximately…
In this paper, we aim to provide probabilistic and combinatorial insights into tree formulas for the Green function and hitting probabilities of Markov chains on a finite state space. These tree formulas are closely related to loop-erased…
We study Markov chains on $\mathbb Z^m$, $m\geq 2$, that behave like a standard symmetric random walk outside of the hyperplane (membrane) $H=\{0\}\times \mathbb Z^{m-1}$. The transition probabilities on the membrane $H$ are periodic and…
Web crawling, snowball sampling, and respondent-driven sampling (RDS) are three types of network sampling techniques used to contact individuals in hard-to-reach populations. This paper studies these procedures as a Markov process on the…
We consider Markov chains with random transition probabilities which, moreover, fluctuate randomly with time. We describe such a system by a product of stochastic matrices, $U(t)=M_t\cdots M_1$, with the factors $M_i$ drawn independently…
In this paper, we are interested in the asymptotic behaviour of the sequence of processes $(W_n(s,t))_{s,t\in[0,1]}$ with \begin{equation*} W_n(s,t):=\sum_{k=1}^{\lfloor nt\rfloor}\big(1_{\{\xi_{S_k}\leq s\}}-s\big) \end{equation*} where…
From the datum of an integer partition and a classical Lie algebra, one can define a Markov chain on an associated multiplicative graph. For each classical family A, C, B, D, we thus obtain a sequence of Markov chain which is indexed by the…
In this work, we characterise the statistics of Markov chains by constructing an associated sequence of periodic differential operators. Studying the density of states of these operators reveals the absolutely continuous invariant measure…
We consider a random process on recursive trees, with three types of events. Vertices give birth at a constant rate (growth), each edge may be removed independently (fragmentation of the tree) and clusters (or trees) are frozen with a rate…
In a general setting we solve the following inverse problem: Given a positive operators $R$, acting on measurable functions on a fixed measure space $(X,\mathcal B_X)$, we construct an associated Markov chain. Specifically, starting with a…