Archaeology of random recursive dags and Cooper-Frieze random networks

Simon Briend, Francisco Calvillo, Gábor Lugosi

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 i…