Model for invulnerability of complex networks with incomplete information based on unequal probability sampling

Xitong Gongcheng Lilun yu Shijian/System Engineering Theory and Practice

Volumn 30, Issue 7, 2010, Pages 1207-1217

  Wu, Jun ^a   Tan, Yue Jin ^a   Deng, Hong Zhong ^a   Li, Yong ^a   Liu, Bin ^a  

^a NATIONAL UNIVERSITY OF DEFENSE TECHNOLOGY   (China)

Author keywords

Complex networks; Incomplete information; Invulnerability; Unequal probability sampling

Indexed keywords

ANALYTICAL EXPRESSIONS; COMPLEX NETWORKS; EXTREME CASE; GENERATING FUNCTIONS; INCOMPLETE INFORMATION; INFORMATION ACCURACY; INTENTIONAL ATTACKS; RANDOM FAILURES; SCALE FREE NETWORKS; UNEQUAL PROBABILITY SAMPLING;

FUNCTION EVALUATION; PROBABILITY;

CIRCUIT THEORY;

EID: 77955449665     PISSN: 10006788     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (27)

1. Fang J Q, Wang X F, Zheng Z G, et al. New interdisciplinary science: networks science (I) [J]. Progress in Physics, 2007, 27(3): 239-343.
2. Fang J Q, Wang X F, Zheng Z G, et al. New interdisciplinary science: networks science (II) [J]. Progress in Physics, 2007, 27(4): 361-448.
3. Fang J Q, Wang X F, Liu Z R. On the study of complexity and nonlinear complex networks[J]. Science & Technology Review, 2004, (2): 9-12.
4. Wu J S, Di Z R. Complex networks in statistical physics[J]. Progress in Physics, 2004, 24(1): 18-46.
5. Zheng J L, Di Z R. A brief discussion on complex networks and complexity[J]. Journal of Systemic Dialectics, 2005, 13(4): 8-13.
6. Chen Y. New progress on the network for the human being[J]. Journal of Systemic Dialectics, 13(4): 18-22.
7. Shi D H. Networks-A new approach for exploring complexity[J]. Journal of Systems Engineering, 2005, 20(2): 115-119.
8. Wang B H, Zhou T, He D R. The trend of recent research on statistical physics and complex systems[J]. China Basic Science, 2005, 7(3): 37-43.
9. Tan Y J, Wu J, Deng H Z. Invulnerability of complex networks: A survey[J]. Systems Engineering, 2006, 24(11): 1-5.
10. Wu J, Tan Y J. Study on measure of complex network invulnerability[J]. Journal of Systems Engineering, 2005, 20(2): 128-131.
11. Tan Y J, Lü X, Wu J, et al. On the invulnerability research of complex networks [J]. Systems Engineering-Theory & Practice, 2008, 28(Suppl): 116-120.
12. Albert R, Jeong H, Barabási A-L. Error and attack tolerance of complex networks[J]. Nature, 2000, 406: 378-382.
13. Callaway D S, Newman M E J, Strogatz S H, et al. Network robustness and fragility: Percolation on random graphs[J]. Physical Review Letters, 2000, 85(25): 5468-5471.
14. Gallos L K, Cohen R, Argyrakis P, et al. Stability and topology of scale-free networks under attack and defense srategies[J]. Physical Review Letters, 2005, 94(18): 188701.
15. Holme P, Kim B J, Yoon C N, et al. Attack vulnerability of complex networks[J]. Physical Review E, 2002, 65(5): 056109.
16. Cohen R, Erez K, Ben-Avraham D, et al. Breakdown of the internet under intentional attack[J]. Physical Review Letters, 2001, 86(16): 3682-3685.
17. Paul G, Sreenivasan S, Stanley H E. Resilience of complex networks to random breakdown[J]. Physical Review E, 2005, 72(5): 056130.
18. Vazquez A, Moreno Y. Resilience to damage of graphs with degree correlations[J]. Physical Review E, 2003, 67(1): 015101.
19. Cohen R, Erez K, Ben-Avraham D, et al. Resilience of the Internet to random breakdowns[J]. Physical Review Letters, 2000, 85(21): 4626-4628.
20. Freeman L C. A set of measures of centrality based upon Betweenness[J]. Sociometry, 1997, 40(1): 35-41.
21. Tsen F S P, Sung T Y, Lin M Y, et al. Finding the most vital edges with respect to the number of spanning trees[J]. IEEE Transcations on Reliability, 1994, 43(4): 600-602.
22. Tan Y J, Wu J, Deng H Z. Evaluation method for node importance based on node contraction in complex networks [J]. Systems Engineering-Theory & Practice, 2006, 26(11): 79-83.
23. 2005.
24. Newman M E J, Strogatz S H, Watts D J. Random graphs with arbitrary degree distributions and their applications[J]. Physical Review E, 2001, 64(2): 026118.
25. Molloy M, Reed B. A critical point for random graphs with a given degree sequence[J]. Random Structures and Algorithms, 1995, 6(2/3): 161-179.
26. Molloy M, Reed B. The size of the giant component of a random graph with a given degree sequence[J]. Combinatorics Probability Computation, 1998, 7: 295-305.
27. Boguna M, Pastor-Satorras R, Vespignani A. Cut-offs and finite size effects in scale-free networks[J]. European Physical Journal B, 2004, 38(2): 205-209.