Archaeology of random recursive dags and Cooper-Frieze random networks

Simon Briend; Francisco Calvillo; Gábor Lugosi

Archaeology of random recursive dags and Cooper-Frieze random networks

Probability 2022-08-01 v1 Machine Learning Statistics Theory Machine Learning Statistics Theory

Authors: Simon Briend , Francisco Calvillo , Gábor Lugosi

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.

Keywords

root vertex growing networks confidence sets random recursive dags cooper-frieze random graphs random networks

Cite

@article{arxiv.2207.14601,
  title  = {Archaeology of random recursive dags and Cooper-Frieze random networks},
  author = {Simon Briend and Francisco Calvillo and Gábor Lugosi},
  journal= {arXiv preprint arXiv:2207.14601},
  year   = {2022}
}

Comments

20 pages, 2 figures

Archaeology of random recursive dags and Cooper-Frieze random networks

Abstract

Keywords

Cite

Comments

Related papers