The containment profile of hyper-recursive trees
From MaRDI portal
Publication:5067223
DOI10.1017/jpr.2021.50zbMath1486.05282arXiv2101.06359OpenAlexW4206434126MaRDI QIDQ5067223
Hosam M. Mahmoud, Srinivasan Balaji, Joshua Sparks
Publication date: 1 April 2022
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2101.06359
Central limit and other weak theorems (60F05) Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Stochastic network models in operations research (90B15) Combinatorial probability (60C05)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fundamentals of Stein's method
- Local and global degree profiles of randomly grown self-similar hooking networks under uniform and preferential attachment
- The asymptotic expansion of a ratio of gamma functions
- Introduction to Random Graphs
- Random Trees
- Phase Changes in Subtree Varieties in Random Recursive and Binary Search Trees
- Probability with Martingales
- Asymptotic Joint Normality of Outdegrees of Nodes in Random Recursive Trees
- Trees grown under young-age preferential attachment
- Probability: A Graduate Course
This page was built for publication: The containment profile of hyper-recursive trees