Related papers: Invasion Percolation on Galton-Watson Trees

In this paper we are interested in a random walk in a random environment on a super-critical Galton-Watson tree. We focus on the recurrent cases already studied by Y. Hu and Z. Shi and G. Faraud. We prove that the largest generation…

Let T be a rooted supercritical multi-type Galton-Watson (MGW) tree with types coming from a finite alphabet, conditioned to non-extinction. The lambda-biased random walk (X_t, t>=0) on T is the nearest-neighbor random walk which, when at a…

We study the typical behavior of the harmonic measure of balls in large critical Galton-Watson trees whose offspring distribution has finite variance. The harmonic measure considered here refers to the hitting distribution of height $n$ by…

We prove limit theorems and variance estimates for quantities related to ponds and outlets for 2D invasion percolation. We first exhibit several properties of a sequence $({\mathbf{O}}(n))$ of outlet variables, the $n$th of which gives the…

Let ${\cal G}$ be the incipient infinite cluster (IIC) for percolation on a homogeneous tree of degree $n_0+1$. We obtain estimates for the transition density of the continuous time simple random walk $Y$ on ${\cal G}$; the process…

Consider biased random walks on two Galton-Watson trees without leaves having progeny distributions $P_1$ and $P_2$ (GW$(P_1)$ and GW$(P_2)$) where $P_1$ and $P_2$ are supported on positive integers and $P_1$ dominates $P_2$ stochastically.…

A rotor-router walk on a graph is a deterministic process, in which each vertex is endowed with a rotor that points to one of the neighbors. A particle located at some vertex first rotates the rotor in a prescribed order, and then it is…

We consider the biased random walk on a critical Galton-Watson tree conditioned to survive, and confirm that this model with trapping belongs to the same universality class as certain one-dimensional trapping models with slowly-varying…

We are interested in the local limits of families of random trees that satisfy the Markov branching property, which is fulfilled by a wide range of models. Loosely, this property entails that given the sizes of the sub-trees above the root,…

Pruning processes $(\mathcal{F}(\theta),\theta\geq 0)$ have been studied separately for Galton-Watson trees and for L\'evy trees/forests. We establish here a limit theory that strongly connects the two studies. This solves an open problem…

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…

A recurrent graph $G$ has the infinite collision property if two independent random walks on $G$, started at the same point, collide infinitely often a.s. We give a simple criterion in terms of Green functions for a graph to have this…

We consider a super-critical Galton-Watson tree whose non-degenerate offspring distribution has finite mean. We consider the random trees $\tau$n distributed as $\tau$ conditioned on the n-th generation, Zn, to be of size an $\in$ N. We…

We provide a complete picture of the local convergence of critical or subcritical Galton-Watson tree conditioned on having a large number of individuals with out-degree in a given set. The generic case, where the limit is a random tree with…

This paper deals with a transient random walk in Dirichlet environment, or equivalently a linearly edge reinforced random walk, on a Galton-Watson tree. We compute the stationary distribution of the environment seen from the particle of an…

We consider infinite Galton-Watson trees without leaves together with i.i.d.~random variables called marks on each of their vertices. We define a class of flow rules on marked Galton-Watson trees for which we are able, under some algebraic…

We consider a Galton-Watson tree where each node is marked independently of each others with a probability depending on its outdegree. We give a complete picture of the local convergence of critical or sub-critical marked Galton-Watson…

Fix $n\in\mathbb{N}$. Let $\mathbf{T}_n$ be the set of rooted trees $(T,o)$ whose vertices are labeled by elements of $\{1,...,n\}$. Let $\nu$ be a strongly connected multi-type Galton-Watson measure. We give necessary and sufficient…

Motivated by recent experiments, we investigate the scattering properties of percolation clusters generated by numerical simulations on a three dimensional cubic lattice. Individual clusters of given size are shown to present a fractal…

We study the random planar maps obtained from supercritical Galton--Watson trees by adding the horizontal connections between successive vertices at each level. These are the hyperbolic analog of the maps studied by Curien, Hutchcroft and…