Archaeology of random recursive dags and Cooper-Frieze random networks

Simon Briend, Francisco Calvillo, Gábor Lugosi
7/29/2022
math.PRcs.LGmath.ST

No confident code implementation found for this paper.

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Exponential random graph model parameter estimation for very large directed networks

79% match1 repo282019

Broadcasting in random recursive dags

79% match2023

Artificial Benchmark for Community Detection (ABCD): Fast Random Graph Model with Community Structure

79% match1 repo292020

Fast Maximum Likelihood estimation via Equilibrium Expectation for Large Network Data

79% match1 repo62018

Analysis and Approximate Inference of Large Random Kronecker Graphs

78% match2023

On Balancing Sparsity with Reliable Connectivity in Distributed Network Design with Random K-out Graphs

77% match2025

Cite this paper

@article{briend2022archaeology,
  title  = {Archaeology of random recursive dags and Cooper-Frieze random networks},
  author = {Simon Briend and Francisco Calvillo and Gábor Lugosi},
  year   = {2022},
  eprint = {2207.14601},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2207.14601v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2207.14601.svg)](https://codeofpaper.com/paper/2207.14601)

Discussion