Percolation of a strongly connected component in simple directed random graphs with a given degree distribution
Combinatorics
2021-03-08 v2 Probability
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.
Cite
@article{arxiv.2012.06415,
title = {Percolation of a strongly connected component in simple directed random graphs with a given degree distribution},
author = {Femke van Ieperen and Ivan Kryven},
journal= {arXiv preprint arXiv:2012.06415},
year = {2021}
}