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.

翻译：我们研究在大规模增长的网络中找到根顶板的问题。 我们证明,可以建立大小不取决于网络中含有根顶板,在随机网络的各种模型中可能性很高的顶板数量的信任套。 这些模型包括统一的随机递归缓冲和统一的Cooper-Friez随机图。