English
Related papers

Related papers: Invariance and attraction properties of Galton-Wat…

200 papers

Invariant Galton-Watson (IGW) tree measures is a one-parameter family of critical Galton-Watson measures invariant with respect to a large class of tree reduction operations. Such operations include the generalized dynamical pruning (also…

Probability · Mathematics 2022-01-07 Yevgeniy Kovchegov , Guochen Xu , Ilya Zaliapin

We are interested in the asymptotic behavior of critical Galton-Watson trees whose offspring distribution may have infinite variance, which are conditioned on having a large fixed number of leaves. We first find an asymptotic estimate for…

Probability · Mathematics 2014-11-14 Igor Kortchemski

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

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

Probability · Mathematics 2018-08-14 Yevgeniy Kovchegov , Ilya Zaliapin

We study the typical behavior of the harmonic measure 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]$. Let $\mu_n$ denote the hitting…

Probability · Mathematics 2017-02-28 Shen Lin

In this work, we study asymptotics of multitype Galton-Watson trees with finitely many types. We consider critical and irreducible offspring distributions such that they belong to the domain of attraction of a stable law, where the…

Probability · Mathematics 2016-07-20 Gabriel Berzunza

We consider infinite Galton-Watson trees without leaves together with i.i.d.~random variables called marks on each of their vertices. We define a class of flow rules on marked Galton-Watson trees for which we are able, under some algebraic…

Probability · Mathematics 2018-05-07 Pierre Rousselin

This work proves new probability bounds relating to the height, width, and size of Galton-Watson trees. For example, if $T$ is any Galton-Watson tree, and $H$, $W$, and $|T|$ are the height, width, and size of $T$, respectively, then $H/W$…

Probability · Mathematics 2017-04-03 Louigi Addario-Berry

We give a simple new proof of a theorem of Duquesne, stating that the properly rescaled contour function of a critical aperiodic Galton-Watson tree, whose offspring distribution is in the domain of attraction of a stable law of index…

Probability · Mathematics 2014-11-14 Igor Kortchemski

The Horton and Tokunaga branching laws provide a convenient framework for studying self-similarity in random trees. The Horton self-similarity is a weaker property that addresses the principal branching in a tree; it is a counterpart of the…

Probability · Mathematics 2015-05-27 Ilya Zaliapin , Yevgeniy Kovchegov

We establish a variety of properties of the discrete time simple random walk on a Galton-Watson tree conditioned to survive when the offspring distribution, $Z$ say, is in the domain of attraction of a stable law with index…

Probability · Mathematics 2012-10-24 David A. Croydon , Takashi Kumagai

Pruning processes $(\mathcal{F}(\theta),\theta\geq 0)$ have been studied separately for Galton-Watson trees and for L\'evy trees/forests. We establish here a limit theory that strongly connects the two studies. This solves an open problem…

Probability · Mathematics 2014-09-04 Hui He , Matthias Winkel

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$,…

Probability · Mathematics 2025-06-04 Anna M. Brandenberger , Luc Devroye , Tommy Reddad

We consider Galton-Watson trees associated with a critical offspring distribution and conditioned to have exactly $n$ vertices. These trees are embedded in the real line by affecting spatial positions to the vertices, in such a way that the…

Probability · Mathematics 2007-05-23 Jean-Francois Le Gall

We study the typical behavior of the harmonic measure of balls in large critical Galton-Watson trees whose offspring distribution has finite variance. The harmonic measure considered here refers to the hitting distribution of height $n$ by…

Probability · Mathematics 2016-03-04 Shen Lin

We study survival properties of inhomogeneous Galton-Watson processes. We determine the so-called branching number (which is the reciprocal of the critical value for percolation) for these random trees (conditioned on being infinite), which…

Probability · Mathematics 2011-12-22 Erik Broman , Ronald Meester

We consider critical percolation on a supercritical Galton-Watson tree. We show that, when the offspring distribution is in the domain of attraction of an $\alpha$-stable law for some $\alpha \in (1,2)$, or has finite variance, several…

Probability · Mathematics 2024-07-24 Eleanor Archer , Quirin Vogel

We consider invasion percolation on Galton-Watson trees. On almost every Galton-Watson tree, the invasion cluster almost surely contains only one infinite path. This means that for almost every Galton-Watson tree, invasion percolation…

Probability · Mathematics 2018-02-06 Marcus Michelen , Robin Pemantle , Josh Rosenberg

Self-similarity of random trees is related to the operation of pruning. Pruning $R$ cuts the leaves and their parental edges and removes the resulting chains of degree-two nodes from a finite tree. A Horton-Strahler order of a vertex $v$…

Discrete Mathematics · Computer Science 2016-06-22 Yevgeniy Kovchegov , Ilya Zaliapin
‹ Prev 1 2 3 10 Next ›