On a tail bound for analyzing random trees

DOI10.1016/j.spl.2020.108746zbMath1437.05213arXiv1905.07652OpenAlexW3010411929MaRDI QIDQ2173353

Nariankadu D. Shyamalkumar, Sam Justice

Publication date: 22 April 2020

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

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

zbMATH Keywords

Poisson processtail boundindependent poissonsrandomly growing tree

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80)

Cites Work

• Unnamed Item
• Unnamed Item
• Finding Adam in random growing trees

This page was built for publication: On a tail bound for analyzing random trees