The number of descendants in a random directed acyclic graph

02/24/2023
by   Svante Janson, et al.
0

We consider a well known model of random directed acyclic graphs of order n, obtained by recursively adding vertices, where each new vertex has a fixed outdegree d≥2 and the endpoints of the d edges from it are chosen uniformly at random among previously existing vertices. Our main results concern the number X of vertices that are descendants of n. We show that X/√(n) converges in distribution; the limit distribution is, up to a constant factor, given by the dth root of a Gamma distributed variable. Γ(d/(d-1)). When d=2, the limit distribution can also be described as a chi distribution χ(4). We also show convergence of moments, and find thus the asymptotics of the mean and higher moments.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/26/2023

Asymptotic analysis and efficient random sampling of directed ordered acyclic graphs

Directed acyclic graphs (DAGs) are directed graphs in which there is no ...
research
05/06/2019

Scaling limits for random triangulations on the torus

We study the scaling limit of essentially simple triangulations on the t...
research
11/19/2019

Probabilistic Properties of GIG Digraphs

We study the probabilistic properties of the Greatest Increase Grid (GIG...
research
10/27/2017

Improved approximation of layout problems on random graphs

Inspired by previous work of Diaz, Petit, Serna, and Trevisan (Approxima...
research
01/23/2020

Counting directed acyclic and elementary digraphs

Directed acyclic graphs (DAGs) can be characterised as directed graphs w...
research
09/25/2020

The birth of the strong components

Random directed graphs D(n,p) undergo a phase transition around the poin...
research
01/07/2019

On the limit behavior of iterated equilibrium distributions for the Gamma and Weibull families

In this paper, we study the evolution of iterated equilibrium distributi...

Please sign up or login with your details

Forgot password? Click here to reset