English

Burning Random Trees

Combinatorics 2025-01-22 v2 Probability

Abstract

Let T\mathcal{T} be a Galton-Watson tree with a given offspring distribution ξ\xi, where ξ\xi is a Z0Z_{\geq 0}-valued random variable with E[ξ]=1E[\xi] = 1 and 0<σ2:=Var[ξ]<0 < \sigma^{2}:=Var[\xi] < \infty. For n1n \geq 1, let TnT_{n} be the tree T\mathcal{T} conditioned to have nn vertices. In this paper we investigate b(Tn)b(T_n), the burning number of TnT_n. Our main result shows that asymptotically almost surely b(Tn)b(T_n) is of the order of n1/3n^{1/3}.

Keywords

Cite

@article{arxiv.2404.01545,
  title  = {Burning Random Trees},
  author = {Luc Devroye and Austin Eide and Pawel Pralat},
  journal= {arXiv preprint arXiv:2404.01545},
  year   = {2025}
}

Comments

12 pages

R2 v1 2026-06-28T15:40:56.163Z