Pages that link to "Item:Q4888164"
From MaRDI portal
The following pages link to A local limit theorem for the number of nodes, the height, and the number of final leaves in a critical branching process tree (Q4888164):
Displaying 9 items.
- Invariance principles for Galton-Watson trees conditioned on the number of leaves (Q444351) (← links)
- Itô's excursion theory and random trees (Q972813) (← links)
- Coalescent random forests (Q1284161) (← links)
- Branching random walks with acritical branching part (Q1900333) (← links)
- Pattern avoiding permutations with a unique longest increasing subsequence (Q2215466) (← links)
- Limiting probabilities for vertices of a given rank in 1-2 trees (Q2323818) (← links)
- Limit theorems for conditioned non-generic Galton-Watson trees (Q2346181) (← links)
- On the number of vertices with a given degree in a Galton-Watson tree (Q4676435) (← links)
- On a random search tree: asymptotic enumeration of vertices by distance from leaves (Q5233192) (← links)
