Pages that link to "Item:Q1951700"
From MaRDI portal
The following pages link to Sub-Gaussian tail bounds for the width and height of conditioned Galton-Watson trees (Q1951700):
Displaying 30 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)
- Global regime for general additive functionals of conditioned Bienaymé-Galton-Watson trees (Q2073179) (← links)
- Universal height and width bounds for random trees (Q2082663) (← links)
- Limits of random tree-like discrete structures (Q2192232) (← links)
- Long paths in first passage percolation on the complete graph. I: Local PWIT dynamics (Q2201495) (← links)
- Sub-exponential tail bounds for conditioned stable Bienaymé-Galton-Watson trees (Q2359736) (← links)
- Scaling limits of random Pólya trees (Q2413245) (← links)
- Scaling limit for the ant in a simple high-dimensional labyrinth (Q2416557) (← links)
- Asymptotic normality of fringe subtrees and additive functionals in conditioned Galton-Watson trees (Q2789556) (← links)
- Finding paths in sparse random graphs requires many queries (Q2951884) (← links)
- Tail bounds for the height and width of a random tree with a given degree sequence (Q3165459) (← links)
- Асимптотические свойства числа инверсий в случайном лесе (Q3383128) (← links)
- Simply Generated Unrooted Plane Trees (Q4626549) (← links)
- Growing random graphs with a preferential attachment structure (Q5026477) (← links)
- Speeding up non-Markovian first-passage percolation with a few extra edges (Q5215028) (← links)
- Inversions in Split Trees and Conditional Galton–Watson Trees (Q5222541) (← 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)
- The distance profile of rooted and unrooted simply generated trees (Q5886326) (← 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)