Related papers: Continuous phase transitions on Galton-Watson tree…
A Galton-Watson process in varying environment is a discrete time branching process where the offspring distributions vary among generations. Based on a two-spine decomposition technique, we provide a probabilistic argument of a Yaglom-type…
We study a rumour model from a percolation theory and branching process point of view. The existence of a giant component is related to the event where the rumour, which started from the root of a tree, spreads out through an infinite…
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 study spanning trees on Sierpinski graphs (i.e., finite approximations to the Sierpinski gasket) that are chosen uniformly at random. We construct a joint probability space for uniform spanning trees on every finite Sierpinski graph and…
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,…
We are interested in the biased random walk on a supercritical Galton--Watson tree in the sense of Lyons, Pemantle and Peres, and study a phenomenon of slow movement. In order to observe such a slow movement, the bias needs to be random;…
We consider a fragmentation of discrete trees where the internal vertices are deleted independently at a rate proportional to their degree. Informally, the associated cut-tree represents the genealogy of the nested connected components…
We prove an invariance principle for linearly edge reinforced random walks on $\gamma$-stable critical Galton-Watson trees, where $\gamma \in (1,2]$ and where the edge joining $x$ to its parent has rescaled initial weight $d(\rho,…
We consider a generalized Derrida-Retaux model on a Galton-Watson tree with a geometric offspring distribution. For a class of recursive systems, including the Derrida-Retaux model with either a geometric or exponential initial…
We consider Galton-Watson trees associated with a critical offspring distribution and conditioned to have exactly $n$ vertices. These trees are embedded in the real line by affecting spatial positions to the vertices, in such a way that the…
One class of random walks with infinite memory, so called elephant random walks, are simple models describing anomalous diffusion. We present a surprising connection between these models and bond percolation on random recursive trees. We…
We study random trees which are invariant in law under the operation of contracting each edge independently with probability $p\in(0,1)$. We show that all such trees can be constructed through Poissonian sampling from a certain class 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…
We study the bond percolation game and the site percolation game on the rooted Galton-Watson tree $T_{\chi}$ with offspring distribution $\chi$. We obtain the probabilities of win, loss and draw for each player in terms of the fixed points…
Drmota and Gittenberger (1997) proved a conjecture due to Aldous (1991) on the height profile of a Galton-Watson tree with an offspring distribution of finite variance, conditioned on a total size of $n$ individuals. The conjecture states…
The Galton-Watson process is a Markov chain modeling the population size of independently reproducing particles giving birth to $k$ offspring with probability $p_k$, $k\ge0$. In this paper we consider {\it defective} Galton-Watson processes…
We introduce and study a model of plane random trees generalizing the famous Bienaym\'e--Galton--Watson model but where births and deaths are locally correlated. More precisely, given a random variable $(B,H)$ with values in $\{1,2,3,…
We give a description of invariants and attractors of the critical and subcritical Galton-Watson tree measures under the operation of Horton pruning (cutting tree leaves with subsequent series reduction). Under a regularity condition, the…
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…
Generating function equation has been derived for the probability distribution of the number of nodes with $k \ge 0$ outgoing lines in randomly evolving special trees. The stochastic properties of end-nodes (k=0) have been analyzed, and it…