On percolation in random graphs with given vertex degrees

Simple item page
dc.creatorJanson, Svante
dc.date2008-04-10
dc.date.accessioned2026-07-07T09:31:32Z
dc.date.available2026-07-07T09:31:32Z
dc.descriptionWe 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.
dc.description35 pages; 2 figures
dc.identifierhttps://arxiv.org/abs/0804.1656
dc.identifierhttp://arxiv.org/abs/0804.1656
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/158492
dc.subjectProbability
dc.subjectCombinatorics
dc.subject60C05; 05C80
dc.titleOn percolation in random graphs with given vertex degrees
dc.typetext

Files

Collections

arXiv