# Root estimation in Galton–Watson trees

@article{Brandenberger2022RootEI,
title={Root estimation in Galton–Watson trees},
author={Anna Brandenberger and Luc Devroye and Marcel K. Goh},
journal={Random Structures \& Algorithms},
year={2022}
}
• Published 11 July 2020
• Mathematics, Computer Science
• Random Structures & Algorithms
Given only the free-tree structure of a tree, the root estimation problem asks if one can guess which of the free tree's nodes is the root of the original tree. We determine the maximum-likelihood estimator for the root of a free tree when the underlying tree is a size-conditioned Galton-Watson tree and calculate its probability of being correct.
2 Citations

## Figures and Tables from this paper

Leaf multiplicity in a Bienaym\'e-Galton-Watson tree
• Mathematics, Computer Science
Discrete Mathematics &amp; Theoretical Computer Science
• 2022
This note defines a notion of multiplicity for nodes in a rooted tree and presents an asymptotic calculation of the maximum multiplicity over all leaves in a Bienaym\'e-Galton-Watson tree with
The Horton–Strahler number of conditioned Galton–Watson trees
• Mathematics, Computer Science
• 2020
It is shown that for critical Galton-Watson trees with finite variance conditioned to be of size $n$, the Horton-Strahler number grows as $\frac{1}{2}\log_2 n$ in probability.

## References

SHOWING 1-10 OF 28 REFERENCES
Simulating Size-constrained Galton-Watson Trees
We discuss various methods for generating random Galton-Watson trees conditional on their sizes being equal to $n$. A linear expected time algorithm is proposed.
Asymptotic normality of fringe subtrees and additive functionals in conditioned Galton–Watson trees
• S. Janson
• Mathematics, Computer Science
Random Struct. Algorithms
• 2016
This work considers conditioned Galton–Watson trees and shows asymptotic normality of additive functionals that are defined by toll functions that are not too large, including, as a special case, the number of fringe subtrees isomorphic to any given tree, and joint asymptic normality for several such subtrees.
From trees to seeds: on the inference of the seed from large trees in the uniform attachment model
• Mathematics, Computer Science
ArXiv
• 2014
It is shown that different seeds lead to different distributions of limiting trees from a total variation point of view, and statistics are constructed that measure, in a certain well-defined sense, global "balancedness" properties of such trees.
Confidence Sets for the Source of a Diffusion in Regular Trees
• Mathematics, Computer Science
IEEE Transactions on Network Science and Engineering
• 2017
A probabilistic analysis of Pólya urns corresponding to the number of uninfected neighbors in specific subtrees of the infection tree is provided to provide an example illustrating the shortcomings of source estimation techniques in settings where the underlying graph is asymmetric.
Inference on the history of a randomly growing tree
• Computer Science
Journal of the Royal Statistical Society: Series B (Statistical Methodology)
• 2021
This work considers the problem of statistical inference on aspects of the latent history of a randomly growing tree using only a single snapshot of the final tree, and proposes algorithms for constructing confidence sets with valid frequentist coverage as well as bounds on the expected size of the confidence sets.
The Galton-Watson process conditioned on the total progeny
Let Zk denote the number in the kth generation of a Galton-Watson process initiated by one individual and let N be the total progeny, i.e., As n → ∞ the limiting behaviour of the process {Zk, 0 ≦ k ≦
Finding Rumor Sources on Random Trees
• Mathematics
Oper. Res.
• 2016
The authors proposed the graph score function rumor centrality as an estimator for detecting the source of a rumor and establish it to be the maximum likelihood estimator with respect to the popular Susceptible Infected model with exponential spreading times for regular trees.
Finding the seed of uniform attachment trees
• Mathematics, Computer Science
Electronic Journal of Probability
• 2019
This work proposes and analyzes seed-finding algorithms for all three types of seeds: a path, a star, and a random uniform attachment tree.
Scaling limits and influence of the seed graph in preferential attachment trees
• Mathematics, Computer Science
ArXiv
• 2014
As the number of nodes grows, it is shown that these looptrees, appropriately rescaled, converge in the Gromov-Hausdor sense towards a random compact metric space which the authors call the Brownian looptree.
On the discovery of the seed in uniform attachment trees
• Mathematics
Internet Math.
• 2019
We investigate the size of vertex confidence sets for including part of (or the entirety of) the seed in seeded uniform attachment trees, given knowledge of some of the seed's properties, and with a