Percolation in simple directed random graphs with a given degree distribution
Publication date
2024-04
Authors
van Ieperen, Femke
Kryven, I.
Editors
Advisors
Supervisors
Document Type
Article
Metadata
Show full item recordCollections
License
cc_by
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.
Keywords
bounded differences, connected components, directed graphs, percolation, random graphs, Industrial and Manufacturing Engineering, Statistics and Probability, Statistics, Probability and Uncertainty, Management Science and Operations Research
Citation
van Ieperen, F & Kryven, I 2024, 'Percolation in simple directed random graphs with a given degree distribution', Probability in the Engineering and Informational Sciences, vol. 38, no. 2, pp. 268-289. https://doi.org/10.1017/S0269964823000128