English
Related papers

Related papers: Random walks on Galton-Watson trees with random co…

200 papers

We introduce the notion of a hereditary property for rooted real trees and we also consider reduction of trees by a given hereditary property. Leaf-length erasure, also called trimming, is included as a special case of hereditary reduction.…

Probability · Mathematics 2012-11-12 Thomas Duquesne , Matthias Winkel

We study rooted planar random trees with a probability distribution which is proportional to a product of weight factors $w_n$ associated to the vertices of the tree and depending only on their individual degrees $n$. We focus on the case…

Mathematical Physics · Physics 2015-05-27 Svante Janson , Thordur Jonsson , Sigurdur Orn Stefansson

We show that the transience or recurrence of a random walk in certain random environments on an arbitrary infinite locally finite tree is determined by the branching number of the tree, which is a measure of the average number of branches…

Probability · Mathematics 2007-05-23 Robin Pemantle , Russell Lyons

Let $R_n$ be the range of a critical branching random walk with $n$ particles on $\mathbb Z^d$, which is the set of sites visited by a random walk indexed by a critical Galton--Watson tree conditioned on having exactly $n$ vertices. For…

Probability · Mathematics 2023-07-27 Tianyi Bai , Yueyun Hu

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

We study properties of the harmonic measure of balls in large critical Galton-Watson trees whose offspring distribution is in the domain of attraction of a stable distribution with index $\alpha\in (1,2]$. Here the harmonic measure refers…

Probability · Mathematics 2014-05-08 Shen Lin

We develop a technique that provides a lower bound on the speed of transient random walk in a random environment on regular trees. A refinement of this technique yields upper bounds on the first regeneration level and regeneration time. In…

Probability · Mathematics 2009-11-03 Andrea Collevecchio , Tom Schmitz

We consider random walks on the infinite cluster of a conditional bond percolation model on the infinite ladder graph. In a companion paper, we have shown that if the random walk is pulled to the right by a positive bias $\lambda > 0$, then…

Probability · Mathematics 2019-06-26 Nina Gantert , Matthias Meiners , Sebastian Müller

Let $R_n=\max_{0\leq j\leq n}S_j-S_n$ be a random walk $S_n$ reflected in its maximum. Except in the trivial case when $P(X\ge0)=1$, $R_n$ will pass over a horizontal boundary of any height in a finite time, with probability 1. We extend…

Probability · Mathematics 2009-09-29 Ron Doney , Ross Maller

We consider biased random walks in a one-dimensional percolation model. This model goes back to Axelson-Fisk and H\"aggstr\"om and exhibits the same phase transition as biased random walk on the infinite cluster of supercritical Bernoulli…

Probability · Mathematics 2018-08-10 Jan-Erik Lübbers , Matthias Meiners

We generalize recent results of Haas and Miermont to obtain scaling limits of Markov branching trees whose size is specified by the number of nodes whose out-degree lies in a given set. We then show that this implies that the scaling limit…

Probability · Mathematics 2013-09-24 Douglas Rizzolo

Motivated by online recommendation systems, we study a family of random forests. The vertices of the forest are labeled by integers. Each non-positive integer $i\le 0$ is the root of a tree. Vertices labeled by positive integers $n \ge 1$…

Probability · Mathematics 2024-02-27 Nicolas Broutin , Luc Devroye , Gabor Lugosi , Roberto Imbuzeiro Oliveira

A class of branching processes in varying environments is exhibited which become extinct almost surely even though the means M_n grow fast enough so that sum M_n^{-1} is finite. In fact, such a process is constructed for every offspring…

Probability · Mathematics 2007-05-23 Robin Pemantle

We consider a model for random walks on random environments (RWRE) with random subset of the d-dimensional Euclidean lattice as the vertices, and uniform transition probabilities on 2d points (two "coordinate nearest points" in each of the…

Probability · Mathematics 2011-10-27 Ron Rosenthal

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…

Probability · Mathematics 2011-01-20 Götz Kersting

We prove an invariance principle for the bridge of a random walk conditioned to stay positive, when the random walk is in the domain of attraction of a stable law, both in the discrete and in the absolutely continuous setting. This includes…

Probability · Mathematics 2012-10-10 Francesco Caravenna , Loïc Chaumont

We consider two dimensional random walks conditioned to stay in the positive quadrant. Assuming that the increments of the walk have finite second moments and that the drift vector is co-oriented with one of two axes, we construct positive…

Probability · Mathematics 2026-02-10 Tuan Anh Nguyen , Vitali Wachtel

In recent years, there has been an interest in deriving certain important probabilistic results as consequences of deterministic ones; see for instance \cite{beig} and \cite{acc}. In this work, we continue on this path by deducing a well…

Probability · Mathematics 2020-03-02 Maher Boudabra , Greg Markowsky

We consider Bienaym\'e-Galton-Watson trees in random environment, where each generation $k$ is attributed a random offspring distribution $\mu_k$, and $(\mu_k)_{k\geq 0}$ is a sequence of independent and identically distributed random…

Probability · Mathematics 2023-01-30 Guillaume Conchon--Kerjan , Daniel Kious , Cécile Mailler

We are interested in nodes with fixed outdegrees in large conditioned Galton--Watson trees. We first study the scaling limits of processes coding the evolution of the number of such nodes in different explorations of the tree…

Probability · Mathematics 2020-02-27 Paul Thévenin
‹ Prev 1 8 9 10 Next ›