Archaeology of random recursive dags and Cooper-Frieze random networks

Francisco Calvillo; G\'abor Lugosi; Simon Briend

REVIEW

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2207.14601 v1 pith:HVFG6GRT submitted 2022-07-29 math.PR cs.LGmath.STstat.MLstat.TH

Archaeology of random recursive dags and Cooper-Frieze random networks

Simon Briend , Francisco Calvillo , G\'abor Lugosi This is my paper

classification math.PR cs.LGmath.STstat.MLstat.TH

keywords randomnetworkscooper-friezedagsmodelsrecursiverootuniform

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

0 comments

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.

Archaeology of random recursive dags and Cooper-Frieze random networks

discussion (0)