all AI news
Archaeology of random recursive dags and Cooper-Frieze random networks. (arXiv:2207.14601v1 [math.PR])
Aug. 1, 2022, 1:11 a.m. | Simon Briend, Francisco Calvillo, Gábor Lugosi
stat.ML updates on arXiv.org arxiv.org
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.
More from arxiv.org / stat.ML updates on arXiv.org
Jobs in AI, ML, Big Data
Data Architect
@ University of Texas at Austin | Austin, TX
Data ETL Engineer
@ University of Texas at Austin | Austin, TX
Lead GNSS Data Scientist
@ Lurra Systems | Melbourne
Senior Machine Learning Engineer (MLOps)
@ Promaton | Remote, Europe
Principal Data Engineering Manager
@ Microsoft | Redmond, Washington, United States
Machine Learning Engineer
@ Apple | San Diego, California, United States