Related papers: The critical Galton-Watson process vanishes
We prove that the speed of a biased random walk on a supercritical Galton-Watson tree conditioned to survive is analytic within the ballistic regime. This extends the previous work arXiv:1906.07913 in which it was shown that the speed is…
Bisexual Galton-Watson processes are discrete Markov chains where reproduction events are due to mating of males and females. Owing to this interaction, the standard branching property of Galton-Watson processes is lost. We prove tightness…
Let T be a rooted supercritical multi-type Galton-Watson (MGW) tree with types coming from a finite alphabet, conditioned to non-extinction. The lambda-biased random walk (X_t, t>=0) on T is the nearest-neighbor random walk which, when at a…
The theory of finite-size scaling explains how the singular behavior of thermodynamic quantities in the critical point of a phase transition emerges when the size of the system becomes infinite. Usually, this theory is presented in a…
We consider the setting of either a general non-local branching particle process or a general non-local superprocess, in both cases, with and without immigration. Under the assumption that the mean semigroup has a Perron-Frobenious type…
We consider a one-dimensional simple random walk surviving among a field of static soft traps : each time it meets a trap the walk is killed with probability 1--e --$\beta$ , where $\beta$ is a positive and fixed parameter. The positions of…
We provide a simple set of sufficient conditions for the weak convergence of discrete Galton-Watson branching processes with immigration to continuous time and continuous state branching processes with immigration.
In this paper the asymptotic behavior of the conditional least squares estimators of the offspring mean matrix for a 2-type critical positively regular Galton-Watson branching process with immigration is described.We also study this…
In this note, we prove a quenched functional central limit theorem for a biased random walk on a supercritical Galton-Watson tree with leaves. This extends a result of Peres and Zeitouni (2008) where the case without leaves is considered. A…
In this paper, we show that a Galton-Watson tree conditioned to have a fixed number of particles in generation $n$ converges in distribution as $n\rightarrow\infty$, and with this tool we study the span and gap statistics of a branching…
We study the asymptotic behaviour of the survival probability of a multi-type branching processes in random environment. The class of processes we consider corresponds, in the one-dimensional situation, to the intermediately subcritical…
We study degree-penalized contact processes on Galton-Watson trees (GW) and the configuration model. The model we consider is a modification of the usual contact process on a graph. In particular, each vertex can be either infected or…
Consider a population evolving as a critical continuous-time Galton-Watson (GW) tree. Conditional on the population surviving until a large time $T$, sample $k$ individuals uniformly at random (without replacement) from amongst those alive…
Let $Z_{n}$ be the number of individuals in a subcritical BPRE evolving in the environment generated by iid probability distributions. Let $X$ be the logarithm of the expected offspring size per individual given the environment. Assuming…
We consider critical percolation on Galton-Watson trees and prove quenched analogues of classical theorems of critical branching processes. We show that the probability critical percolation reaches depth $n$ is asymptotic to a…
We construct two kinds of stochastic flows of discrete Galton-Watson branching processes. Some scaling limit theorems for the flows are proved, which lead to local and nonlocal branching superprocesses over the positive half line.
We consider the time evolution of the supercritical Galton-Watson model of branching particles with extra parameter (mass). In the moment of the division the mass of the particle (which is growing linearly after the birth) is divided in…
In this short note we give an alternative proof of Glivenko's Theorem, stating that a formula $\phi$ is provable in classical propositional logic if and only if $\neg\neg\phi$ is provable in intuitionistic propositional logic. We work in…
As a model of trapping by biased motion in random structure, we study the time taken for a biased random walk to return to the root of a subcritical Galton-Watson tree. We do so for trees in which these biases are randomly chosen,…
For a branching process in random environment it is assumed that the offspring distribution of the individuals varies in a random fashion, independently from one generation to the other. Interestingly there is the possibility that the…