On percolation in random graphs with given vertex degrees

Details On percolation in random graphs with given vertex degrees On percolation in random graphs with given vertex degrees

2008-04-10

arxiv.org/abs/0804.1656v1

Mathematics

Probability

35 pages; 2 figures

Scientific paper

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 study existence of giant component and existence of k-core. As a variation of the latter, we study also bootstrap percolation in random regular graphs. We obtain both simple new proofs of known results and new results. An interesting feature is that for some degree sequences, there are several or even infinitely many phase transitions for the k-core.

Affiliated with

Also associated with

No associations

Rating

On percolation in random graphs with given vertex degrees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On percolation in random graphs with given vertex degrees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On percolation in random graphs with given vertex degrees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-355804