# Inference on the history of a randomly growing tree

@article{Crane2020InferenceOT, title={Inference on the history of a randomly growing tree}, author={Harry Crane and Min Xu}, journal={Journal of the Royal Statistical Society: Series B (Statistical Methodology)}, year={2020}, volume={83} }

The spread of infectious disease in a human community or the proliferation of fake news on social media can be modelled as a randomly growing tree‐shaped graph. The history of the random growth process is often unobserved but contains important information such as the source of the infection. We consider the problem of statistical inference on aspects of the latent history using only a single snapshot of the final tree. Our approach is to apply random labels to the observed unlabelled tree and…

## 4 Citations

### Root estimation in Galton–Watson trees

- Mathematics, Computer ScienceRandom Struct. Algorithms
- 2022

The maximum‐likelihood estimator for the root of a free tree when the underlying tree is a size‐conditioned Galton–Watson tree is determined and its probability of being correct is calculated.

### Archaeology of random recursive dags and Cooper-Frieze random networks

- MathematicsArXiv
- 2022

We study the problem of ﬁnding the root vertex in large growing networks. We prove that it is possible to construct conﬁdence sets of size independent of the number of vertices in the network that…

### Root and community inference on the latent growth process of a network using noisy attachment models

- Computer Science
- 2021

An inference algorithm based on Gibbs sampling that scales to networks with millions of nodes and theoretical analysis showing that the expected size of the confidence set is small so long as the noise level of the ER edges is not too large are provided.

### Diffusion Source Identification on Networks with Statistical Confidence

- Computer ScienceICML
- 2021

This work introduces a statistical framework for the study of diffusion source identification and develops a confidence set inference approach inspired by hypothesis testing, which efficiently produces a small subset of nodes that provably covers the source node with any prespecified confidence level without restrictive assumptions on network structures.

## References

SHOWING 1-10 OF 49 REFERENCES

### Choosing among alternative histories of a tree.

- Computer SciencePhysical review. E
- 2020

A fast and efficient method to estimate the most likely history of growing trees, based on exact results on root finding, and reveals an uncertainty principle: a relationship between the inferability of the root and that of the complete history, indicating that there is a tradeoff between the two tasks.

### Finding Rumor Sources on Random Trees

- MathematicsOper. 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.

### Confidence Sets for the Source of a Diffusion in Regular Trees

- Mathematics, Computer ScienceIEEE 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.

### Persistence of centrality in random growing trees

- Computer Science, MathematicsRandom Struct. Algorithms
- 2018

It is proved that a single node persists as the tree centroid after a finite number of steps, with probability 1, for random trees grown according to a preferential attachment model, a uniform attachment model), or a diffusion processes over a regular tree.

### Rumors in a Network: Who's the Culprit?

- Computer ScienceIEEE Transactions on Information Theory
- 2011

Simulations show that rumor centrality outperforms distance centrality in finding rumor sources in networks which are not tree-like, and it is proved that on trees, the rumor center and distance center are equivalent, but on general networks, they may differ.

### Networks and epidemic models

- Computer ScienceJournal of The Royal Society Interface
- 2005

A variety of methods are described that allow the mixing network, or an approximation to the network, to be ascertained and how the two fields of network theory and epidemiological modelling can deliver an improved understanding of disease dynamics and better public health through effective disease control are suggested.

### Recovering the past states of growing trees

- Computer ScienceArXiv
- 2019

Methods for temporal reconstruction that are both exact and efficient on trees are presented and one can directly fit growth models such as preferential attachment to static network data---testing models directly at the level of mechanism with only a single network snapshot.

### Finding Adam in random growing trees

- Computer Science, MathematicsRandom Struct. Algorithms
- 2017

This work investigates algorithms to find the first vertex in large trees generated by either the uniform attachment or preferential attachment model, and shows that for any ε, there exist such algorithms with K independent of the size of the input tree.

### Predicting the sources of an outbreak with a spectral technique

- MathematicsArXiv
- 2012

This work provides a procedure to identify multiple sources of an outbreak or their closer neighbors using a simple spectral technique requiring only the knowledge of the undirected contact graph.

### Phase Transition in the Recoverability of Network History

- Computer SciencePhysical Review X
- 2019

A Bayesian formulation of network archaeology is introduced, with a generalization of preferential attachment as the generative mechanism, and a sequential importance sampling algorithm to evaluate the posterior averages of this model, as well as an efficient heuristic that uncovers the history of a network in linear time.