Photo by ldxcreative from unsplash
We study site and bond percolation in simple directed random graphs with a given degree distribution. We derive the percolation threshold for the giant strongly connected component and the fraction… Click to show full abstract
We study site and bond percolation in simple directed random graphs with a given degree distribution. We derive the percolation threshold for the giant strongly connected component and the fraction of vertices in this component as a function of the percolation probability. The results are obtained for degree sequences in which the maximum degree may depend on the total number of nodes n, being asymptotically bounded by $n^{\frac{1}{9}}$ .
Keywords:
simple directed;
percolation simple;
random graphs;
directed random;
graphs given;
percolation
Journal Title: Probability in the Engineering and Informational Sciences
Year Published: 2023
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Probability in the Engineering and Informational Sciences
Year Published: 2023
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!