We investigate recurrence and transience of Branching Markov Chains (BMC) in discrete time. Branching Markov Chains are clouds of particles which move (according to an irreducible underlying Markov Chain) and produce offspring independently. The offspring distribution can depend on the location of the particle. If the offspring distribution is constant for all locations, these are Tree-Indexed Markov chains in the sense of \cite{benjamini94}. Starting with one particle at location $x$, we denote by $α(x)$ the probability that $x$ is visited infinitely often by the cloud. Due to the irreducibility of the underlying Markov Chain, there are three regimes: either $α(x) = 0$ for all $x$ (transient regime), or $0 < α(x) < 1$ for all $x$ (weakly recurrent regime) or $α(x) = 1$ for all $x$ (strongly recurrent regime). We give classification results, including a sufficient condition for transience in the general case.
If the mean of the offspring distribution is constant, we give a criterion for transience involving the spectral radius of the underlying Markov Chain and the mean of the offspring distribution.
An intrinsic multitype branching structure within the transient (1;R)-RWRE is revealed. The branching structure enables us to specify the density of the absolutely continuous invariant measure for the environments seen from the particle and reprove the LLN with an drift explicitly in terms of the environment, comparing with the results in Brémont (2002).
An intrinsic branching structure within the transient random walk on a strip in a random environment is revealed. As applications, which enables us to express the hitting time explicitly, and specifies the density of the absolutely continuous invariant measure for the "environments viewed from the particle".
The aim of this paper is to prove stability of traveling waves for integro-differential equations connected with branching Markov processes. In other words, the limiting law of the left-most particle of a (time-continuous) branching Markov process with a Lévy non-branching part is demonstrated. The key idea is to approximate the branching Markov process by a branching random walk and apply the result of Aïdékon [1] on the limiting law of the latter one.
The main purpose of this work is to study self-similar branching Markov chains. First we will construct such a process. Then we will establish certain Limit Theorems using the theory of self-similar Markov processes.
This paper studies: (i) the long time behaviour of the empirical distribution of age and normalised position of an age dependent critical branching Markov process conditioned on non-extinction; and (ii) the super-process limit of a sequence of age dependent critical branching Brownian motions.
We consider the down/up crossing property of weighted Markov branching processes. The joint probability distribution of multi crossing numbers of such processes are obtained. In particular, for Markov branching processes, the probability distribution of death number is given and for bulk-arrival queueing model, the joint probability distributions of service number and arrival number is also given.
In this paper we establish spatial central limit theorems for a large class of supercritical branching Markov processes with general spatial-dependent branching mechanisms. These are generalizations of the spatial central limit theorems proved in [1], P. for branching OU processes with binary branching mechanisms. Compared with the results of [1], our central limit theorems are more satisfactory in the sense that the normal random variables in our theorems are non-degenerate.
In this paper, we establish a spatial central limit theorem for a large class of supercritical branching, not necessarily symmetric, Markov processes with spatially dependent branching mechanisms satisfying a second moment condition. This central limit theorem generalizes and unifies all the central limit theorems obtained recently in \cite{RSZ2} for supercritical branching symmetric Markov processes. To prove our central limit theorem, we have to carefully develop the spectral theory of nonsymmetric strongly continuous semigroups which should be of independent interest.
We observe the continuous-time Markov Branching Process without high-order moments and allowing Immigration. Limit properties of transition functions and their convergence to invariant measures are investigated. Main mathematical tool is regularly varying generating functions with remainder.
The goal of these lectures is to survey some of the recent progress on the description of large-scale structure of random trees. We use the framework of Markov-Branching sequences of trees and discuss several applications.
We construct and study branching Markov processes on the space of finite configurations of the state space of a given standard process, controlled by a branching kernel and a killing one. In particular, we may start with a superprocess, obtaining a branching process with state space the finite configurations of positive finite measures on a topological space. A main tool in proving the path regularity of the branching process is the existence of convenient superharmonic functions having compact level sets, allowing the use of appropriate potential theoretical methods.
The question of recurrence and transience of branching Markov chains is more subtle than for ordinary Markov chains; they can be classified in transience, weak recurrence, and strong recurrence. We review criteria for transience and weak recurrence and give several new conditions for weak recurrence and strong recurrence. These conditions make a unified treatment of known and new examples possible and provide enough information to distinguish between weak and strong recurrence. This represents a step towards a general classification of branching Markov chains. In particular, we show that in \e…
We provide explicit conditions, in terms of the transition kernel of its driving particle, for a Markov branching process to admit a scaling limit toward a self-similar growth-fragmentation with negative index. We also derive a scaling limit for the genealogical embedding considered as a compact real tree.
We give a concise self-contained presentation of known and new limit theorems for the one-type Markov branching processes with continuous time. The new streamlined proofs are based on what we call, the tail generating function approach. Our analysis focuses on the singularity points of the master integral equation for the probability generating functions of the current population size.
We consider branching random walks on the Euclidean lattice in dimensions five and higher. In this non-Markovian setting, we first obtain a relationship between the equilibrium measure and Green's function, in the form of an approximate last passage decomposition. Secondly, we obtain exponential moment bounds for functionals of the branching random walk, under optimal condition. As a corollary we obtain an approximate variational characterisation of the branching capacity. We finally derive upper bounds involving the branching capacity for the tail of the time spent in an arbitrary finite coll…
We investigate an application of slowly varying functions (in sense of Karamata) in the theory of Markov branching process. We treat the critical case so that the infinitesimal generating function of the process has the infinite second moment, but it regularly varies with the remainder. We improve the Basic Lemma of the theory of critical Markov branching process and refine known limit results.
Limit theorems for strongly and intermediately supercritical branching processes in Markovian environment with linear fractional offspring distributions
In the literature, the spine decomposition of branching Markov processes was constructed under the assumption that each individual has at least one child. In this paper, we give a detailed construction of the spine decomposition of general branching Markov processes allowing the possibility of no offspring when a particle dies. Then we give some applications of the spine decomposition.
Let $(Z_n)_{n\geqslant 0}$ be a branching process in a random environment defined by a Markov chain $(X_n)_{n\geqslant 0}$ with values in a finite state space $\mathbb X$ starting at $X_0=i \in\mathbb X$. We extend from the i.i.d. environment to the Markovian one the classical classification of the branching processes into critical and strongly, intermediate and weakly subcritical states. In all these cases, we study the asymptotic behaviour of the probability that $Z_n>0$ as $n\to+\infty$.
We develop a new methodology for the fluctuation theory of continuous-time skip-free Markov chains, extending the recent work of Choi and Patie [5] for discrete-time skip-free Markov chains. As the main application we use it to derive a full set of fluctuation identities regarding exiting a finite or infinite interval for Markov branching processes with immigration, thereby uncovering many new results for this classical family of continuous-time Markov chains. The theory also allows us to recover in a simple manner fluctuation identities for skip-free downward compound Poisson processes.
Consider the continuous-time Markov Branching Process. In critical case we consider a situation when the generating function of intensity of transformation of particles has the infinite second moment, but its tail regularly varies in sense of Karamata. First we discuss limit properties of transition functions of the process. We prove local limit theorems and investigate ergodic properties of the process. Further we investigate limiting probability function conditioned to be never extinct. Hereupon we obtain a new stochastic population process as a continuous-time Markov chain called the Markov…
In this paper we consider two related stochastic models. The first one is a branching system consisting of particles moving according to a Markov family in R^d and undergoing subcritical branching with a constant rate of V>0. New particles immigrate to the system according to a homogeneous space time Poisson random field. The second model is the superprocess corresponding to the branching particle system. We study rescaled occupation time process and the process of its fluctuations with very mild assumptions on the Markov family. In the general setting a functional central limit theorem as wel…
We consider a branching system consisting of particles moving according to a Markov family in $\Rd$ and undergoing subcritical branching with a constant rate $V>0$. New particles immigrate to the system according to homogeneous space-time Poisson random field. The process of the fluctuations of the rescaled occupation time is studied with very mild assumptions on the Markov family. In this general setting a functional central limit theorem is proved. The subcriticality of the branching law is crucial for the limit behaviour and in a sense overwhelms the properties of the particles' motion. It …
We consider a branching model in discrete time where each individual has a trait in some general state space. Both the reproduction law and the trait inherited by the offsprings may depend on the trait of the mother and the environment. We study the long time behavior of the population and the ancestral lineage of typical individuals under general assumptions, which we specify for applications to some models motivated by biology. Our results focus on the growth rate, the trait distribution among the population for large time, so as local densities and the position of extremal individuals. The …
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 is devoted to studying the fixed range crossing numbers until any time t. The joint probability distribution of fixed range crossing numbers of such processes until time t is obtained by using a new method. In particular, the probability distribution of total death number is given for Markov branching processes until time t.
We are interested in the dynamic of a structured branching population where the trait of each individual moves according to a Markov process. The rate of division of each individual is a function of its trait and when a branching event occurs, the trait of a descendant at birth depends on the trait of the mother. We prove a law of large numbers for the empirical distribution of ancestral trajectories. It ensures that the empirical measure converges to the mean value of the spine which is a time-inhomogeneous Markov process describing the trait of a typical individual along its ancestral lineag…
In this paper, we consider $n$-type Markov branching processes with immigration and resurrection. The uniqueness criteria are first established. Then, a new method is found and the explicit expression of extinction probability is successfully obtained in the absorption case, the mean extinction time is also given. The recurrence and ergodicity criteria are given if the state ${\bf 0}$ is not absorptive. Finally, if the resurrection rates are same as the immigration rates, the branching property and decay property are discussed in detail, it is shown that the process is a superimposition of a $…
We give three different criteria for transience of a Branching Markov Chain. These conditions enable us to give a classification of Branching Random Walks in Random Environment (BRWRE) on Cayley Graphs in recurrence and transience. This classification is stated explicitly for BRWRE on $\Z^d.$ Furthermore, we emphasize the interplay between Branching Markov Chains and the spectral radius. We prove properties of the spectral radius of the Random Walk in Random Environment with the help of appropriate Branching Markov Chains.
We consider a time-homogeneous Markov chain $X_n$, $n\ge0$, valued in ${\bf R}$. Suppose that this chain is transient, that is, $X_n$ generates a $σ$-finite renewal measure. We prove the key renewal theorem under condition that this chain has asymptotically homogeneous at infinity jumps and asymptotically positive drift.
We prove two propositions with conditions that a system, which is described by a transient Markov chain, will display local stability. Examples of such systems include partly overloaded Jackson networks, partly overloaded polling systems, and overloaded multi-server queues with skill based service, under first come first served policy.
Representations of branching Markov processes and their measure-valued limits in terms of countable systems of particles are constructed for models with spatially varying birth and death rates. Each particle has a location and a "level," but unlike earlier constructions, the levels change with time. In fact, death of a particle occurs only when the level of the particle crosses a specified level $r$, or for the limiting models, hits infinity. For branching Markov processes, at each time $t$, conditioned on the state of the process, the levels are independent and uniformly distributed on $[0,r]…
For a quadratic Markov branching process (QMBP), we show that the decay parameter is equal to the first eigenvalue of a Sturm-Liouville operator associated with the PDE that the generating function of the transition probability satisfies. The proof is based on the spectral properties of the Sturm-Liouville operator. Both the upper and lower bounds of the decay parameter are given explicitly by means of a version of Hardy inequality. Two examples are provided to illustrate our results. The important quantity, the Hardy index, which is closely linked with the decay parameter of QMBP, is deeply i…
We generalize recent results of Haas and Miermont to obtain scaling limits of Markov branching trees whose size is specified by the number of nodes whose out-degree lies in a given set. We then show that this implies that the scaling limit of finite variance Galton-Watson trees condition on the number of nodes whose out-degree lies in a given set is the Brownian continuum random tree. The key to this is a generalization of the classical Otter-Dwass formula.
We study the exponential growth of bifurcating processes with ancestral dependence. We suppose here that the lifetimes of the cells are dependent random variables, that the numbers of new cells are random and dependent. Lifetimes and new cells's numbers are also assumed to be dependent. We illustrate our results by examples, including some Markov models. Our approach is related to the behaviour of the Laplace transform of nonnegative additive functional of Markov chains and require weak moment assumption (no exponential moment is needed).
By studying an admissible family of branching mechanisms introduced in Li (2014), we obtain a pruning procedure on Lévy trees. Then we could construct a decreasing Lévy-CRT-valued process $\{{\mathcal T}_t\}$ by pruning Lévy trees and an analogous process $\{{\mathcal T}^*_t\}$ by pruning a critical Lévy tree conditioned to be infinite. Under a regular condition on the admissible family of branching mechanisms, we show that the law of $\{{\mathcal T}_t\}$ at the ascension time can be represented by $\{{\mathcal T}^*_t\}$. The results generalize those studied in Abraham and Delmas (2012).
We provide a many-to-few formula in the general setting of non-local branching Markov processes. This formula allows one to compute expectations of k-fold sums over functions of the population at k different times. The result generalises [14] to the non-local setting, as introduced in [11] and [8]. As an application, we consider the case when the branching process is critical, and conditioned to survive for a large time. In this setting, we prove a general formula for the limiting law of the death time of the most recent common ancestor of two particles selected uniformly from the population a…
We give necessary and sufficient conditions for laws of large numbers to hold in $L^2$ for the empirical measure of a large class of branching Markov processes, including $λ$-positive systems but also some $λ$-transient ones, such as the branching Brownian motion with drift and absorption at $0$. This is a significant improvement over previous results on this matter, which had only dealt so far with $λ$-positive systems. Our approach is purely probabilistic and is based on spinal decompositions and many-to-few lemmas. In addition, we characterize when the limit in question is always strictly p…
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 environment, and one individual is replaced by a random number of offspring whose distribution depends on the new environment. We give a first moment condition that determines whether this process survives forever with positive probability. On the event of survival we prove a law of large numbers and a central limit theorem for the population size. We also define a …
We introduce a simple tree growth process that gives rise to a new two-parameter family of discrete fragmentation trees that extends Ford's alpha model to multifurcating trees and includes the trees obtained by uniform sampling from Duquesne and Le Gall's stable continuum random tree. We call these new trees the alpha-gamma trees. In this paper, we obtain their splitting rules, dislocation measures both in ranked order and in sized-biased order, and we study their limiting behaviour.
We give an example of a transient reversible Markov chain that almost surely has only a finite number of cutpoints. We explain how this is relevant to a conjecture of Diaconis and Freedman and a question of Kaimanovich. We also answer Kaimanovich's question when the Markov chain is a nearest-neighbor random walk on a tree.
We consider a family of random trees satisfying a Markov branching property. Roughly, this property says that the subtrees above some given height are independent with a law that depends only on their total size, the latter being either the number of leaves or vertices. Such families are parameterized by sequences of distributions on partitions of the integers that determine how the size of a tree is distributed in its different subtrees. Under some natural assumption on these distributions, stipulating that "macroscopic" splitting events are rare, we show that Markov branching trees admit the…
