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.

中文翻译：

---

随机递归 dags 和 Cooper-Frieze 随机网络的考古学

我们研究在大型增长网络中找到根顶点的问题。我们证明，在各种随机网络模型中，可以构建大小与网络中包含高概率根顶点的顶点数量无关的置信集。这些模型包括统一的随机递归 dag 和统一的 Cooper-Frieze 随机图。