English
Related papers

Related papers: Non-fringe subtrees in conditioned Galton--Watson …

200 papers

In this paper we consider random walks on Galton-Watson trees with random conductances. On these trees, the distance of the walker to the root satisfies a law of large numbers with limit the effective velocity, or speed of the walk. We…

Probability · Mathematics 2020-11-23 Tabea Glatzel , Jan Nagel

We prove local convergence results of rerooted conditioned multi-type Galton--Watson trees. The limit objects are multitype variants of the random sin-tree constructed by Aldous (1991), and differ according to which types recur infinitely…

Probability · Mathematics 2021-02-24 Benedikt Stufler

In this note we consider both the local maximal out-degree and the global maximal out-degree of Galton-Watson trees. In particular, we show that the tail of any local maximal out-degree and that of the offspring distribution are…

Probability · Mathematics 2015-03-10 Xin He

Let $T\_n$ denote the set of unrooted labeled trees of size $n$ and let $T\_n$ be a particular (finite, unlabeled) tree. Assuming that every tree of $T\_n$ is equally likely, it is shown that the limiting distribution as $n$ goes to…

Discrete Mathematics · Computer Science 2016-08-16 Frédéric Chyzak , Michael Drmota , Thomas Klausner , Gerard Kok

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

We show that an infinite Galton-Watson tree, conditioned on its martingale limit being smaller than $\eps$, converges as $\eps\downarrow 0$ in law to the regular $\mu$-ary tree, where $\mu$ is the essential minimum of the offspring…

Probability · Mathematics 2012-04-17 Nathanael Berestycki , Peter Morters , Nadia Sidorova

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 this paper we study several aspects of the growth of a supercritical Galton-Watson process {Z_n:n\ge1}, and bring out some criticality phenomena determined by the Schroder constant. We develop the local limit theory of Z_n, that is, the…

Probability · Mathematics 2007-05-23 Peter E. Ney , Anand N. Vidyashankar

As a model of trapping by biased motion in random structure, we study the time taken for a biased random walk to return to the root of a subcritical Galton-Watson tree. We do so for trees in which these biases are randomly chosen,…

Probability · Mathematics 2011-01-24 Gerard Ben Arous , Alan Hammond

The Horton-Strahler number, also known as the register function, provides a tool for quantifying the branching complexity of a rooted tree. We consider the Horton-Strahler number of critical Galton-Watson trees conditioned to have size $n$…

Probability · Mathematics 2025-10-22 Robin Khanfir

We prove a law of large numbers for the range of rotor walks with random initial configuration on regular trees and on Galton-Watson trees. More precisely, we show that on the classes of trees under consideration, even in the case when the…

Probability · Mathematics 2019-04-03 Wilfried Huss , Ecaterina Sava-Huss

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…

Probability · Mathematics 2011-12-19 Pierre Andreoletti , Pierre Debs

Given a finite typed rooted tree $T$ with $n$ vertices, the {\em empirical subtree measure} is the uniform measure on the $n$ typed subtrees of $T$ formed by taking all descendants of a single vertex. We prove a large deviation principle in…

Probability · Mathematics 2007-05-23 Amir Dembo , Peter Morters , Scott Sheffield

We consider a branching random walk (BRW) taking its values in the $\mathtt{b}$-ary rooted tree $\mathbb W_{ \mathtt{b}}$ (i.e. the set of finite words written in the alphabet $\{ 1, \ldots, \mathtt{b} \}$, with $\mathtt{b}\! \geq \! 2$).…

Probability · Mathematics 2022-01-24 Thomas Duquesne , Robin Khanfir , Shen Lin , Niccolo Torri

In this paper we investigate an extremal problem on binary phylogenetic trees. Given two such trees $T_1$ and $T_2$, both with leaf-set ${1,2,...,n}$, we are interested in the size of the largest subset $S \subseteq {1,2,...,n}$ of leaves…

Combinatorics · Mathematics 2013-02-21 Daniel M. Martin , Bhalchandra D. Thatte

This paper extends the study of fringe trees in random plane trees with a given degree statistic. While previous work established the asymptotic normality of the count of fringe trees isomorphic to a fixed tree, we investigate the case…

Probability · Mathematics 2026-04-08 Gabriel Berzunza Ojeda , Cecilia Holmgren , Svante Janson

We provide simplified proofs for the asymptotic distribution of the number of cuts required to cut down a Galton-Watson tree with critical, finite-variance offspring distribution, conditioned to have total progeny $n$. Our proof is based on…

Probability · Mathematics 2014-09-08 Louigi Addario-Berry , Nicolas Broutin , Cecilia Holmgren

We study random trees which are invariant in law under the operation of contracting each edge independently with probability $p\in(0,1)$. We show that all such trees can be constructed through Poissonian sampling from a certain class of…

Probability · Mathematics 2018-06-20 Olivier Hénard , Pascal Maillard

We show that an infinite Galton-Watson tree, conditioned on its martingale limit being smaller than $\eps$, agrees up to generation $K$ with a regular $\mu$-ary tree, where $\mu$ is the essential minimum of the offspring distribution and…

Probability · Mathematics 2012-04-16 Nathanael Berestycki , Nina Gantert , Peter Morters , Nadia Sidorova

We consider additive functionals $X_n(\phi)$ with small toll functions on split trees and a generalization of split trees, which we call fractional split trees, where the split vector does not need to sum up to 1. These additive functionals…

Probability · Mathematics 2026-03-24 Cecilia Holmgren , Jasper Ischebeck , Svante Janson
‹ Prev 1 4 5 6 7 8 10 Next ›