Related papers: Cyclic products and optimal traps in cyclic birth …

Let {X_n,n\geq0} be a Markov chain on a general state space X with transition probability P and stationary probability \pi. Suppose an additive component S_n takes values in the real line R and is adjoined to the chain such that…

In the present paper we show that for any given digraph $\mathbb{G} =([n], \vec{E})$, i.e. an oriented graph without self-loops and 2-cycles, one can construct a 1-dependent Markov chain and $n$ identically distributed hitting times $T_1,…

A cyclic random walk is a random walk whose transition probabilities/rates can be written as a superposition of the empirical measures of a family of finite cycles. This identifies a convex set of models. We discuss the problem of…

In this paper, we study a birth and death process $\{N_t\}_{t\ge0}$ on positive half lattice, which at each discontinuity jumps at most a distance $R\ge 1$ to the right or exactly a distance $1$ to the left. The transitional probabilities…

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…

Consider the following birth and death process with the following infinitesimal transition probabilities {\lambda}(k) ={\lambda}/(1+k) and {\mu}(k) = {\mu}k with {\lambda},{\mu}> 0. This process has known as a discouragement queue [5].…

Dynamic processes in complex networks are crucial for better understanding collective behavior in human societies, biological systems, and the internet. In this paper, we first focus on the continuous Markov-based modeling of evolving…

In a Markov chain population model subject to catastrophes, random immigration events (birth), promoting growth, are in balance with the effect of binomial catastrophes that cause recurrent mass removal (death). Using a generating function…

We consider models of the population or opinion dynamics which result in the non-linear stochastic differential equations (SDEs) exhibiting the spurious long-range memory. In this context, the correspondence between the description of the…

Given Markov chains and Markov decision processes (MDPs) whose transitions are labelled with non-negative integer costs, we study the computational complexity of deciding whether the probability of paths whose accumulated cost satisfies a…

In this work, a variant of the birth and death chain with constant intensities, originally introduced by Bruno de Finetti way back in 1957, is revisited. This fact is also underlined by the choice of the title, which is clearly a literal…

We study the problem of learning the Markov order in categorical sequences that represent paths in a network, i.e. sequences of variable lengths where transitions between states are constrained to a known graph. Such data pose challenges…

This article investigates second order intertwinings between semigroups of birth-death processes and discrete gradients on the space of natural integers N. It goes one step beyond a recent work of Chafa{\"i} and Joulin which establishes and…

We prove that if $(X_n)_{n\geq 0}$ is a random walk on a transient graph such that the Green's function decays at least polynomially along the random walk, then $(X_n)_{n\geq 0}$ has infinitely many cut times almost surely. This condition…

We explore the cycle types of a class of biased random derangements, described as a random game played by some children labeled $1,\cdots,n$. Children join the game one by one, in a random order, and randomly form some circles of size at…

We finely describe the speed of "coming down from infinity" for birth and death processes which eventually become extinct. Under general assumptions on the birth and death rates, we firstly determine the behavior of the successive hitting…

For birth and death chains, we derive bounds on the spectral gap and mixing time in terms of birth and death rates. Together with the results of Ding et al. in 2010, this provides a criterion for the existence of a cutoff in terms of the…

Bifurcating Markov chains (BMC) are Markov chains indexed by a full binary tree representing the evolution of a trait along a population where each individual has two children. We provide a central limit theorem for general additive…

By introducing the notions of living and dead nodes a new model of random tree evolution with continuous time parameter has been constructed. It is assumed that two random variables, the lifetime and the offspring number of living nodes…

Markov chains are convenient means of generating realizations of networks with a given (joint or otherwise) degree distribution, since they simply require a procedure for rewiring edges. The major challenge is to find the right number of…