In this paper, the prediction of damage results for complex network is considered under grey information attack. Firstly, in order to construct more realistic networks, a new algorithm is proposed to generate 3 types of fully connected networks (normal scale-free network, scale-free network with cutoff, random network). Secondly, robustness of the 3 networks is analyzed under grey information attack. And then, a new method is proposed to predict the damage results by training the BP neural network. Thirdly, the effects of different topological parameters on the damage results are analyzed and a new method is proposed to find central nodes of the network. Finally, the damage results of a real bus network under grey information attack are predicted by the proposed method and several suggestions are given to help protect the real bus network.
AlbertR., JeongH. and BarabásiA.L., Error and attack tolerance of complex networks, Nature406(6794) (2000), 378–382.
2.
CohenR., ErezK., Ben-AvrahamD., et al., Resilience of the Internet to random breakdowns, Physical Review Letters85(21) (2000), 4626.
3.
CohenR., ErezK., Ben-AvrahamD., et al., Breakdown of the Internet under intentional attack, Physical Review Letters86(16) (2001), 3682.
4.
CallawayD.S., NewmanM.E.J., StrogatzS.H., et al., Network robustness and fragility: Percolation on random graphs, Physical Review Letters85(25) (2000), 5468.
5.
AlbertR., AlbertI. and NakaradoG.L., Structural vulnerability of the North American power grid, Physical Review E69(2) (2004), 025103.
6.
WuJ., DengH.Z. and TanY.J., Vulnerability of complex networks under intentional attack with incomplete information, Journal of Physics A: Mathematical and Theoretical40(11) (2007), 2665.
7.
JunL., JunW., YongL., et al., Attack robustness of scale-free networks based on grey information, Chinese Physics Letters28(5) (2011), 058904.
8.
ShangY., Robustness of scale-free networks under attack with tunable grey information, EPL (Europhysics Letters)95(2) (2011), 28005.
9.
AlbertR. and BarabásiA.L., Topology of evolving networks: Local events and universality, Physical Review Letters85(24) (2000), 5234.
10.
LüL. and ZhouT., Link prediction in complex networks: A survey, Physica A: Statistical Mechanics and its Applications390(6) (2011), 1150–1170.
11.
Zhi-YunZ., PengL., LiL., et al., An evolving network model with modular growth, Chinese Physics B21(2) (2012), 028904.
12.
Al HasanM. and ZakM.J., A survey of link prediction in social networks, in: Social Network Data AnalyticsSringer US, 2011, pp. 243–275.
13.
CannistraciC.V., Alanis-LobatoG., , and
RavasiT., From link-prediction in brain connectomes and protein interactomes to the local-community-paradigm in complex networks, Scientific Reports3 (2013), pp. 1613.
14.
ZhangY., JinS., CuiX., et al., Network security situation prediction based on BP and RBF neural network, Trustworthy Computing and Services, Springer Berlin Heidelberg (2013), 659–665.
15.
LaRoccaS. and GuikemaS.D., Characterizing and predicting the robustness of power-law networks, Reliability Engineering & System Safety133 (2015), 157–166.
16.
BarabásiA.L. and AlbertR., Emergence of scaling in random networks, Science286(5439) (1999), 509–512.
17.
GohK.I., KahngB. and KimD., Universal behor of load distribution in scale-free networks, Physical Review Letters87(27) (2001), 278701.
18.
ChungF. and LuL., Connected components in random graphs with given expected degree sequences, Annals of Combinatorics6(2) (2002), 125–145.
19.
MihailC.G.M. and ZeguraE., The markov chain simulation method for generating connected power law random graphs, Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments, SIAM (2003), 16–25.
20.
CatanzaroM., BoguñáM. and Pastor-SatorrasR., Generation of uncorrelated random scale-free networks, Physical Review E71(2) (2005), 027103.
21.
NewmanM.E.J., Assortative mixing in networks, Physical Review Letters89(20) (2002), 208701.
22.
AmaralL.A.N., ScalaA., BarthelemyM., et al., Classes of small-world networks, Proceedings of the National Academy of Sciences97(21) (2000), 11149–11152.
23.
ClausetA., ShaliziC.R. and NewmanM.E.J., Power-law distributions in empirical data, SIAM Review51(4) (2009), 661–703.
24.
BornholdtS., SchusterH.G., Handbook of graphs and networks: From the genome to the interne, John Wiley & Sons, 2006.
25.
MiloR., KashtanN., ItzkovitzS., et al., On the uniform generation of random graphs with prescribed degree sequences, , arXiv preprint cond-mat/0312028, 2003.
26.
ZhangR., RanX., WangC. and DengY., Fuzzy evaluation of network vulnerability, Quality and Reliability Engineering International32(5) (2016), 1715–1730.
27.
SienkiewiczJ. and HołystJ.A., Statistical analysis of 22 public transport networks in Poland, Physical Review E72(4) (2005), 046127.
28.
RenT., WangY.F., LiuM.M. and XuY.J., Analysis of robustness of urban bus network, Chinese Physics B25(2) (2016), 020101.
