Percolation in simple directed random graphs with a given degree distribution

Femke van Ieperen, Ivan Kryven

Research output: Contribution to journalArticleAcademicpeer-review

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 languageEnglish
Pages (from-to)268-289
Number of pages22
JournalProbability in the Engineering and Informational Sciences
Volume38
Issue number2
Early online dateMay 2023
DOIs
Publication statusPublished - Apr 2024

Bibliographical note

Publisher Copyright:
© The Author(s), 2023.

Keywords

  • bounded differences
  • connected components
  • directed graphs
  • percolation
  • random graphs

Fingerprint

Dive into the research topics of 'Percolation in simple directed random graphs with a given degree distribution'. Together they form a unique fingerprint.

Cite this