Burning Random Trees
Abstract
Let T be a Galton-Watson tree with a given offspring distribution , where is a Z≥ 0-valued random variable with E[] = 1 and 0 < σ2:=Var[] < ∞. For n ≥ 1, let Tn be the tree T conditioned to have n vertices. In this paper we investigate b(Tn), the burning number of Tn. Our main result shows that asymptotically almost surely b(Tn) is of the order of n1/3.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.