中文
相关论文

相关论文: An introduction to Galton-Watson trees and their l…

200 篇论文

We consider a fragmentation of discrete trees where the internal vertices are deleted independently at a rate proportional to their degree. Informally, the associated cut-tree represents the genealogy of the nested connected components…

概率论 · 数学 2016-08-11 Daphné Dieuleveut

Branching processes $(Z_n)_{n \ge 0}$ in a varying environment generalize the Galton-Watson process, in that they allow time-dependence of the offspring distribution. Our main results concern general criteria for a.s. extinction,…

概率论 · 数学 2019-11-11 Götz Kersting

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…

概率论 · 数学 2014-11-14 Igor Kortchemski

We are interested in the genealogical structure of alleles for a Bienaym\'e-Galton-Watson branching process with neutral mutations (infinite alleles model), in the situation where the initial population is large and the mutation rate small.…

概率论 · 数学 2009-06-25 Jean Bertoin

We show that the local limit of unicellular maps whose genus is proportional to the number of edges is a supercritical geometric Galton-Watson tree conditioned to survive. The proof relies on enumeration results obtained via the recent…

概率论 · 数学 2015-05-20 Omer Angel , Guillaume Chapuy , Nicolas Curien , Gourab Ray

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…

概率论 · 数学 2015-03-10 Xin He

We study $\lambda$-biased branching random walks on Bienaym\'e--Galton--Watson trees in discrete time. We consider the maximal displacement at time $n$, $\max_{\vert u \vert =n} \vert X(u) \vert$, and show that it almost surely grows at a…

概率论 · 数学 2026-03-02 Julien Berestycki , Nina Gantert , David Geldbach , Quan Shi

We present a new pruning procedure on discrete trees by adding marks on the nodes of trees. This procedure allows us to construct and study a tree-valued Markov process $\{{\cal G}(u)\}$ by pruning Galton-Watson trees and an analogous…

概率论 · 数学 2012-06-28 Romain Abraham , Jean-Francois Delmas , Hui He

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…

概率论 · 数学 2013-09-24 Douglas Rizzolo

We are interested in the structure of large Bienaym\'e-Galton-Watson random trees whose offspring distribution is critical and falls within the domain of attraction of a stable law of index $\alpha=1$. In stark contrast to the case $\alpha…

概率论 · 数学 2018-11-22 Igor Kortchemski , Loïc Richier

We study the evolution of a particle system whose genealogy is given by a supercritical continuous time Galton--Watson tree. The particles move independently according to a Markov process and when a branching event occurs, the offspring…

We consider the motion of a particle on a Galton Watson tree, when the probabilities of jumping from a vertex to any one of its neighbours is determined by a random process. Given the tree, positive weights are assigned to the edges in such…

概率论 · 数学 2016-05-02 A. D. Barbour , A. Collevecchio

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…

概率论 · 数学 2015-08-11 Airam Blancas Benítez , Víctor Rivero

We study $S(\mathcal T_{n})$, the number of subtrees in a conditioned Galton--Watson tree of size $n$. With two very different methods, we show that $\log(S(\mathcal T_{n}))$ has a Central Limit Law and that the moments of $S(\mathcal…

组合数学 · 数学 2020-04-21 Xing Shi Cai , Svante Janson

We give an invariance principle for very general additive functionals of conditioned Bienaym{\'e}-Galton-Watson trees in the global regime when the offspring distribution lies in the domain of attraction of a stable distribution, the limit…

概率论 · 数学 2020-09-18 Romain Abraham , Jean-François Delmas , Michel Nassif

In a Bienaym\'{e}-Galton-Watson process for which there is a positiveprobability for individuals of having no offspring, there is a subtlebalance and dependence between the sterile nodes (the dead nodes or leaves)and the prolific ones (the…

概率论 · 数学 2023-02-17 Thierry Huillet , Servet Martinez

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…

概率论 · 数学 2020-11-23 Tabea Glatzel , Jan Nagel

We study biased random walk on subcritical and supercritical Galton-Watson trees conditioned to survive in the transient, sub-ballistic regime. By considering offspring laws with infinite variance, we extend previously known results for the…

概率论 · 数学 2016-05-18 Adam Bowditch

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…

概率论 · 数学 2014-09-08 Louigi Addario-Berry , Nicolas Broutin , Cecilia Holmgren

In this note, we prove a quenched functional central limit theorem for a biased random walk on a supercritical Galton-Watson tree with leaves. This extends a result of Peres and Zeitouni (2008) where the case without leaves is considered. A…

概率论 · 数学 2017-01-17 Adam Bowditch