mlsanityData to 14 Oct 2026

Archaeology of random recursive dags and Cooper-Frieze random networks

arXiv 2207.14601 ↗First posted 29 Jul 2022math.PR cs.LG math.STcited by 4

Not on the map. Why?

Abstract (arXiv)

We study the problem of finding the root vertex in large growing networks. We prove that it is possible to construct confidence sets of size independent of the number of vertices in the network that contain the root vertex with high probability in various models of random networks. The models include uniform random recursive dags and uniform Cooper-Frieze random graphs.

Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 8 of its 34 references that are in the map. First posted on arXiv 29 Jul 2022.

Builds on

8 of 34 references.

References · 8

  1. 2014Finding Adam in random growing treescited by 5
  2. 2021Root and community inference on the latent growth process of a networkcited by 4
  3. 2014From trees to seeds: on the inference of the seed from large trees in the uniform attachment modelcited by 3
  4. 2015Confidence Sets for the Source of a Diffusion in Regular Treescited by 3
  5. 2015Persistence of centrality in random growing treescited by 3
  6. 2016Analysis of centrality in sublinear preferential attachment trees via the CMJ branching processcited by 3
  7. 2018On the discovery of the seed in uniform attachment treescited by 3
  8. 2014On the influence of the seed graph in the preferential attachment modelcited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 1; 2024: 2; 2025: 0; 2026: 1.

4 papers.

  1. 2023Broadcasting in random recursive dagscited by 1
  2. 2024Estimating the history of a random recursive treecited by 1
  3. 2024Leaf Stripping on Uniform Attachment Treescited by 1
  4. 2026History estimation in random recursive trees: Pointwise approach via iterated Jordan centralitiescited by 0