Hui-Jia Li
Abstract
Vulnerability assessment—a critical issue for networks—attempts to foresee unexpected destructive events or hostile attacks in the whole system. In this article, we consider a new Markov global connectivity metric—Kemeny constant, and take its derivative called Markov criticality to identify critical links. Markov criticality allows us to find links that are most influential on the derivative of Kemeny constant. Thus, we can utilize it to identity a critical link (i, j) from node i to node j, such that removing it leads to a minimization of networks’ global connectivity, i.e., the Kemeny constant. Furthermore, we also define a novel vulnerability index to measure the average speed by which we can disconnect a specified ratio of links with network decomposition. Our method is of high efficiency, which can be easily employed to calculate the Markov criticality in real-life networks. Comprehensive experiments on several synthetic and real-life networks have demonstrated our method’s better performance by comparing it with state-of-the-art baseline approaches.
- M. E. Newman. 2003. The structure and function of complex networks. SIAM Review 45, 2 (2003), 167–256.Google Scholar
Digital Library
- L. Lü, T. Zhou, Q. M. Zhang, and H. E. Stanley. 2016. The h-index of a network node and its relation to degree and coreness. Nature Communications 7, 1 (2016), 10168.Google ScholarCross Ref
- Z. Bu, H. J. Li, Z. Wang, G. Gao, and J. Cao. 2019. Dynamic cluster formation game for attributed graph clustering. IEEE Transactions on Cybernetics 49, 1 (2019), 328–341.Google ScholarCross Ref
- C. Liu, K. Li, J. Liang, and K. Li. 2019. Service reliability in an HC: Considering from the perspective of scheduling with load-dependent machine reliability. IEEE Transactions on Reliability 68, 2 (2019), 476–495.Google ScholarCross Ref
- S. Sun, X. Liu, L. Wang, and C. Xia. 2020. New link attack strategies of complex networks based on k-core decomposition. IEEE Transactions on Circuits and Systems II: Express Briefs 67, 12 (2020), 3157–3161.Google ScholarCross Ref
- Z. Wang, C. Xia, Z. Chen, and G. Chen. 2021. Epidemic propagation with positive and negative preventive information in multiplex networks. IEEE Transactions on Cybernetics 51, 3 (2021), 454–1462.Google ScholarCross Ref
- J. Wang, C. Li, and C. Xia. 2018. Improved centrality indicators to characterize the nodal spreading capability in complex networks. Applied Mathematics and Computation 334, 10 (2018), 388–400.Google ScholarDigital Library
- C. Huang, J. Lu, G. Zhai, J. Cao, G. Lu, and M. Perc. 2021. Stability and stabilization in probability of probabilistic Boolean networks. IEEETransactions on Neural Networks and Learning Systems 32, 1 (2021), 241–251.Google ScholarCross Ref
- M. Gosak, R. Markovic, J. Dolensek, M. S. Rupnik, M. Marhl, A. Stozer, and M. Perc. 2018. Network science of biological systems at different scales: A. review. Physics of Life Reviews 24, 11 (2018), 118–135.Google ScholarCross Ref
- H. J. Li, L. Wang, Y. Zhang, and M. Perc. 2020. Optimization of identifiability for efficient community detection. New Journal of Physics 22, 6 (2020), 063035.Google ScholarCross Ref
- Y. Shen, N. P. Nguyen, Y. Xuan, and M. T. Thai. 2012. On the discovery of critical links and nodes for assessing network vulnerability. IEEE/ACM Transactions on Networking 21, 3 (2012), 963–973. Google ScholarDigital Library
- R. Albert, H. Jeong, and A. Barabasi. 2000. Error and attack tolerance of complex networks. Nature 406, 6794 (2000), 378–382.Google Scholar
- R. Albert, I. Albert, and G. L. Nakarado. 2004. Structural vulnerability of the north american power grid. Physical Review E 69, 2 (2004).Google ScholarCross Ref
- L. D. F. Luciano, F. Rodrigues, G. Travieso, and V. P. R. Boas. 2007. Characterization of complex networks: A survey of measurements. Advances in Physics 56, 1 (2007), 167–242.Google ScholarCross Ref
- T. C. Matisziw and A. T. Murray. 2009. Modeling s-t path availability to support disaster vulnerability assessment of network infrastructure. Computers and Operations Research, Part Special Issue: Operations Research Approaches for Disaster Recovery Planning 36, 1 (2009), 16–26. Google ScholarDigital Library
- T. Dinh, Y. Xuan, M. Thai, P. Pardalos, and T. Znati. 2012. On new approaches of assessing network vulnerability: Hardness and approximation. IEEE/ACM Transactions on Networking 20, 2 (2012), 609–619. Google ScholarDigital Library
- J. Berkhout and B. F. Heidergott. 2019. Analysis of Markov influence graphs. Operations Research 67, 3 (2019), 892–904.Google ScholarDigital Library
- J. G. Kemeny and J. L. Snell. 1976. Finite Markov chains: With a new appendix. Generalization of a Fundamental Matrix. Springer, New York.Google Scholar
- S. P. Borgatti and M. G. Everett. 2006. A graph-theoretic perspective on centrality. Social Networks 28, 4 (2006), 466–484.Google ScholarCross Ref
- F. Sun and M. A. Shayman. 2007. On pairwise connectivity of wireless multi-hop networks. International Journal of Security and Networks 2, 1/2 (2007), 37–49. Google ScholarDigital Library
- A. Arulselvan, C. W. Commander, L. Elefteriadou, and P. M. Pardalos. 2009. Detecting critical nodes in sparse graphs. Computers and Operations Research 36, 7 (2009), 2193–2200. Google ScholarDigital Library
- M. D. Summa, A. Grosso, and M. Locatelli. 2011. Complexity of the critical node problem over trees. Computers and Operations Research 38, 12 (2011), 1766–1774. Google ScholarDigital Library
- C. D. Meyer. 1989. Stochastic complementation, uncoupling Markov chains, and the theory of nearly reducible systems. SIAM Review 31, 2 (1989), 240–272. Google ScholarDigital Library
- M. Rosvall and C. T. Bergstrom. 2008. Maps of random walks on complex networks reveal community structure. In Proceedings of the National Academy of Sciences. 105, 4 (2008), 1118–1123.Google ScholarCross Ref
- S. Kirkland. 2010. Fastest expected time to mixing for a Markov chain on a directed graph. Linear Algebra and Its Applications 433, 11–12 (2010), 1988–1996.Google ScholarCross Ref
- R. Albert and A.-L. Barabasi. 2002. Statistical mechanics of complex networks. Reviews of Modern Physics 74, 1 (2002), 47.Google ScholarCross Ref
- R. Albert, H. Jeong, and A.-L. Barabasi. 1999. Diameter of the world wide web. Nature 401, 9 (1999), 130–131.Google ScholarCross Ref
- D. J. Watts and S. H. Strogatz. 1998. Collective dynamics of ‘small-world’ networks. Nature 393, 6684 (1998), 440.Google Scholar
- A.-L. Barabasi and R. Albert. 1999. Emergence of scaling in random networks. Science 286, 5439 (1999), 509–512.Google Scholar
- L. Hamerset al.1989. Similarity measures in scientometric research: The jaccard index versus salton’s cosine formula. Information Processing and Management 25, 3 (1989), 315–318. Google ScholarDigital Library
- X. Q. Cheng, F.-X. Ren, H.-W. Shen, Z.-K. Zhang, and T. Zhou. 2010. Bridgeness: A local index on edge significance in maintaining global connectivity. Journal of Statistical Mechanics: Theory and Experiment 2010, 10 (2010), P10011.Google ScholarCross Ref
- M. Girvan and M. E. Newman. 2002. Community structure in social and biological networks. In Proceedings of the National Academy of Sciences. (2002), 7821–7826.Google Scholar
- K. Saito, M. Kimura, K. Ohara, and H. Motoda. 2016. Detecting critical links in complex network to maintain information flow/reachability. In Proceeding of the Pacific Rim International Conference on Artificial Intelligence. Springer, 419–432. Google ScholarDigital Library
- Chicago network dataset—KONECT, October, 2016.Google Scholar
- S. Dereichet al.2013. Random networks with sublinear preferential attachment: The giant component. The Annals of Probability 41, 1 (2013), 329–384.Google Scholar
Index Terms
- Measuring the Network Vulnerability Based on Markov Criticality
Recommendations
Vulnerability of interaction-based supply chain network and its self-organised criticality
With the increasing complexity of the supply chain, it brings benefits as well as increasing vulnerability to the supply chain. Research on the cause and characteristic of vulnerability is prerequisite for effective management measures. First, a supply ...
Measuring and ranking attacks based on vulnerability analysis
As the number of software vulnerabilities increases, the research on software vulnerabilities becomes a focusing point in information security. A vulnerability could be exploited to attack the information asset with the weakness related to the ...
Wireless vulnerability of SCADA systems
ACM-SE '12: Proceedings of the 50th Annual Southeast Regional ConferenceCritical infrastructures such as the Supervisory Control and Data Acquisition (SCADA) systems have succumbed to the demands of greater connectivity. Although the scheme of connecting these critical equipment and devices to cyberspace has brought us ...
Comments