Archaeology of random recursive dags and Cooper-Frieze random networks
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:HVFG6GRTrecord.jsonopen to challenge →
classification
math.PR
cs.LGmath.STstat.MLstat.TH
keywords
randomnetworkscooper-friezedagsmodelsrecursiverootuniform
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.