Pages that link to "Item:Q1951700"

The following pages link to Sub-Gaussian tail bounds for the width and height of conditioned Galton-Watson trees (Q1951700):

Displaying 15 items.

• Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation (Q431520) (← links)
• Large unicellular maps in high genus (Q902876) (← links)
• Random enriched trees with applications to random graphs (Q1658748) (← links)
• Automatic choice of the threshold of a grain filter via Galton-Watson trees: application to granite cracks detection (Q1701994) (← links)
• Heavy subtrees of Galton-Watson trees with an application to Apollonian networks (Q1721992) (← links)
• Most trees are short and fat (Q1729690) (← links)
• Speeding up non-Markovian first-passage percolation with a few extra edges (Q5215028) (← links)
• Graph limits of random graphs from a subset of connected <i>k</i>‐trees (Q5236927) (← links)
• Asymptotics of trees with a prescribed degree sequence and applications (Q5415593) (← links)
• A branching process approach to level‐<i>k</i> phylogenetic networks (Q6052469) (← links)
• On breadth‐first constructions of scaling limits of random graphs and random unicellular maps (Q6052477) (← links)
• Slightly supercritical percolation on non‐amenable graphs I: The distribution of finite clusters (Q6075038) (← links)
• The Foata-Fuchs proof of Cayley's formula, and its probabilistic uses (Q6110570) (← links)
• A branching process with coalescence to model random phylogenetic networks (Q6126989) (← links)
• Asymptotic behaviour of the first positions of uniform parking functions (Q6189096) (← links)