For a subcritical Galton-Watson process $(ζ_n)$, it is well known that under an $X \log X$ condition, the quotient $P(ζ_n > 0)/ Eζ_n$ has a finite positive limit. There is an analogous result for a (one-dimensional) supercritical branching random walk: when $a$ is in the so-called subcritical speed area, the probability of presence around $na$ in the $n$-th generation is asymptotically proportional to the corresponding expectation. In Rouault (1993) this result was stated under a natural $X \log X$ assumption on the offspring point process and a (unnatural) condition on the offspring mean. Here we prove that the result holds without this latter condition, in particular we allow an infinite mean and a dimension $d \geq 1$ for the state-space. As a consequence the result holds also for homogeneous fragmentations as defined in Bertoin (2001), using the method of discrete-time skeletons; this completes the proof of Theorem 4 in Bertoin-Rouault (2004 see math/PR/0409545). Finally, an application to conditioning on the presence allows to meet again the probability tilting and the so-called additive martingale.
We give a stochastic model for the fragmentation phase of a snow avalanche. We construct a fragmentation-branching process related to the avalanches, on the set of all fragmentation sizes introduced by J. Bertoin. A fractal property of this process is emphasized. We also establish a specific stochastic equation of fragmentation. It turns out that specific branching Markov processes on finite configurations of particles with sizes bigger than a strictly positive threshold are convenient for describing the continuous time evolution of the number of the resulting fragments. The results are obtain…
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.
Homogeneous mass fragmentation processes describe the evolution of a unit mass that breaks down randomly into pieces as time. Mathematically speaking, they can be thought of as continuous-time analogues of branching random walks with non-negative displacements. Following recent developments in the theory of branching random walks, in particular the work of \cite{AShi10}, we consider the problem of the Seneta-Heyde norming of the so-called additive martingale at criticality. Aside from replicating results for branching random walks in the new setting of fragmentation processes, our main goal is…
We consider fragmentation processes with values in the space of marked partitions of $\mathbb{N}$, i.e. partitions where each block is decorated with a nonnegative real number. Assuming that the marks on distinct blocks evolve as independent positive self-similar Markov processes and determine the speed at which their blocks fragment, we get a natural generalization of the self-similar fragmentations of Bertoin (2002). Our main result is the characterization of these generalized fragmentation processes: a Lévy-Khinchin representation is obtained, using techniques from positive self-similar Mar…
Homogeneous fragmentations describe the evolution of a unit mass that breaks down randomly into pieces as time passes. They can be thought of as continuous time analogs of a certain type of branching random walks, which suggests the use of time-discretization to shift known results from the theory of branching random walks to the fragmentation setting. In particular, this yields interesting information about the asymptotic behaviour of fragmentations. On the other hand, homogeneous fragmentations can also be investigated using a powerful technique of discretization of space due to Kingman, nam…
In this paper we study a 2-type linear-fractional branching process in varying environment with asymptotically constant mean matrices. Let $ν$ be the extinction time and for $k\ge1$ let $M_k$ be the mean matrix of offspring distribution of individuals of the $(k-1)$-th generation. Under certain conditions, we show that $P(ν=n)$ and $P(ν>n)$ are asymptotically equivalent to some functions of products of spectral radii of the mean matrices. This paper complements a former result [arXiv: 2007.07840] which requires in addition a condition $\forall k\ge1,\rm{det}(M_k)<-\varepsilon$ for some $\varep…
The basic object we consider is a certain model of continuum random tree, called the stable tree. We construct a fragmentation process $(F^-(t), t>=0)$ out of this tree by removing the vertices located under height $t$. Thanks to a self-similarity property of the stable tree, we show that the fragmentation process is also self-similar. The semigroup and other features of the fragmentation are given explicitly. Asymptotic results are given, as well as a couple of related results on continuous-state branching processes.
In this paper we prove a strong law of large numbers and its L^1-convergence counterpart for the process counted with a random characteristic in the context of self-similar fragmentation processes. This result extends a somewhat analogical result by Nerman for general branching processes to fragmentation processes. In addition, we apply the general result of this paper to a specific example that in particular extends a limit theorem, concerning the fragmentation energy, by Bertoin and Martínez from L^1-convergence to almost sure convergence. Our approach treats fragmentation processes with an …
We study the asymptotics of the $k$-regular self-similar fragmentation process. For $α> 0$ and an integer $k \geq 2$, this is the Markov process $(I_t)_{t \geq 0}$ in which each $I_t$ is a union of open subsets of $[0,1)$, and independently each subinterval of $I_t$ of size $u$ breaks into $k$ equally sized pieces at rate $u^α$. Let $k^{ - m_t}$ and $k^{ - M_t}$ be the respective sizes of the largest and smallest fragments in $I_t$. By relating $(I_t)_{t \geq 0}$ to a branching random walk, we find that there exist explicit deterministic functions $g(t)$ and $h(t)$ such that $|m_t - g(t)| \leq…
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 are interested in the cycles obtained by slicing at all heights random Boltzmann triangulations with a simple boundary. We establish a functional invariance principle for the lengths of these cycles, appropriately rescaled, as the size of the boundary grows. The limiting process is described using a self-similar growth-fragmentation process with explicit parameters. To this end, we introduce a branching peeling exploration of Boltzmann triangulations, which allows us to identify a crucial martingale involving the perimeters of cycles at given heights. We also use a recent result concerning …
In order to model random density-dependence in population dynamics, we construct the random analogue of the well-known logistic process in the branching process' framework. This density-dependence corresponds to intraspecific competition pressure, which is ubiquitous in ecology, and translates mathematically into a quadratic death rate. The logistic branching process, or LB-process, can thus be seen as (the mass of) a fragmentation process (corresponding to the branching mechanism) combined with constant coagulation rate (the death rate is proportional to the number of possible coalescing pair…
In this note, we study the asymptotical frontier behavior of a branching reflected Brownian motion. There is essentially no difference in maximal displacement between a branching Brownian motion and its reflected counterpart. We provide two proofs of this fact, one via a soft argument on the dependance of two-sided extremal particles in a branching Brownian motion and the other based on direct computations as in Roberts. The asymptotics of minimal displacement is also given.
We study the long time behavior of an asymmetric size-structured measure-valued growth-fragmentation branching process that models the dynamics of a population of cells taking into account physiological and morphological asymmetry at division. We show that the process exhibits a Malthusian behavior; that is that the global population size grows exponentially fast and that the trait distribution of individuals converges to some stable distribution. The proof is based on a generalization of Lyapunov function techniques for non-conservative semi-groups. We then investigate the fluctuations of the…
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 the descendants at birth depends on the trait of the mother and on the number of descendants. In this article, we explicitly describe the penalized Markov process, named auxiliary process, corresponding to the dynamic of the trait along the spine by giving its associated infinitesimal generator. We prove a Many-to-One formula and a Many-to-O…
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 proportional to their sizes (isolation of connected component). A phase transition occurs when the isolation is able to stop the growth fragmentation process and cause extinction. When the process survives, the number of clusters increases exponentially and we prove that the normalized empirical measure of clusters a.s. converges to a limit law on recursive …
The genealogical structure of self-similar growth-fragmentations can be described in terms of a branching random walk. The so-called intrinsic area $\mathrm{A}$ arises in this setting as the terminal value of a remarkable additive martingale. Motivated by connections with some models of random planar geometry, the purpose of this work is to investigate the effect of conditioning a self-similar growth-fragmentation on its intrinsic area. The distribution of $\mathrm{A}$ satisfies a useful smoothing transform which enables us to establish the existence of a regular density $a$ and to determine t…
In this paper, we consider a class of generalized continuous-state branching processes obtained by Lamperti type time changes of spectrally positive Lévy processes using different rate functions. When explosion occurs to such a process, we show that the process converges to infinity in finite time asymptotically along a deterministic curve, and identify the speed of explosion for rate function in different regimes. To prove the main theorems, we also establish a new asymptotic result for scale function of spectrally positive Lévy process.
We consider a discrete-time branching random walk defined on the real line, which is assumed to be supercritical and in the boundary case. It is known that its leftmost position of the $n$-th generation behaves asymptotically like $\frac{3}{2}\ln n$, provided the non-extinction of the system. The main goal of this paper, is to prove that the path from the root to the leftmost particle, after a suitable normalizatoin, converges weakly to a Brownian excursion in $D([0,1],\r)$.
We condition super-Brownian motion on "boundary statistics" of the exit measure $X_D$ from a bounded domain $D$. These are random variables defined on an auxiliary probability space generated by sampling from the exit measure $X_D$. Two particular examples are: conditioning on a Poisson random measure with intensity $βX_D$ and conditioning on $X_D$ itself. We find the conditional laws as $h$-transforms of the original SBM law using Dynkin's formulation of $X$-harmonic functions. We give explicit expression for the (extended) $X$-harmonic functions considered. We also obtain explicit constructi…
Under a fourth order moment condition on the branching and a second order moment condition on the immigration mechanisms, we show that an appropriately scaled projection of a supercritical and irreducible continuous state and continuous time branching process with immigration on certain left non-Perron eigenvectors of the branching mean matrix is asymptotically mixed normal. With an appropriate random scaling, under some conditional probability measure, we prove asymptotic normality as well. In case of a non-trivial process, under a first order moment condition on the immigration mechanism, we…
We study the behaviour of a natural measure defined on the leaves of the genealogical tree of some branching processes, namely self-similar growth-fragmentation processes. Each particle, or cell, is attributed a positive mass that evolves in continuous time according to a positive self-similar Markov process and gives birth to children at negative jumps events. We are interested in the asymptotics of the mass of the ball centered at the root, as its radius decreases to $0$. We obtain the almost sure behaviour of this mass when the Eve cell starts with a strictly positive size. This differs fro…
We study a random fragmentation process and its associated random tree. The process has earlier been studied by Dean and Majumdar (J. Phys. A: Math. Gen., vol. 35, L501--L507), who found a phase transition: the number of fragmentations is asymptotically normal in some cases but not in others, depending on the position of roots of a certain characteristic equation. This parallels the behaviour of discrete analogues with various random trees that have been studied in computer science. We give rigorous proofs of this phase transition, and add further details. The proof uses the contraction method…
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…
We consider catalytic branching populations. They consist of a catalyst population evolving according to a critical binary branching process in continuous time with a constant branching rate and a reactant population with a branching rate proportional to the number of catalyst individuals alive. The reactant forms a process in random medium. We describe asymptotically the genealogy of catalytic branching populations coded as the induced forest of $\mathbb{R}$-trees using the many individuals--rapid branching continuum limit. The limiting continuum genealogical forests are then studied in detai…
We study critical branching random walks (BRWs) $U^{(n)}$ on~$\mathbb{Z}_{+}$ where for each $n$, the displacement of an offspring from its parent has drift~$2β/\sqrt{n}$ towards the origin and reflection at the origin. We prove that for any~$α>1$, conditional on survival to generation~$[n^α]$, the maximal displacement is asymptotically equivalent to $(α-1)/(4β)\sqrt{n}\log n$. We further show that for a sequence of critical BRWs with such displacement distributions, if the number of initial particles grows like~$yn^α$ for some $y>0$ and $α>1$, and the particles are concentrated in~$[0,O(\sqrt…
Our principal aim is to observe the Markov discrete-time process of population growth with long-living trajectory. First we study asymptotical decay of generating function of Galton-Watson process for all cases as the Basic Lemma. Afterwards we get a Differential analogue of the Basic Lemma. This Lemma plays main role in our discussions throughout the paper. Hereupon we improve and supplement classical results concerning Galton-Watson process. Further we investigate properties of the population process so called Q-process. In particular we obtain a joint limit law of Q-process and its total st…
In this paper we consider a branching particle system consisting of particles moving according to the Ornstein-Uhlenbeck process in $\Rd$ and undergoing a binary, supercritical branching with a constant rate $λ>0$. This system is known to fulfil a law of large numbers (under exponential scaling). In the paper we prove the corresponding central limit theorem. The limit and the CLT normalisation fall into three qualitatively different classes. In, what we call, the small branching rate case the situation resembles the classical one. The weak limit is Gaussian and normalisation is the square root…
We study a branching Brownian motion $Z$ in $\mathbb{R}^d$, among obstacles scattered according to a Poisson random measure with a radially decaying intensity. Obstacles are balls with constant radius and each one works as a trap for the whole motion when hit by a particle. Considering a general offspring distribution, we derive the decay rate of the annealed probability that none of the particles of $Z$ hits a trap, asymptotically in time $t$. This proves to be a rich problem motivating the proof of a more general result about the speed of branching Brownian motion conditioned on non-extincti…
The purpose of the present work is twofold. First, we develop the theory of general self-similar growth-fragmentation processes by focusing on martingales which appear naturally in this setting and by recasting classical results for branching random walks in this framework. In particular, we establish many-to-one formulas for growth-fragmentations and define the notion of intrinsic area of a growth-fragmentation. Second, we identify a distinguished family of growth-fragmentations closely related to stable Lévy processes, which are then shown to arise as the scaling limit of the perimeter proce…
We show uniqueness of the spine of a Fleming-Viot particle system under minimal assumptions on the driving process. If the driving process is a continuous time Markov process on a finite space, we show that asymptotically, when the number of particles goes to infinity, the branching rate for the spine is twice that of a generic particle in the system, and every side branch has the distribution of the unconditioned generic branching tree.
This survey studies asymptotics of random fringe trees and extended fringe trees in random trees that can be constructed as family trees of a Crump-Mode-Jagers branching process, stopped at a suitable time. This includes random recursive trees, preferential attachment trees, fragmentation trees, binary search trees and (more generally) $m$-ary search trees, as well as some other classes of random trees. We begin with general results, mainly due to Aldous (1991) and Jagers and Nerman (1984). The general results are applied to fringe trees and extended fringe trees for several particular types o…
Interesting posts are continually forwarded by the users of the online social network (OSN). Such propagation leads to re-forwarding of the post to some of the previous recipients, which increases as the post reaches a large number of users. Consequently, the effective forwards (after deleting the re-forwards) reduce, eventually leading to the saturation of the total number of copies. We model this process as a new variant of the branching process, the `saturated total-population-dependent branching process', and analyse it using the stochastic approximation technique. Notably, we obtain deter…
For a supercritical catalytic branching random walk on Z^d (d is positive integer) with an arbitrary finite catalysts set we study the spread of particles population as time grows to infinity. Namely, we divide by t the position coordinates of each particle existing at time t and then let t tend to infinity. It is shown that in the limit there are a.s. no particles outside the closed convex surface in R^d which we call the propagation front and, under condition of infinite number of visits of the catalysts set, a.s. there exist particles on the propagation front. We also demonstrate that the p…
We have shown recently how to calculate the large deviation function of the position $X_{\max}(t) $ of the right most particle of a branching Brownian motion at time $t$. This large deviation function exhibits a phase transition at a certain negative velocity. Here we extend this result to more general branching random walks and show that the probability distribution of $X_{\max}(t)$ has, asymptotically in time, a prefactor characterized by non trivial power law.
We study a fragmentation problem where an initial object of size x is broken into m random pieces provided x>x_0 where x_0 is an atomic cut-off. Subsequently the fragmentation process continues for each of those daughter pieces whose sizes are bigger than x_0. The process stops when all the fragments have sizes smaller than x_0. We show that the fluctuation of the total number of splitting events, characterized by the variance, generically undergoes a nontrivial phase transition as one tunes the branching number m through a critical value m=m_c. For m<m_c, the fluctuations are Gaussian where a…
Branching process approximation to the initial stages of an epidemic process has been used since the 1950's as a technique for providing stochastic counterparts to deterministic epidemic threshold theorems. One way of describing the approximation is to construct both branching and epidemic processes on the same probability space, in such a way that their paths coincide for as long as possible. In this paper, it is shown, in the context of a Markovian model of parasitic infection, that coincidence can be achieved with asymptotically high probability until o(N^{2/3}) infections have occurred, wh…
We consider the long-time behaviour of a branching random walk in random environment on the lattice $\Z^d$. The migration of particles proceeds according to simple random walk in continuous time, while the medium is given as a random potential of spatially dependent killing/branching rates. The main objects of our interest are the annealed moments $< m_n^p > $, i.e., the $p$-th moments over the medium of the $n$-th moment over the migration and killing/branching, of the local and global population sizes. For $n=1$, this is well-understood \cite{GM98}, as $m_1$ is closely connected with the par…
A multitype Markovian branching process with one-type population size dependence
Nuffield Department of Medicine, University of Oxford（牛津大学纳菲尔德医学系）；Mahidol Oxford Tropical Medicine Research Unit, Mahidol University（马希托牛津热带医学研究单位，马希隆大学）；School of Mathematics and Statistics, University of Melbourne（墨尔本大学数学与统计学院）
We consider a model of random tree growth, where at each time unit a new vertex is added and attached to an already existing vertex chosen at random. The probability with which a vertex with degree $k$ is chosen is proportional to $w(k)$, where the weight function $w$ is the parameter of the model. In the papers of B. Bollobas, O. Riordan, J. Spencer, G. Tusnady, and, independently, Mori, the asymptotic degree distribution is obtained for a model that is equivalent to the special case of ours, when the weight function is linear. The proof therein strongly relies on the linear choice of $w$. We…
We present a construction of a Lévy continuum random tree (CRT) associated with a super-critical continuous state branching process using the so-called exploration process and a Girsanov's theorem. We also extend the pruning procedure to this super-critical case. Let $ψ$ be a critical branching mechanism. We set $ψ_θ(\cdot)=ψ(\cdot+θ)-ψ(θ)$. Let $Θ=(θ_\infty,+\infty)$ or $Θ=[θ_\infty,+\infty)$ be the set of values of $θ$ for which $ψ_θ$ is a branching mechanism. The pruning procedure allows to construct a decreasing Lévy-CRT-valued Markov process $(\ct_θ,θ\inΘ)$, such that $\mathcal{T}_θ$ has …
We consider a supercritical catalytic branching random walk (CBRW) on a multidimensional lattice Z^d (d is positive integer). The main subject of study is the behavior of particles cloud in space and time. For CBRW on an integer line, Carmona and Hu (2014) examined the asymptotical behavior of the maximal coordinate M_n of the particles at time n. They proved that M_n/n converges to μalmost surely (on a set of local non-degeneracy of CBRW), as n tends to infinity, where μ>0 is a certain constant. Under additional assumption of a single catalyst in CBRW they also investigated the fluctuations o…
Motivated by a seminal paper of Kesten et al. (1975) we consider a branching process with a geometric offspring distribution with i.i.d. random environmental parameters $A_n$, $n\ge 1$ and size -1 immigration in each generation. In contrast to above mentioned paper we assume that the environment is long-tailed, that is that the distribution $F$ of $ξ_n := \log ((1-A_n)/A_n)$ is long-tailed. We prove that although the offspring distribution is light-tailed, the environment itself can produce extremely heavy tails of the distribution of the population size in the n-th generation which becomes ev…
By introducing a new measure for the infinite Galton-Watson process and providing estimates for (discrete) Green's functions on trees, we establish the asymptotic behavior of the capacity of critical branching random walks: in high dimensions $d\ge 7$, the capacity grows linearly; and in the critical dimension $d=6$, it grows asymptotically proportional to $\frac{n}{\log n}$.
The Neutron Transport Equation (NTE) describes the flux of neutrons through an inhomogeneous fissile medium. In this paper, we reconnect the NTE to the physical model of the spatial Markov branching process which describes the process of nuclear fission, transport, scattering, and absorption. By reformulating the NTE in its mild form and identifying its solution as an expectation semigroup, we use modern techniques to develop a Perron-Frobenius (PF) type decomposition, showing that growth is dominated by a leading eigenfunction and its associated left and right eigenfunctions. In the spirit of…
