Abstract
We study site and bond percolation on directed simple random graphs with a given degree distribution and derive the expressions for the critical value of percolation probability above which the giant strongly connected component emerges and the fraction of vertices in this component.
| Original language | English |
|---|---|
| Number of pages | 35 |
| Publication status | Published - 11 Dec 2020 |
Publication series
| Name | arXiv |
|---|
Keywords
- random graphs
- directed graphs
- percolation
- connected components