Network Robustness and Fragility: Percolation on Random Graphs
Citations
18,415 citations
17,647 citations
Cites background or methods from "Network Robustness and Fragility: P..."
...[15] on subsets of the Web graph, it was quickly realized [81, 93] that the problem of resilience to random failure of vertices in a network is equivalent to a site percolation process on the network....
[...]
...[81], who showed that, for uniform edge occupation probability T , the distribution of the sizes of clusters (i....
[...]
...[81], using a generalization of the generating function formalism discussed in Sec....
[...]
...For example, in a communication network like the Internet the size of the largest component represents the largest fraction of the network within which communication is possible and hence is a measure of the effectiveness of the network at doing its job [74, 81, 93, 94, 125, 323]....
[...]
...[81] above, allowing us to find a condition for the spread of the initial seed to give a large-scale cascade....
[...]
9,441 citations
7,665 citations
4,752 citations
References
[...]
7,736 citations
"Network Robustness and Fragility: P..." refers background in this paper
...The simplest and most widely studied model of undirected networks is the random graph [7], which has been investigated in depth for several decades now....
[...]
...[7] B....
[...]