Please use this identifier to cite or link to this item:
Title: Percolation in self-similar networks
Author: Serrano Moral, Ma. Ángeles (María Ángeles)
Krioukov, Dmitri
Boguñá, Marián
Keywords: Percolació (Física estadística)
Percolation (Statistical physics)
Issue Date: 25-Jan-2011
Publisher: American Physical Society
Abstract: 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.
Note: Reproducció del document publicat a:
It is part of: Physical Review Letters, 2011, vol. 106, num. 4, p. 048701
Related resource:
ISSN: 0031-9007
Appears in Collections:Articles publicats en revistes (Física de la Matèria Condensada)

Files in This Item:
File Description SizeFormat 
PhysRevLett.106.048701.pdf273.91 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.