Estimating the history of a random recursive tree
From MaRDI portal
Cites work
- Archaeology of random recursive dags and Cooper-Frieze random networks
- Estimating the history of a random recursive tree
- Eve, Adam and the preferential attachment tree
- Finding Adam in random growing trees
- Finding rumor sources on random trees
- Finding the seed of uniform attachment trees
- From trees to seeds: on the inference of the seed from large trees in the uniform attachment model
- scientific article; zbMATH DE number 1744100 (Why is no real title available?)
- scientific article; zbMATH DE number 3073477 (Why is no real title available?)
- Inference on the History of a Randomly Growing Tree
- Localization in 1D non-parametric latent space models from pairwise affinities
- On the centroid of increasing trees
- On the discovery of the seed in uniform attachment trees
- Persistence of centrality in random growing trees
- Persistence of hubs in growing random networks
- Polya Urn Models
- Random Plane Networks
- Reconstruction of line-embeddings of graphons
- Root estimation in Galton–Watson trees
- Root finding algorithms and persistence of Jordan centrality in growing random trees
- Rumors in a Network: Who's the Culprit?
- The recovery of the root of a tree
Cited in
(3)
This page was built for publication: Estimating the history of a random recursive tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6896794)
