Pages that link to "Item:Q444351"

The following pages link to Invariance principles for Galton-Watson trees conditioned on the number of leaves (Q444351):

Displaying 34 items.

• Vertices with fixed outdegrees in large Galton-Watson trees (Q782806) (← links)
• A decorated tree approach to random permutations in substitution-closed classes (Q782811) (← links)
• The Brownian limit of separable permutations (Q1660630) (← links)
• Scaling limits for some random trees constructed inhomogeneously (Q1748906) (← links)
• Cost functionals for large (uniform and simply generated) random trees (Q1990219) (← links)
• Duality of random planar maps via percolation (Q2027772) (← links)
• On scaling limits of random trees and maps with a prescribed degree sequence (Q2136415) (← links)
• Scaling limits of discrete snakes with stable branching (Q2179247) (← links)
• Limits of random tree-like discrete structures (Q2192232) (← links)
• On the maximal offspring in a subcritical branching process (Q2201477) (← links)
• Universal limits of substitution-closed permutation classes (Q2216743) (← links)
• Inverting the cut-tree transform (Q2337828) (← links)
• Limit theorems for conditioned non-generic Galton-Watson trees (Q2346181) (← links)
• Scaling limits of Markov branching trees and Galton-Watson trees conditioned on the number of vertices with out-degree in a given set (Q2346182) (← links)
• Sub-exponential tail bounds for conditioned stable Bienaymé-Galton-Watson trees (Q2359736) (← links)
• Gromov-Hausdorff-Prokhorov convergence of vertex cut-trees of \(n\)-leaf Galton-Watson trees (Q2419678) (← links)
• Random stable laminations of the disk (Q2447339) (← links)
• Parabolic Anderson model on critical Galton-Watson trees in a Pareto environment (Q2698477) (← links)
• Coding multitype forests: Application to the law of the total population of branching forests (Q2787987) (← links)
• Random non-crossing plane configurations: A conditioned Galton-Watson tree approach (Q2925524) (← links)
• Schröder’s problems and scaling limits of random trees (Q2944814) (← links)
• The CRT is the scaling limit of random dissections (Q3192383) (← links)
• Dissecting the circle, at random (Q3451710) (← links)
• On scaling limits of planar maps with stable face-degrees (Q4585093) (← links)
• On scaling limits of multitype Galton-Watson trees with possibly infinite variance (Q4601285) (← links)
• Random stable-type minimal factorizations of the <i>n</i>-cycle (Q5066873) (← 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)
• Exact-Size Sampling of Enriched Trees in Linear Time (Q6057780) (← links)
• Scaling limits of slim and fat trees (Q6091968) (← links)
• A branching process with coalescence to model random phylogenetic networks (Q6126989) (← links)
• A binary embedding of the stable line-breaking construction (Q6171668) (← links)
• Decorated stable trees (Q6177566) (← links)
• Large deviation local limit theorems and limits of biconditioned planar maps (Q6187477) (← links)