Sub-Gaussian tail bounds for the width and height of conditioned Galton-Watson trees

From MaRDI portal
Publication:1951700

DOI10.1214/12-AOP758zbMath1278.60128arXiv1011.4121WikidataQ101203337 ScholiaQ101203337MaRDI QIDQ1951700

Svante Janson, Louigi Addario-Berry, Luc P. Devroye

Publication date: 24 May 2013

Published in: The Annals of Probability (Search for Journal in Brave)

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




Related Items (30)

Sub-exponential tail bounds for conditioned stable Bienaymé-Galton-Watson treesThe distance profile of rooted and unrooted simply generated treesTail bounds for the height and width of a random tree with a given degree sequenceRandom enriched trees with applications to random graphsScaling limits of random Pólya treesScaling limit for the ant in a simple high-dimensional labyrinthFinding paths in sparse random graphs requires many queriesA branching process approach to level‐k phylogenetic networksOn breadth‐first constructions of scaling limits of random graphs and random unicellular mapsSlightly supercritical percolation on non‐amenable graphs I: The distribution of finite clustersLimits of random tree-like discrete structuresThe Foata-Fuchs proof of Cayley's formula, and its probabilistic usesA branching process with coalescence to model random phylogenetic networksGrowing random graphs with a preferential attachment structureLarge unicellular maps in high genusAsymptotic behaviour of the first positions of uniform parking functionsLong paths in first passage percolation on the complete graph. I: Local PWIT dynamicsAutomatic choice of the threshold of a grain filter via Galton-Watson trees: application to granite cracks detectionSimply generated trees, conditioned Galton-Watson trees, random allocations and condensationHeavy subtrees of Galton-Watson trees with an application to Apollonian networksMost trees are short and fatAsymptotics of trees with a prescribed degree sequence and applicationsAsymptotic normality of fringe subtrees and additive functionals in conditioned Galton-Watson treesSpeeding up non-Markovian first-passage percolation with a few extra edgesАсимптотические свойства числа инверсий в случайном лесеInversions in Split Trees and Conditional Galton–Watson TreesSimply Generated Unrooted Plane TreesGlobal regime for general additive functionals of conditioned Bienaymé-Galton-Watson treesGraph limits of random graphs from a subset of connected k‐treesUniversal height and width bounds for random trees



Cites Work


This page was built for publication: Sub-Gaussian tail bounds for the width and height of conditioned Galton-Watson trees