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 1/9.
Original language | English |
---|---|
Pages (from-to) | 268-289 |
Number of pages | 22 |
Journal | Probability in the Engineering and Informational Sciences |
Volume | 38 |
Issue number | 2 |
Early online date | May 2023 |
DOIs | |
Publication status | Published - Apr 2024 |
Bibliographical note
Publisher Copyright:© The Author(s), 2023.
Keywords
- bounded differences
- connected components
- directed graphs
- percolation
- random graphs