REVIEW
Percolation of a strongly connected component in simple directed random graphs with a given degree distribution
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
classification
math.COmath.PR
keywords
componentpercolationconnecteddegreedirecteddistributiongivengraphs
Signed reviews
read the original 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.
Discussion (0). Continue with ORCID to comment.