Author:
Abraham Romain,Bouaziz Aymen,Delmas Jean-François
Abstract
AbstractWe consider a marking procedure of the vertices of a tree where each vertex is marked independently from the others with a probability that depends only on its out-degree. We prove that a critical Galton–Watson tree conditioned on having a large number of marked vertices converges in distribution to the associated size-biased tree. We then apply this result to give the limit in distribution of a critical Galton–Watson tree conditioned on having a large number of protected nodes.
Publisher
Cambridge University Press (CUP)
Subject
Statistics, Probability and Uncertainty,General Mathematics,Statistics and Probability
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Penalization of Galton–Watson Trees with Marked Vertices;Journal of Theoretical Probability;2024-08-12
2. Local convergence of critical Galton–Watson trees;Journal of Applied Probability;2023-11-30
3. Local limits of large Galton–Watson trees rerooted at a random vertex;Annales de l'Institut Henri Poincaré, Probabilités et Statistiques;2019-02-01