Growing random uniform \(d\)-ary trees

DOI10.1007/s00026-022-00621-3OpenAlexW3160343303MaRDI QIDQ2694455

Jean-François Marckert

Publication date: 3 April 2023

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2105.05513

zbMATH Keywords

Rémy's algorithm\(d\)-ary rooted trees

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Functional limit theorems; invariance principles (60F17)

Related Items (2)

The Foata-Fuchs proof of Cayley's formula, and its probabilistic uses ⋮ Models of random subtrees of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Doob-Martin boundary of Rémy's tree growth chain
• Scaling limits of \(k\)-ary growing trees
• Arbres et processus de Galton-Watson. (Trees and Galton-Watson processes)
• Increasing forests and quadrangulations via a bijective approach
• Simulating Size-constrained Galton–Watson Trees
• The Multiplicative Process

This page was built for publication: Growing random uniform \(d\)-ary trees