Recent work on the internet, social networks, and the power grid has
addressed the resilience of these networks to either random or targeted
deletion of network nodes. Such deletions include, for example, the failure of
internet routers or power transmission lines. Percolation models on random
graphs provide a simple representation of this process, but have typically been
limited to graphs with Poisson degree distribution at their vertices. Such
graphs are quite unlike real world networks, which often possess power-law or
other highly skewed degree distributions. In this paper we study percolation on
graphs with completely general degree distribution, giving exact solutions for
a variety of cases, including site percolation, bond percolation, and models in
which occupation probabilities depend on vertex degree. We discuss the
application of our theory to the understanding of network resilience.
%0 Journal Article
%1 Callaway2000Network
%A Callaway, D. S.
%A Newman, M. E. J.
%A Strogatz, S. H.
%A Watts, D. J.
%D 2000
%I American Physical Society
%J Physical Review Letters
%K generating\_functions, percolation er-networks
%N 25
%P 5468--5471
%R 10.1103/physrevlett.85.5468
%T Network robustness and fragility: Percolation on random graphs
%U http://dx.doi.org/10.1103/physrevlett.85.5468
%V 85
%X Recent work on the internet, social networks, and the power grid has
addressed the resilience of these networks to either random or targeted
deletion of network nodes. Such deletions include, for example, the failure of
internet routers or power transmission lines. Percolation models on random
graphs provide a simple representation of this process, but have typically been
limited to graphs with Poisson degree distribution at their vertices. Such
graphs are quite unlike real world networks, which often possess power-law or
other highly skewed degree distributions. In this paper we study percolation on
graphs with completely general degree distribution, giving exact solutions for
a variety of cases, including site percolation, bond percolation, and models in
which occupation probabilities depend on vertex degree. We discuss the
application of our theory to the understanding of network resilience.
@article{Callaway2000Network,
abstract = {{Recent work on the internet, social networks, and the power grid has
addressed the resilience of these networks to either random or targeted
deletion of network nodes. Such deletions include, for example, the failure of
internet routers or power transmission lines. Percolation models on random
graphs provide a simple representation of this process, but have typically been
limited to graphs with Poisson degree distribution at their vertices. Such
graphs are quite unlike real world networks, which often possess power-law or
other highly skewed degree distributions. In this paper we study percolation on
graphs with completely general degree distribution, giving exact solutions for
a variety of cases, including site percolation, bond percolation, and models in
which occupation probabilities depend on vertex degree. We discuss the
application of our theory to the understanding of network resilience.}},
added-at = {2019-06-10T14:53:09.000+0200},
archiveprefix = {arXiv},
author = {Callaway, D. S. and Newman, M. E. J. and Strogatz, S. H. and Watts, D. J.},
biburl = {https://www.bibsonomy.org/bibtex/2ef4ee3cca53ed2024ea22c9c8e92f5ce/nonancourt},
citeulike-article-id = {7359469},
citeulike-linkout-0 = {http://arxiv.org/abs/cond-mat/0007300},
citeulike-linkout-1 = {http://arxiv.org/pdf/cond-mat/0007300},
citeulike-linkout-2 = {http://dx.doi.org/10.1103/physrevlett.85.5468},
citeulike-linkout-3 = {http://link.aps.org/abstract/PRL/v85/i25/p5468},
citeulike-linkout-4 = {http://link.aps.org/pdf/PRL/v85/i25/p5468},
day = 19,
doi = {10.1103/physrevlett.85.5468},
eprint = {cond-mat/0007300},
interhash = {b7f03fce04faff117bd09190be9796db},
intrahash = {ef4ee3cca53ed2024ea22c9c8e92f5ce},
issn = {0031-9007},
journal = {Physical Review Letters},
keywords = {generating\_functions, percolation er-networks},
month = oct,
number = 25,
pages = {5468--5471},
posted-at = {2011-12-01 11:59:05},
priority = {2},
publisher = {American Physical Society},
timestamp = {2019-08-01T16:10:11.000+0200},
title = {{Network robustness and fragility: Percolation on random graphs}},
url = {http://dx.doi.org/10.1103/physrevlett.85.5468},
volume = 85,
year = 2000
}