Biased percolation on scale-free networks.
@article{Hooyberghs2010BiasedPO,
title={Biased percolation on scale-free networks.},
author={H. Hooyberghs and B. Van Schaeybroeck and A. Moreira and J. S. Andrade and H. Herrmann and J. Indekeu},
journal={Physical review. E, Statistical, nonlinear, and soft matter physics},
year={2010},
volume={81 1 Pt 1},
pages={
011102
}
}Biased (degree-dependent) percolation was recently shown to provide strategies for turning robust networks fragile and vice versa. Here, we present more detailed results for biased edge percolation on scale-free networks. We assume a network in which the probability for an edge between nodes i and j to be retained is proportional to (k(i)k(j)(-alpha) with k(i) and k(j) the degrees of the nodes. We discuss two methods of network reconstruction, sequential and simultaneous, and investigate their… CONTINUE READING
Figures, Tables, and Topics from this paper.
24 Citations
Measuring degree-dependent failure in scale-free networks of bipartite structure
- Mathematics, Computer Science
- 2013
1
Cascade of failures in coupled network systems with multiple support-dependent relations
- Computer Science, Medicine
- 2011
272
Hierarchical Information Clustering by Means of Topologically Embedded Graphs
- Physics, Computer Science
- 2012
78
References
Publications referenced by this paper.
SHOWING 1-10 OF 89 REFERENCES








