Archaeology of random recursive dags and Cooper-Frieze random networks

Open Access
  • Authors: Gábor Lugosi.
  • Combinatorics, Probability and Computing
  • Statistics
Open Access Open Access Icon

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.

Subscribe to our newsletter
Want to receive the latest news and updates from the BSE? Share your details below.
Founding institutions
Distinctions
Logo BSE
© Barcelona Graduate School of
Economics. All rights reserved.
QualityTransparencyLegalCookie PolicySite map
YoutubeFacebookLinkedinInstagramX