1 paper · 2 filters
Emmanuel Jacob, Peter Morters
A growing family of random graphs is called robust if it retains a giant component after percolation with arbitrary positive retention probability. We study robustness for graphs,…