Related papers: Random walks on decorated Galton-Watson trees

We consider branching random walks built on Galton--Watson trees with offspring distribution having a bounded support, conditioned to have $n$ nodes, and their rescaled convergences to the Brownian snake. We exhibit a notion of ``globally…

The Horton-Strahler number of a tree is a measure of its branching complexity; it is also known in the literature as the register function. We show that for critical Galton-Watson trees with finite variance conditioned to be of size $n$,…

In this paper we study the recurrence and transience of the $\mathbb{Z}^d$-valued branching random walk in random environment indexed by a critical Bienaym\'e-Galton-Watson tree, conditioned to survive. The environment is made either of…

We study the range $R_n$ of a random walk on the $d$-dimensional lattice $\mathbb{Z}^d$ indexed by a random tree with $n$ vertices. Under the assumption that the random walk is centered and has finite fourth moments, we prove in dimension…

We use the concept of unimodular random graph to show that the branching simple random walk on $\mathbb{Z}^{d}$ indexed by a critical geometric Galton-Watson tree conditioned to survive is recurrent if and only if $d \leq 4$.

We establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are based on rather intuitive notions of local expansion…

Let $G=(V,E)$ be a $d$-regular graph on $n$ vertices and let $\mu_0$ be a probability measure on $V$. The act of moving to a randomly chosen neighbor leads to a sequence of probability measures supported on $V$ given by $\mu_{k+1} = A…

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…

In this paper, we study the random walk on a supercritical branching process with an uncountable and unbounded set of types supported on the $d$-regular tree $\mathbb{T}_d$ ($d\geq 3$), namely the cluster $\mathcal{C}_\circ^h$ of the root…

We explore the survival function for percolation on Galton-Watson trees. Letting $g(T,p)$ represent the probability a tree $T$ survives Bernoulli percolation with parameter $p$, we establish several results about the behavior of the random…

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…

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…

We consider a Galton--Watson tree with offspring distribution $\nu$ of finite mean. The uniform measure on the boundary of the tree is obtained by putting mass $1$ on each vertex of the $n$-th generation and taking the limit $n\to \infty$.…

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…

Random walks constitute a fundamental mechanism for a large set of dynamics taking place on networks. In this article, we study random walks on weighted networks with an arbitrary degree distribution, where the weight of an edge between two…

We consider the range $R^{(n)}$, the tree made up of visited vertices by a diffusive null-recurrent randomly biased walk $\mathbb{X}$ on a Galton-Watson tree $\mathbb{T}$ up to the $n$-th return time to its root and we consider the…

We define decorated $\alpha$-stable trees which are informally obtained from an $\alpha$-stable tree by blowing up its branchpoints into random metric spaces. This generalizes the $\alpha$-stable looptrees of Curien and Kortchemski, where…

We establish scaling limits for the random walk whose state space is the range of a simple random walk on the four-dimensional integer lattice. These concern the asymptotic behaviour of the graph distance from the origin and the spatial…

A n-step Pearson-Gamma random walk in Rd starts at the origin and consists of n independent steps with gamma distributed lengths and uniform orientations. The gamma distribution of each step length has a shape parameter q>0. Constrained…

We study locally interacting processes in discrete time, often called probabilistic cellular automata, indexed by locally finite graphs. For infinite regular trees and certain generalized Galton-Watson trees, we show that the marginal…