Root estimation in Galton–Watson trees
From MaRDI portal
Publication:6052483
DOI10.1002/rsa.21072arXiv2007.05681OpenAlexW4206651997MaRDI QIDQ6052483
Unnamed Author, Luc P. Devroye, Marcel K. Goh
Publication date: 17 October 2023
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2007.05681
Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scaling limits and influence of the seed graph in preferential attachment trees
- Asymptotic fringe distributions for general families of random trees
- Subdiffusive behavior of random walk on a random cluster
- From trees to seeds: on the inference of the seed from large trees in the uniform attachment model
- Finding the seed of uniform attachment trees
- Asymptotic normality of fringe subtrees and additive functionals in conditioned Galton-Watson trees
- Finding Rumor Sources on Random Trees
- Simulating Size-constrained Galton–Watson Trees
- Finding Adam in random growing trees
- An Estimate for Concentration Functions
- The Galton-Watson process conditioned on the total progeny
- On the Altitude of Nodes in Random Trees
- Rumors in a Network: Who's the Culprit?
- The recovery of the root of a tree
- The total progeny in a branching process and a related random walk
This page was built for publication: Root estimation in Galton–Watson trees