Related papers: Galton-Watson Probability Contraction

We present two iterative methods for computing the global and partial extinction probability vectors for Galton-Watson processes with countably infinitely many types. The probabilistic interpretation of these methods involves truncated…

We prove that critical multitype Galton-Watson trees converge after rescaling to the Brownian continuum random tree, under the hypothesis that the offspring distribution has finite covariance matrices. Our study relies on an ancestral…

We study random typical minimal factorizations of the $n$-cycle, which are factorizations of $(1, \ldots,n)$ as a product of $n-1$ transpositions, chosen uniformly at random. Our main result is, roughly speaking, a local convergence theorem…

We show that large critical multi-type Galton-Watson trees, when conditioned to be large, converge locally in distribution to an infinite tree which is analoguous to Kesten's infinite monotype Galton-Watson tree. This is proven when we…

We show that given a log-concave offspring distribution, the corresponding sequence of Bienaym\'e-Galton-Watson trees conditioned to have $n\geq 1$ vertices admits a realization as a Markov process $(T_n)_{n\geq1}$ which adds a new…

Additive tree functionals allow to represent the cost of many divide-and-conquer algorithms. We give an invariance principle for such tree functionals for the Catalan model (random tree uniformly distributed among the full binary ordered…

We introduce a simple technique for proving the transience of certain processes defined on the random tree $\mathcal{G}$ generated by a supercritical branching process. We prove the transience for once-reinforced random walks on…

Panagiotou and Stufler (arXiv:1502.07180v2) recently proved one important fact on their way to establish the scaling limits of random P\'{o}lya trees: a uniform random P\'{o}lya tree of size $n$ consists of a conditioned critical…

The aim of this lecture is to give an overview of old and new resultson Bienaym\'e-Galton-Watson (BGW) trees. After introducing the framework of discretetrees, we first give alternative proofs of classical results on theextinction…

In this paper, we establish the necessary and sufficient criterion for the contact process on Galton-Watson trees (resp. random graphs) to exhibit the phase of extinction (resp. short survival). We prove that the survival threshold…

Consider a branching random walk, where the branching mechanism is governed by a Galton-Watson process, and the migration by a finite range symmetric irreducible random walk on the integer lattice $\mathbb{Z}^d$. Let $Z_n(z)$ be the number…

We consider invasion percolation on Galton-Watson trees. On almost every Galton-Watson tree, the invasion cluster almost surely contains only one infinite path. This means that for almost every Galton-Watson tree, invasion percolation…

A class of branching processes in varying environments is exhibited which become extinct almost surely even though the means M_n grow fast enough so that sum M_n^{-1} is finite. In fact, such a process is constructed for every offspring…

A celebrated result in probability theory is that a simple symmetric random walk on the $d$-dimensional lattice $\mathbb{Z}^d$ is recurrent for $d=1,2$ and transient for $d\geq 3$. In this note, we derive a closed-form expression, in terms…

We give a criterion of the form Q(d)c(M)<1 for the non-reconstructability of tree-indexed q-state Markov chains obtained by broadcasting a signal from the root with a given transition matrix M. Here c(M) is an explicit function, which is…

We consider a sequence $\mathbf{T} = (\mathcal{T}_n : n \in \mathbb{N}^+)$ of trees $\mathcal{T}_n$ where, for some $\Delta \in \mathbb{N}^+$ every $\mathcal{T}_n$ has height at most $\Delta$ and as $n \to \infty$ the minimal number of…

In this paper, we study the Galton-Watson process in the random environment for the particular case when the number of the offsprings in each generation has the fractional linear generation function with random parameters. In this case, the…

We consider a branching random walk on a multi($Q$)-type, supercritical Galton-Watson tree which satisfies Kesten-Stigum condition. We assume that the displacements associated with the particles of type $Q$ have regularly varying tails of…

In this work, the probability of return for random walks on $\mathbb{Z}$, whose increment is given by the $k$-bonacci sequence, is determined. Also, the Hausorff, packing and box-counting dimensions of the set of these walks that return an…

We consider a null-recurrent randomly biased walk $\mathbb{X}$ on a Galton-Watson tree in the (sub)-diffusive regime and we prove that properly renormalized, the local time in a critical generation converges in law towards some function of…