English
Related papers

Related papers: Barrier estimates for a critical Galton--Watson pr…

200 papers

In this paper, we study the time required for a {\lambda}-biased ({\lambda}>1) walk to visit all the vertices of a supercritical Galton-Watson tree up to generation n. Inspired by the extremal landscape approach in [Cortines, Louidor,…

Probability · Mathematics 2020-03-18 Tianyi Bai

We compute the second order correction for the cover time of the binary tree of depth $n$ by (continuous-time) random walk, and show that with probability approaching 1 as $n$ increases, $\sqrt{\tau_{\mathrm{cov}}}=\sqrt{|E|}[\sqrt{2\log…

Probability · Mathematics 2011-04-05 Jian Ding , Ofer Zeitouni

We study the scaling limits of looptrees associated with Bienaym\'e--Galton--Watson (BGW) trees, that are obtained by replacing every vertex of the tree by a "cycle" whose size is its degree. First, we consider BGW trees whose offspring…

Probability · Mathematics 2018-06-13 Igor Kortchemski , Loïc Richier

We study a linear-fractional Bienaym\'e-Galton-Watson process with a general type space. The corresponding tree contour process is described by an alternating random walk with the downward jumps having a geometric distribution. This leads…

Probability · Mathematics 2016-03-07 Alexey Lindo , Serik Sagitov

Upon almost-every realisation of the Brownian continuum random tree (CRT), it is possible to define a canonical diffusion process or `Brownian motion'. The main result of this article establishes that the cover time of the Brownian motion…

Probability · Mathematics 2025-09-30 George Andriopoulos , David A. Croydon , Vlad Margarint , Laurent Menard

Consider the edge-deletion process in which the edges of some finite tree T are removed one after the other in the uniform random order. Roughly speaking, the cut-tree then describes the genealogy of connected components appearing in this…

Probability · Mathematics 2013-07-23 Jean Bertoin , Grégory Miermont

We consider a continuous time random walk on the rooted binary tree of depth $n$ with all transition rates equal to one and study its cover time, namely the time until all vertices of the tree have been visited. We prove that, normalized by…

Probability · Mathematics 2019-01-23 Aser Cortines , Oren Louidor , Santiago Saglietti

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…

Probability · Mathematics 2012-03-20 David A. Croydon , Alexander Fribergh , Takashi Kumagai

In the first part of this paper we give easy and intuitive proofs for the small value probabilities of the martingale limit of a supercritical Galton-Watson process in both the Schr\"oder and the B\"ottcher case. These results are…

Probability · Mathematics 2007-10-19 Peter Morters , Marcel Ortgiese

Under the assumption that sequences of graphs equipped with resistances, associated measures, walks and local times converge in a suitable Gromov-Hausdorff topology, we establish asymptotic bounds on the distribution of the…

Probability · Mathematics 2025-09-30 George Andriopoulos

Aldous, Evans and Pitman (1998) studied the behavior of the fragmentation process derived from deleting the edges of a uniform random tree on $n$ labelled vertices. In particular, they showed that, after proper rescaling, the above…

Probability · Mathematics 2025-09-03 Gabriel Berzunza Ojeda , Cecilia Holmgren

We consider branching random walks and contact processes on infinite, connected, locally finite graphs whose reproduction and infectivity rates across edges are inversely proportional to vertex degree. We show that when the ambient graph is…

Probability · Mathematics 2014-04-16 Wei Su

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

The $\lambda$-biased random walk on a binary tree of depth $n$ is the continuous-time Markov chain that has unit mean holding times and, when at a vertex other than the root or a leaf of the tree in question, has a probability of jumping to…

Probability · Mathematics 2025-03-05 David A. Croydon

We study the exploration (or height) process of a continuous time non-binary Galton-Watson random tree, in the subcritical, critical and supercritical cases. Thus we consider the branching process in continuous time (Z_{t})_{t\geq 0}, which…

Probability · Mathematics 2016-02-08 Ibrahima Dramé , Etienne Pardoux , Ahmadou Bamba Sow

We consider a continuous time simple random walk on a subset of the square lattice with wired boundary conditions: the walk transitions at unit edge rate on the graph obtained from the lattice closure of the subset by contracting the…

Probability · Mathematics 2024-06-18 Oren Louidor , Santiago Saglietti

We prove that the speed of a biased random walk on a supercritical Galton-Watson tree conditioned to survive is analytic within the ballistic regime. This extends the previous work arXiv:1906.07913 in which it was shown that the speed is…

Probability · Mathematics 2020-10-06 Adam Bowditch , Yuki Tokushige

In this work, we study asymptotics of the genealogy of Galton--Watson processes conditioned on the total progeny. We consider a fixed, aperiodic and critical offspring distribution such that the rescaled Galton--Watson processes converges…

Probability · Mathematics 2007-05-23 Thomas Duquesne

We revisit the problem of Brownian diffusion with drift in order to study finite-size effects in the geometric Galton-Watson branching process. This is possible because of an exact mapping between one-dimensional random walks and geometric…

Statistical Mechanics · Physics 2018-07-04 Alvaro Corral , Rosalba Garcia-Millan , Nicholas R. Moloney , Francesc Font-Clos

We study the cover time $\tau_{\mathrm{cov}}$ by (continuous-time) random walk on the 2D box of side length $n$ with wired boundary or on the 2D torus, and show that in both cases with probability approaching 1 as $n$ increases,…

Probability · Mathematics 2012-06-07 Jian Ding
‹ Prev 1 2 3 10 Next ›