Carregant...
Tipus de document
ArticleVersió
Versió publicadaData de publicació
Tots els drets reservats
Si us plau utilitzeu sempre aquest identificador per citar o enllaçar aquest document: https://hdl.handle.net/2445/137858
Percolation in self-similar networks
Títol de la revista
Director/Tutor
ISSN de la revista
Títol del volum
Recurs relacionat
Resum
We provide a simple proof that graphs in a general class of self-similar networks have zero percolation threshold. The considered self-similar networks include random scale-free graphs with given expected node degrees and zero clustering, scale-free graphs with finite clustering and metric structure, growing scale-free networks, and many real networks. The proof and the derivation of the giant component size do not require the assumption that networks are treelike. Our results rely only on the observation that self-similar networks possess a hierarchy of nested subgraphs whose average degree grows with their depth in the hierarchy. We conjecture that this property is pivotal for percolation in networks.
Matèries
Matèries (anglès)
Citació
Citació
SERRANO MORAL, Ma. ángeles (maría ángeles), KRIOUKOV, Dmitri, BOGUÑÁ, Marián. Percolation in self-similar networks. _Physical Review Letters_. 2011. Vol. 106, núm. 4, pàgs. 048701. [consulta: 29 de gener de 2026]. ISSN: 0031-9007. [Disponible a: https://hdl.handle.net/2445/137858]