Related papers: Number of Complete N-ary Subtrees on Galton-Watson…
The family tree of a Galton-Watson branching process may contain N-ary subtrees, i.e. subtrees whose vertices have at least N>0 children. For family trees without infinite N-ary subtrees, we study how fast N-ary subtrees of height t…
We consider the set of random Bienaym\'e-Galton-Watson trees with a bounded number of offspring and bounded number of generations as a statistical mechanics model: a random tree is a rooted subtree of the maximal tree; the spin at a given…
We study the conditions for families of subtrees to exist with high probability (whp) in a Galton-Walton tree of size $n$. We first give a Poisson approximation of fringe subtree counts, which yields the height of the maximal complete…
A curious connection exists between the theory of optimal stopping for independent random variables, and branching processes. In particular, for the branching process $Z_n$ with offspring distribution $Y$, there exists a random variable $X$…
The Galton--Watson process is the simplest example of a branching process. The relationship between the offspring distribution, and, when the extinction occurs almost surely, the distribution of the total progeny is well known. In this…
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 investigate the random continuous trees called L\'evy trees, which are obtained as scaling limits of discrete Galton-Watson trees. We give a mathematically precise definition of these random trees as random variables taking values in the…
We investigate the genealogical structure of general critical or subcritical continuous-state branching processes. Analogously to the coding of a discrete tree by its contour function, this genealogical structure is coded by a real-valued…
Let's denote a complete $m$-ary rooted tree graph of height $n$ as $G$. In scope of this paper we prove the certain relations between the properties of $G$ and the expectation and variance of the distribution of lengths of strings,…
We study a genealogical model for continuous-state branching processes with immigration with a (sub)critical branching mechanism. This model allows the immigrants to be on the same line of descent. The corresponding family tree is an…
Consider the Erd\H{o}s-Renyi random graph on n vertices where each edge is present independently with probability c/n, with c>0 fixed. For large n, a typical random graph locally behaves like a Galton-Watson tree with Poisson offspring…
Given a Galton-Watson process conditioned to have total progeny equal to $n$, we study the asymptotic probability that this conditioned Galton-Watson process has distance to the border bigger or equal than $k$, as the number of nodes $n…
We study the extremes of branching random walks under the assumption that the underlying Galton-Watson tree has infinite progeny mean. It is assumed that the displacements are either regularly varying or they have lighter tails. In the…
Consider a rooted $N$-ary tree. To every vertex of this tree, we attach an i.i.d. continuous random variable. A vertex is called accessible if along its ancestral line, the attached random variables are increasing. We keep accessible…
We examine the population growth system called Q-processes. This is defined by the Galton-Watson Branching system conditioned on non-extinction of its trajectory in the remote future. In this paper we observe the total progeny up to time…
We construct random locally compact real trees called Levy trees that are the genealogical trees associated with continuous-state branching processes. More precisely, we define a growing family of discrete Galton-Watson trees with i.i.d.…
Consider the edge-deletion process in which the edges of some finite tree T are removed one after the other in the uniform random order. Roughly speaking, the cut-tree then describes the genealogy of connected components appearing in this…
The simple Galton--Watson process describes populations where individuals live one season and are then replaced by a random number of children. It can also be viewed as a way of generating random trees, each vertex being an individual of…
Let $\tau$n be a random tree distributed as a Galton-Watson tree with geometric offspring distribution conditioned on {Zn = an} where Zn is the size of the n-th generation and (an, n $\in$ N *) is a deterministic positive sequence. We study…
We consider the Ising model on a supercritical Galton-Watson tree $\mathbf{T}_n$ of depth $n$ with a sparse random external field, given by a collection of i.i.d. Bernouilli random variables with vanishing parameter $p_n$. This may me…