Related papers: Very fat geometric galton-watson trees
As well known, for a supercritical Galton-Watson process $Z_n$ whose offspring distribution has mean $m>1$, the ratio $W_n:=Z_n/m^n$ has a.s. limit, say $W$. We study tail behaviour of the distributions of $W_n$ and $W$ in the case where…
Reinforced Galton--Watson processes describe the dynamics of a population where reproduction events are reinforced, in the sense that offspring numbers of forebears can be repeated randomly by descendants. More specifically, the evolution…
Aldous, Evans and Pitman (1998) studied the behavior of the fragmentation process derived from deleting the edges of a uniform random tree on $n$ labelled vertices. In particular, they showed that, after proper rescaling, the above…
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 consider a Galton-Watson tree where each node is marked independently of each others with a probability depending on itsout-degree. Using a penalization method, we exhibit new martingales where the number of marks up to level n -- 1…
We study self-similarity in random binary rooted trees. In a well-understood case of Galton-Watson trees, a distribution on a space of trees is said to be self-similar if it is invariant with respect to the operation of pruning, which cuts…
Let $T$ be an infinite rooted tree with weights $w_e$ assigned to its edges. Denote by $m_n(T)$ the minimum weight of a path from the root to a node of the $n$th generation. We consider the possible behaviour of $m_n(T)$ with focus on the…
We are interested in the randomly biased random walk on the supercritical Galton--Watson tree. Our attention is focused on a slow regime when the biased random walk $(X_n)$ is null recurrent, making a maximal displacement of order of…
We consider the simple random walk on Galton-Watson trees with supercritical offspring distribution, conditioned on non-extinction. In case the offspring distribution has finite support, we prove an upper bound for the annealed return…
The $k$-cut number of rooted graphs was introduced by Cai et al. as a generalization of the classical cutting model by Meir and Moon. In this paper, we show that all moments of the k-cut number of conditioned Galton-Watson trees converges…
This note defines a notion of multiplicity for nodes in a rooted tree and presents an asymptotic calculation of the maximum multiplicity over all leaves in a Bienaym\'e-Galton-Watson tree with critical offspring distribution $\xi$,…
We consider a Galton-Watson process $\mathbf{Z}% (n)=(Z_{1}(n),Z_{2}(n))$ with two types of particles. Particles of type 2 may produce offspring of both types while particles of type 1 may produce particles of their own type only. Let…
We consider a multi-type Galton-Watson branching processes, where the largest in magnitude positive eigenvalue $\rho$ of the first moments matrix is close to unity. Specifically, we examine the random vector representing the number of…
We study the local convergence of critical Galton-Watson trees and Levy trees under various conditionings. Assuming a very general monotonicity property on the functional of random trees, we show that random trees conditioned to have large…
We are interested in the structure of large Bienaym\'e-Galton-Watson random trees whose offspring distribution is critical and falls within the domain of attraction of a stable law of index $\alpha=1$. In stark contrast to the case $\alpha…
A recursive function on a tree is a function in which each leaf has a given value, and each internal node has a value equal to a function of the number of children, the values of the children, and possibly an explicitly specified random…
Population genetic processes, such as the adaptation of a quantitative trait to directional selection, may occur on longer time scales than the sweep of a single advantageous mutation. To study such processes in finite populations,…
We investigate conditioning Galton-Watson trees on general recursive-type events, such as the event that the tree survives until a specific level. It turns out that the conditioned tree is again a type of Galton-Watson tree, with different…
Distinguishing between continuous and first-order phase transitions is a major challenge in random discrete systems. We study the topic for events with recursive structure on Galton-Watson trees. For example, let $\mathcal{T}_1$ be the…
Consider a branching process $\{Z_n\}_{n\ge 0}$ with immigration in varying environment. For $a\in\{0,1,2,...\},$ let $C=\{n\ge0:Z_n=a\}$ be the collection of times at which the population size of the process attains level $a.$ We give a…