Percolation on sparse random graphs with given degree sequence
| dc.creator | Fountoulakis, Nikolaos | |
| dc.date | 2007-03-09 | |
| dc.date.accessioned | 2026-07-07T07:51:11Z | |
| dc.date.available | 2026-07-07T07:51:11Z | |
| dc.description | We study the two most common types of percolation process on a sparse random graph with a given degree sequence. Namely, we examine first a bond percolation process where the edges of the graph are retained with probability p and afterwards we focus on site percolation where the vertices are retained with probability p. We establish critical values for p above which a giant component emerges in both cases. Moreover, we show that in fact these coincide. As a special case, our results apply to power law random graphs. We obtain rigorous proofs for formulas derived by several physicists for such graphs. | |
| dc.description | 20 pages | |
| dc.identifier | https://arxiv.org/abs/math/0703269 | |
| dc.identifier | http://arxiv.org/abs/math/0703269 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/125423 | |
| dc.subject | Combinatorics | |
| dc.subject | Probability | |
| dc.subject | 05C80 (Primary) 60K35, 60C05 (Secondary) | |
| dc.title | Percolation on sparse random graphs with given degree sequence | |
| dc.type | text |