Vertices with fixed outdegrees in large Galton-Watson trees

DOI10.1214/20-EJP465zbMATH Open1447.05183arXiv1812.07365MaRDI QIDQ782806FDOQ782806

Authors: Paul Thévenin 

Publication date: 29 July 2020

Published in: Electronic Journal of Probability (Search for Journal in Brave)

Abstract: We are interested in nodes with fixed outdegrees in large conditioned Galton--Watson trees. We first study the scaling limits of processes coding the evolution of the number of such nodes in different explorations of the tree (lexicographical order and contour order) starting from the root. We give necessary and sufficient conditions for the limiting processes to be centered, thus measuring the linearity defect of the evolution of the number of nodes with fixed outdegrees. This extends results by Labarbe & Marckert in the case of the contour-ordered counting process of leaves in uniform plane trees. Then, we extend results obtained by Janson concerning the asymptotic normality of the number of nodes with fixed outdegrees.

Full work available at URL: https://arxiv.org/abs/1812.07365

Recommendations

• On the number of vertices with a given degree in a Galton-Watson tree
• A note on the maximal outdegrees of Galton-Watson trees
• Joint distribution of the number of vertices with given different outdegrees in Galton-Watson forest
• scientific article; zbMATH DE number 140084
• scientific article; zbMATH DE number 68919
• Scaling limits of Markov branching trees and Galton-Watson trees conditioned on the number of vertices with out-degree in a given set
• scientific article; zbMATH DE number 125478
• On the maximum size of a tree in the Galton-Watson forest with a bounded number of vertices
• Vertices of degree \(k\) in random unlabeled trees
• Vertices of degree \(k\) in random unlabeled trees

zbMATH Keywords

probabilityrandom treesGalton-Watsonvertices degrees

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Random walks on graphs (05C81) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Cites Work

• Title not available (Why is that?)
• A bivariate stable characterization and domains of attraction
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Conceptual proofs of \(L\log L\) criteria for mean behavior of branching processes
• Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation
• Title not available (Why is that?)
• The depth first processes of Galton-Watson trees converge to the same Brownian excursion
• Random trees and applications
• The continuum random tree. III
• Title not available (Why is that?)
• The continuum random tree. I
• Arbres et processus de Galton-Watson. (Trees and Galton-Watson processes)
• Subdiffusive behavior of random walk on a random cluster
• Branching processes in Lévy processes: The exploration process
• A limit theorem for the contour process of conditioned Galton-Watson trees
• On the number of vertices with a given degree in a Galton-Watson tree
• A relation between Brownian bridge and Brownian excursion
• Random stable laminations of the disk
• Invariance principles for Galton-Watson trees conditioned on the number of leaves
• A bivariate local limit theorem
• Title not available (Why is that?)
• Conditional distribution of heavy tailed random variables on large deviations of their sum
• Asymptotics of Bernoulli random walks, bridges, excursions and meanders with a given number of peaks
• Scaling limits of Markov branching trees and Galton-Watson trees conditioned on the number of vertices with out-degree in a given set
• A probabilistic approach to block sizes in random maps
• Limit theorems for conditioned non-generic Galton-Watson trees
• Local limits of conditioned Galton-Watson trees: the condensation case
• An elementary proof of Hawkes's conjecture on Galton-Watson trees.
• Matrix normalization of sums of random vectors in the domain of attraction of the multivariate normal
• Local limits of conditioned Galton-Watson trees: the infinite spine case
• Ladder variables, internal structure of Galton–Watson trees and finite branching random walks

Cited In (9)

• Scaling limits of slim and fat trees
• On the maximal offspring in a subcritical branching process
• On the number of vertices with a given degree in a Galton-Watson tree
• Points and lines configurations for perpendicular bisectors of convex cyclic polygons
• Random stable-type minimal factorizations of the \(n\)-cycle
• On scaling limits of random trees and maps with a prescribed degree sequence
• Scaling limits of random looptrees and bipartite plane maps with prescribed large faces
• A note on the maximal outdegrees of Galton-Watson trees
• Joint distribution of the number of vertices with given different outdegrees in Galton-Watson forest

This page was built for publication: Vertices with fixed outdegrees in large Galton-Watson trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q782806)