Resilience of complex networks to random breakdown.
暂无分享,去创建一个
[1] P. Gács,et al. Algorithms , 1992 .
[2] Bruce A. Reed,et al. A Critical Point for Random Graphs with a Given Degree Sequence , 1995, Random Struct. Algorithms.
[3] Vern Paxson,et al. End-to-end routing behavior in the Internet , 1996, TNET.
[4] D S Callaway,et al. Network robustness and fragility: percolation on random graphs. , 2000, Physical review letters.
[5] Albert-László Barabási,et al. Error and attack tolerance of complex networks , 2000, Nature.
[6] Cohen,et al. Resilience of the internet to random breakdowns , 2000, Physical review letters.
[7] S. Havlin,et al. Breakdown of the internet under intentional attack. , 2000, Physical review letters.
[8] S. N. Dorogovtsev,et al. Evolution of networks , 2001, cond-mat/0106144.
[9] M E J Newman. Assortative mixing in networks. , 2002, Physical review letters.
[10] F. Chung,et al. Connected Components in Random Graphs with Given Expected Degree Sequences , 2002 .
[11] Stefan Bornholdt,et al. Handbook of Graphs and Networks: From the Genome to the Internet , 2003 .
[12] Y. Moreno,et al. Resilience to damage of graphs with degree correlations. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.
[13] Uncorrelated random networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.
[14] Alessandro Vespignani,et al. Cut-offs and finite size effects in scale-free networks , 2003, cond-mat/0311650.
[15] R. Pastor-Satorras,et al. Generation of uncorrelated random scale-free networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.