Percolation of a strongly connected component in simple directed random graphs with a given degree distribution

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 the percolation probability above which the giant strongly connected component emerges and the fraction of vertices in this component.