Related papers: Encoding multitype Galton-Watson forests and a mul…
We establish a general sufficient condition for a sequence of Galton Watson branching processes in varying environment to converge weakly. This condition extends previous results by allowing offspring distributions to have infinite…
We prime-encode the natural numbers via recursive factorisation, iterated to the exponents, generating a corpus of planar rooted trees equivalently represented as Dyck words. This forms a deterministic text endowed with internal rules.…
We consider the number of nodes in the levels of unlabelled rooted random trees and show that the stochastic process given by the properly scaled level sizes weakly converges to the local time of a standard Brownian excursion. Furthermore…
Recent work has proven the existence of extreme inbreeding in a European ancestry sample taken from the contemporary UK population \cite{nature_01}. This result brings our attention again to a math problem related to inbreeding family trees…
In this survey, we explore the connections between two areas of probability: percolation theory and population genetic models. Our first goal is to highlight a construction on Galton-Watson trees, which has been described in two different…
We consider a model of random loops on Galton-Watson trees with an offspring distribution with high expectation. We give the configurations a weighting of $\theta^{\#\text{loops}}$. For many $\theta>1$ these models are equivalent to certain…
The classical Galton--Watson process works with a fixed probability of fission at each time step. One of the generalizations is that the probabilities depend on time. We consider one of the most complex and interesting cases when we do not…
In this work we study the bisexual Galton-Watson process with a finite number of types, where females and males mate according to a ''mating function'' and form couples of different types. We assume that this function is superadditive,…
We classify the possible behaviors of a class of one-dimensional stochastic recurrent growth models. In our main result, we obtain nearly optimal bounds for the tail of hitting times of some compact sets. If the process is an aperiodic…
Consider a critical Galton--Watson branching process with immigration, where the offspring distribution belongs to the domain of attraction of a $(1 + \alpha)$-stable law with $\alpha \in (0,1)$, and the immigration distribution either (i)…
By decomposing the random walk path, we construct a multitype branching process with immigration in random environment for corresponding random walk with bounded jumps in random environment. Then we give two applications of the branching…
The aim of this paper is to introduce a multitype branching process with random migration following the research initiated with the Galton-Watson process with migration introduced in [Yanev & Mitov (1980) C. R. Acad. Bulg. Sci.…
We consider a continuous-time vertex reinforced jump process on a supercritical Galton-Watson tree. This process takes values in the set of vertices of the tree and jumps to a neighboring vertex with rate proportional to the local time at…
We study the asymptotic behaviour of a critical decomposable 3-type Galton-Watson process with immigration when its offspring mean matrix is triangular with diagonal entries 1. It is proved that, under second or fourth order moment…
In this paper, we consider Galton-Watson processes with immigration. Pick $i(\ge2)$ individuals randomly without replacement from the $n$-th generation and trace their lines of descent back in time till they coalesce into $1$ individual in…
We show that the number of copies of a given rooted tree in a conditioned Galton-Watson tree satisfies a law of large numbers under a minimal moment condition on the offspring distribution.
A family of continuous-state branching processes with immigration are constructed as the solution flow of a stochastic equation system driven by time-space noises. The family can be regarded as an inhomogeneous increasing path-valued…
In this paper the asymptotic behaviour of a critical 2-type Galton-Watson process with immigration is described when its offspring mean matrix is reducible, in other words, when the process is decomposable. It is proved that, under second…
With the need of fast retrieval speed and small memory footprint, document hashing has been playing a crucial role in large-scale information retrieval. To generate high-quality hashing code, both semantics and neighborhood information are…
A new Chase-type soft-decision decoding algorithm for Reed-Solomon codes is proposed, referred to as tree-based Chase-type algorithm}. The proposed tree-based Chase-type algorithm takes the set of all vectors as the set of testing patterns,…