arXiv Open Access 2022

Archaeology of random recursive dags and Cooper-Frieze random networks

Simon Briend Francisco Calvillo Gábor Lugosi

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

math.PR cs.LG math.ST stat.ML

Penulis (3)

Simon Briend

Francisco Calvillo

Gábor Lugosi

Format Sitasi

APA MLA BibTeX

Briend, S., Calvillo, F., Lugosi, G. (2022). Archaeology of random recursive dags and Cooper-Frieze random networks. https://arxiv.org/abs/2207.14601

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2022
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓