English
Related papers

Related papers: Branching random walks conditioned on rarely survi…

200 papers

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.…

Probability · Mathematics 2015-06-12 Behzad Mehrdad , Sanchayan Sen , Lingjiong Zhu

Let $\mathcal{T}$ denote a Galton--Watson tree with offspring distribution $\xi$ satisfying $\mathbb{E}(\xi) = 1$, and let $\mathcal{T}_n$ be the Galton--Watson tree conditioned to have exactly $n$ nodes. We show that, under a mild moment…

Probability · Mathematics 2026-03-10 Fameno Rakotoniaina , Dimbinaina Ralaivaosaona

This paper is a collection of recent results on discrete-time and continuous-time branching random walks. Some results are new and others are known. Many aspects of this theory are considered: local, global and strong local survival, the…

Probability · Mathematics 2018-05-07 Daniela Bertacchi , Fabio Zucca

We study $I(T)$, the number of inversions in a tree $T$ with its vertices labeled uniformly at random, which is a generalization of inversions in permutations. We first show that the cumulants of $I(T)$ have explicit formulas involving the…

Probability · Mathematics 2020-04-21 Xing Shi Cai , Cecilia Holmgren , Svante Janson , Tony Johansson , Fiona Skerman

Looptrees have recently arisen in the study of critical percolation on the uniform infinite planar triangulation. Here we consider random infinite looptrees defined as the local limit of the looptree associated with a critical…

Probability · Mathematics 2015-06-18 Jakob E. Björnberg , Sigurdur Örn Stefánsson

Under minimal condition, we prove the local convergence of a critical multi-type Galton-Watson tree conditioned on having a large total progeny by types towards a multi-type Kesten's tree. We obtain the result by generalizing Neveu's strong…

Probability · Mathematics 2016-09-28 Romain Abraham , Jean-François Delmas , Hongsong Guo

Let $\{S_n,n\geq 0\} $ be a random walk whose increments belong without centering to the domain of attraction of an $\alpha$-stable law $\{Y_t,t\geq 0\}$, i.e. $S_{nt}/a_n\Rightarrow Y_t,t\geq 0,$ for some scaling constants $a_n$. Assuming…

Probability · Mathematics 2023-03-15 Congzao Dong , Elena Dyakonova , Vladimir Vatutin

We study an extension of the so-called defective Galton-Watson processes obtained by allowing the offspring distribution to change over the generations. Thus, in these processes, the individuals reproduce independently of the others and in…

Probability · Mathematics 2021-10-01 Götz Kersting , Carmen Minuesa

We investigate subcritical Galton-Watson branching processes with immigration in a random environment. Using Goldie's implicit renewal theory we show that under general Cram\'er condition the stationary distribution has a power law tail. We…

Probability · Mathematics 2020-02-04 Bojan Basrak , Peter Kevei

We consider a branching random walk in time-inhomogeneous random environment, in which all particles at generation $k$ branch into the same random number of particles $\mathcal{L}_{k+1}\ge 2$, where the $\mathcal{L}_k$, $k\in\mathbb{N}$,…

Probability · Mathematics 2025-05-20 Xaver Kriechbaum

We study a generalized branching random walk where particles breed at a rate which depends on the number of neighboring particles. Under general assumptions on the breeding rates we prove the existence of a phase where the population…

Probability · Mathematics 2009-09-29 Daniela Bertacchi , Gustavo Posta , Fabio Zucca

We are interested in the randomly biased random walk on the supercritical Galton--Watson tree. Our attention is focused on a slow regime when the biased random walk $(X_n)$ is null recurrent, making a maximal displacement of order of…

Probability · Mathematics 2015-09-29 Yueyun Hu , Zhan Shi

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…

Probability · Mathematics 2015-01-14 Masato Shinoda , Elmar Teufl , Stephan Wagner

We consider a branching random walk on $\mathbb{R}$ with a stationary and ergodic environment $\xi=(\xi_n)$ indexed by time $n\in\mathbb{N}$. Let $Z_n$ be the counting measure of particles of generation $n$. For the case where the…

Probability · Mathematics 2014-07-30 Chunmao Huang , Quansheng Liu

We consider a particular Branching Random Walk in Random Environment (BRWRE) on $\sN_0$ started with one particle at the origin. Particles reproduce according to an offspring distribution (which depends on the location) and move either one…

Probability · Mathematics 2009-12-01 Christian Bartsch , Nina Gantert , Michael Kochler

We study the fundamental question of how likely it is that two randomly chosen trees are isomorphic to each other for different models of random trees. We show that the probability decays exponentially for rooted labeled trees as well as…

Probability · Mathematics 2023-04-11 Christoffer Olsson

In this paper we study the genealogical structure of a Galton-Watson process with neutral mutations, where the initial population is large and mutation rate is small \cite{B2}. Namely, we extend in two directions the results obtained in…

Probability · Mathematics 2015-08-11 Airam Blancas Benítez , Víctor Rivero

We study the limiting behavior of a Bienayme-Galton-Watson tree conditioned to have a large number of vertices and either a fixed number of leaves or a fixed number of internal nodes. The first biconditioning gives a universal result with…

Probability · Mathematics 2026-02-06 Vanessa Dan

We prove that the speed of $\lambda$-biased random walks on a supercritical Galton-Watson tree without leaves is differentiable when $\lambda\in(0,1)$, and give an expression of the derivative using a certain 2-dimensional Gaussian random…

Probability · Mathematics 2019-06-21 Yuki Tokushige

We consider a conditioned Galton-Watson tree and prove an estimate of the number of pairs of vertices with a given distance, or, equivalently, the number of paths of a given length. We give two proofs of this result, one probabilistic and…

Probability · Mathematics 2008-12-18 Luc Devroye , Svante Janson