Brittleness Analysis and Important Nodes Discovery in Large Time-Evolving Complex Networks

doi:10.1007/s12204-017-1798-4

上海交通大学学报（英文版） ›› 2017, Vol. 22 ›› Issue (1): 50-054.doi: 10.1007/s12204-017-1798-4

Brittleness Analysis and Important Nodes Discovery in Large Time-Evolving Complex Networks

ZHANG Honga* (张红), HU Changzhenb (胡昌振), WANG Xiaojuna (王小军)

(a. School of Computer Science & Technology; b. School of Software, Beijing Institute of Technology, Beijing 100081, China)

出版日期:2017-02-28 发布日期:2017-04-04
通讯作者: ZHANG Hong (张红) E-mail:GraceZXKL@126.com

Brittleness Analysis and Important Nodes Discovery in Large Time-Evolving Complex Networks

ZHANG Honga* (张红), HU Changzhenb (胡昌振), WANG Xiaojuna (王小军)

(a. School of Computer Science & Technology; b. School of Software, Beijing Institute of Technology, Beijing 100081, China)

Online:2017-02-28 Published:2017-04-04
Contact: ZHANG Hong (张红) E-mail:GraceZXKL@126.com

摘要/Abstract

摘要： The brittleness analysis and important nodes detection have been a hot spot in the complex networks. How to get the overall feature of the whole network and how to find out some important nodes are requisites to solve these problems. In this paper, we adopt the trace of the adjacency matrix and the centrality of the complex networks to give a quantitative and qualitative analysis of networks being studied. Results show that the k-shell plays a more important role than the degree centrality and the betweenness in finding important nodes, and it can also be used to give direction on the immunization and maintenance of complex networks.

关键词: complex networks, brittleness, important nodes, time-evolving, node centrality

Abstract: The brittleness analysis and important nodes detection have been a hot spot in the complex networks. How to get the overall feature of the whole network and how to find out some important nodes are requisites to solve these problems. In this paper, we adopt the trace of the adjacency matrix and the centrality of the complex networks to give a quantitative and qualitative analysis of networks being studied. Results show that the k-shell plays a more important role than the degree centrality and the betweenness in finding important nodes, and it can also be used to give direction on the immunization and maintenance of complex networks.

Key words: complex networks, brittleness, important nodes, time-evolving, node centrality

中图分类号:

TP 393.0

ZHANG Honga* (张红), HU Changzhenb (胡昌振), WANG Xiaojuna (王小军). Brittleness Analysis and Important Nodes Discovery in Large Time-Evolving Complex Networks[J]. 上海交通大学学报（英文版）, 2017, 22(1): 50-054.

ZHANG Honga* (张红), HU Changzhenb (胡昌振), WANG Xiaojuna (王小军). Brittleness Analysis and Important Nodes Discovery in Large Time-Evolving Complex Networks[J]. Journal of shanghai Jiaotong University (Science), 2017, 22(1): 50-054.

参考文献 10

[1]	LI X, CHEN G R. A local-world evolving networkmodel [J]. Physica A, 2003, 328(1): 274-286.
[2]	BARRAT A, BARTH′ELEMY M, VESPIGNANI A.Weighted evolving networks: Coupling topology andweight dynamics [J]. Physicals Review Letters, 2004,92(22): 228701.
[3]	SHETTY J, ADIBI J. Discovering important nodesthrough graph entropy: The case of enron emaildatabase [C]//Proceedings of the 3rd InternationalWorkshop on Link Discovery. Chicage, USA: ACM,2005: 74-81.
[4]	AKOGLU L. Mining and modeling real-world networks:Patterns, anomalies, and tools [D]. Pittsburgh,PA: School of Computer Science, Carnegie Mellon University,2012.
[5]	BORGATTI S P. Identifying sets of key players in asocial network [J]. Computational and MathematicalOrganization Theory, 2006, 12: 21-34.
[6]	PITTEL B, SPENCER J, WORMALD N. Suddenemergence of a giant k-core in a random graph [J].Journal of Combinatorial Theory, Series B, 1996, 67:111-151.
[7]	CARMI S, HAVLIN S, KIRKPATRICK S, et al. Amodel of Internet topology using k-shell decomposition[J]. Proceedings of the National Academy of Sciences ofthe United States of America, 2007, 104(27): 11150-11154.
[8]	REN Z M, LIU J G, SHAO F, et al. Analysis of thespreading influence of the nodes with minimum K-shellvalue in complex networks [J]. Acta Physica Sinica,2013, 62(10): 466-471 (in Chinese).
[9]	GAO J, LIANG F, FAN W, et al. On communityoutliers and their efficient detection in informationnetworks [C]//Proceedings of International Conferenceon Knowledge Discovery & Data Mining. Washington,USA: ACM, 2010: 813-822.
[10]	YOSHINOBU K, YAIRI T, MACHIDA K. Changepointdetection in time-series data based on subspaceidentification [C]//Proceedings of the 2007 SeventhIEEE International Conference on Data Mining. Omaha,USA: IEEE, 2007: 559-564.

Brittleness Analysis and Important Nodes Discovery in Large Time-Evolving Complex Networks

Brittleness Analysis and Important Nodes Discovery in Large Time-Evolving Complex Networks

可视化

摘要/Abstract

引用本文

使用本文

参考文献 10

相关文章 3

编辑推荐

Metrics

本文评价

[1]	XING Yu-xuan1* (邢玉轩), XIAO Nong1 (肖侬), LIU Fang1 (刘芳), SUN Zhen1 (孙振), HE Wan-hu. AR-Dedupe: An Efficient Deduplication Approach for Cluster Deduplication System[J]. 上海交通大学学报（英文版）, 2015, 20(1): 76-81.
[2]	HE Jing-sha1,2 (何泾沙), XU Chen1* (徐琛), ZHANG Yi-xuan1 (张伊璇), ZHOU Shi-yi2 (周世义). A Strategy for Middleman Attack Prevention in Remote Desktop Protocol[J]. 上海交通大学学报（英文版）, 2015, 20(1): 82-85.
[3]	CHEN Chia-mei1 (陈嘉玫), LAI Gu-hsin2* (赖谷鑫). Research on Classification of Malware Source Code[J]. 上海交通大学学报（英文版）, 2014, 19(4): 425-430.