On percolation in random graphs with given vertex degrees
On percolation in random graphs with given vertex degrees
We study the random graph obtained by random deletion of vertices or edges from a random graph with given vertex degrees. A simple trick of exploding vertices instead of deleting them, enables us to derive results from known results for random graphs with given vertex degrees. This is used to …