Sub-exponential tail bounds for conditioned stable Bienaymé-Galton-Watson trees
From MaRDI portal
Publication:2359736
DOI10.1007/s00440-016-0704-6zbMath1374.60167arXiv1504.04358OpenAlexW1854279212WikidataQ115607618 ScholiaQ115607618MaRDI QIDQ2359736
Publication date: 22 June 2017
Published in: Probability Theory and Related Fields (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.04358
Central limit and other weak theorems (60F05) Trees (05C05) Stable stochastic processes (60G52) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Vertex degrees (05C07)
Related Items
On scaling limits of random trees and maps with a prescribed degree sequence, Scaling limits of discrete snakes with stable branching, Limits of random tree-like discrete structures, Convergence in law for the capacity of the range of a critical branching random walk, Scaling limit of linearly edge-reinforced random walks on critical Galton-Watson trees, A note on the maximal outdegrees of Galton-Watson trees, Stable graphs: distributions and line-breaking construction, Decorated stable trees, Large deviation local limit theorems and limits of biconditioned planar maps, Geometry of the minimal spanning tree in the heavy-tailed regime: new universality classes, The boundary of random planar maps via looptrees, Parabolic Anderson model on critical Galton-Watson trees in a Pareto environment, Most trees are short and fat, Short proofs in extrema of spectrally one sided Lévy processes, The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs, On scaling limits of planar maps with stable face-degrees, On scaling limits of multitype Galton-Watson trees with possibly infinite variance, Inversions in Split Trees and Conditional Galton–Watson Trees, Simply Generated Unrooted Plane Trees, Global regime for general additive functionals of conditioned Bienaymé-Galton-Watson trees, Universal height and width bounds for random trees, The stable graph: the metric space scaling limit of a critical random graph with i.i.d. power-law degrees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Triangulating stable laminations
- Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation
- Invariance principles for Galton-Watson trees conditioned on the number of leaves
- Scaling limits of random planar maps with large faces
- The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs
- Scaling limits of Markov branching trees with applications to Galton-Watson and random unordered trees
- Percolation on random triangulations and stable looptrees
- Large unicellular maps in high genus
- Random trees and applications
- Random walks on Galton-Watson trees with infinite variance offspring distribution conditioned to survive
- Subdiffusive behavior of random walk on a random cluster
- Some new limit theorems for the critical branching process allowing immigration
- Uses of exchangeability
- Branching processes in Lévy processes: The exploration process
- Normalized excursion, meander and bridge for stable Lévy processes
- A limit theorem for the contour process of conditioned Galton-Watson trees
- Statistics on non-crossing trees
- Conceptual proofs of \(L\log L\) criteria for mean behavior of branching processes
- Sub-Gaussian tail bounds for the width and height of conditioned Galton-Watson trees
- Random walk on random infinite looptrees
- Decomposition of Lévy trees along their diameter
- Random stable looptrees
- Stochastic-Process Limits
- On Largest Offspring in a Critical Branching Process with Finite Variance
- A Simple Proof of Duquesne’s Theorem on Contour Processes of Conditioned Galton–Watson Trees
- Random non-crossing plane configurations: A conditioned Galton-Watson tree approach
- On the Maximal Offspring in a Critical Branching Process with Infinite Variance
- Tail bounds for the height and width of a random tree with a given degree sequence
- The CRT is the scaling limit of random dissections
- Random cutting and records in deterministic and random trees
- Noncrossing trees are almost conditioned Galton–Watson trees
- On maximum family size in branching processes
- Liouville quantum gravity as a mating of trees
- Asymptotics of trees with a prescribed degree sequence and applications
- A branching process with mean one and possibly infinite variance
- Regularly varying functions
- Extreme order statistics on Galton-Watson trees.
