Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2017, Article ID 6108563, 9 pages
https://doi.org/10.1155/2017/6108563
Research Article

Combined Heuristic Attack Strategy on Complex Networks

Department of Applied Informatics and Mathematics, University of Ss. Cyril and Methodius, J. Herdu 2, 917 01 Trnava, Slovakia

Correspondence should be addressed to Iveta Dirgová Luptáková; ks.mcu@avogrid.atevi

Received 10 March 2017; Revised 28 June 2017; Accepted 14 August 2017; Published 18 September 2017

Academic Editor: Sebastian Heidenreich

Copyright © 2017 Marek Šimon et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. Scopus, “abstract and citation database of peer-reviewed literature,” 2017, https://www.scopus.com/.
  2. A.-L. Barabási, Network Science, Cambridge University Press, 2016.
  3. M. E. J. Newman, Networks: An Introduction, Oxford University Press, Oxford, UK, 2010. View at Publisher · View at Google Scholar · View at MathSciNet
  4. M. O. Jackson, Social and economic networks, Princeton University Press, Princeton, NJ, USA, 2008. View at MathSciNet
  5. L. Cabyova and J. Ptacin, “Benchmarking comparison of marketing communication of universities in Slovakia,” in Communication Today, vol. 1, pp. 54–69, 2014. View at Google Scholar
  6. C.-H. Huang, T.-H. Chen, and K.-L. Ng, “Graph theory and stability analysis of protein complex interaction networks,” IET Systems Biology, vol. 10, no. 2, pp. 64–75, 2016. View at Publisher · View at Google Scholar · View at Scopus
  7. R. Albert, H. Jeong, and A.-L. Barabási, “Error and attack tolerance of complex networks,” Nature, vol. 406, no. 6794, pp. 378–382, 2000. View at Publisher · View at Google Scholar · View at Scopus
  8. G. Paul, T. Tanizawa, S. Havlin, and H. E. Stanley, “Optimization of robustness of complex networks,” European Physical Journal B, vol. 38, no. 2, pp. 187–191, 2004. View at Publisher · View at Google Scholar · View at Scopus
  9. O. Lordan, J. M. Sallan, P. Simo, and D. Gonzalez-Prieto, “Robustness of the air transport network,” Transportation Research Part E: Logistics and Transportation Review, vol. 68, pp. 155–163, 2014. View at Publisher · View at Google Scholar · View at Scopus
  10. Y. Koç, M. Warnier, P. Van Mieghem, R. E. Kooij, and F. M. Brazier, “The impact of the topology on cascading failures in a power grid model,” Physica A. Statistical Mechanics and its Applications, vol. 402, pp. 169–179, 2014. View at Publisher · View at Google Scholar · View at MathSciNet
  11. M. Korytar and D. Gabriska, “Integrated security levels and analysis of their implications to the maintenance,” Journal of Applied Mathematics, Statistics and Informatics, vol. 10, no. 2, pp. 33–42, 2014. View at Publisher · View at Google Scholar
  12. M. Zhou and J. Liu, “A memetic algorithm for enhancing the robustness of scale-free networks against malicious attacks,” Physica A: Statistical Mechanics and its Applications, vol. 410, pp. 131–143, 2014. View at Publisher · View at Google Scholar · View at Scopus
  13. J. Thomas, S. Ghosh, D. Parek, D. Ruths, and J. Ruths, “Robustness of network controllability to degree-based edge attacks,” Studies in Computational Intelligence, vol. 693, pp. 525–537, 2017. View at Publisher · View at Google Scholar · View at Scopus
  14. J. Xu and H. Chen, “The topology of dark networks,” Communications of the ACM, vol. 51, no. 10, pp. 58–65, 2008. View at Publisher · View at Google Scholar · View at Scopus
  15. P. A. C. Duijn, V. Kashirin, and P. M. A. Sloot, “The relative ineffectiveness of criminal network disruption,” Scientific Reports, vol. 4, article 4238, 2014. View at Publisher · View at Google Scholar · View at Scopus
  16. P. A. Duijn and P. P. Klerks, “Social network analysis applied to criminal networks: recent developments in dutch law enforcement,” in Networks and Network Analysis for Defence and Security, A. J. Masys, Ed., Lecture Notes in Social Networks, pp. 121–159, Springer International Publishing, Cham, 2014. View at Publisher · View at Google Scholar
  17. M. R. D'Orsogna and M. Perc, “Statistical physics of crime: A review,” Physics of Life Reviews, vol. 12, pp. 1–21, 2015. View at Publisher · View at Google Scholar · View at Scopus
  18. S. Agreste, S. Catanese, P. De Meo, E. Ferrara, and G. Fiumara, “Network structure and resilience of Mafia syndicates,” Information Sciences, vol. 351, pp. 30–47, 2016. View at Publisher · View at Google Scholar · View at Scopus
  19. C. Z. Marshak, M. P. Rombach, A. L. Bertozzi, and M. R. D'Orsogna, “Growth and containment of a hierarchical criminal network,” Physical Review E - Statistical, Nonlinear, and Soft Matter Physics, vol. 93, no. 2, Article ID 022308, 2016. View at Publisher · View at Google Scholar · View at Scopus
  20. N. F. Johnson, P. Manrique, and P. M. Hui, “Modeling insurgent dynamics including heterogeneity: a statistical physics approach,” Journal of Statistical Physics, vol. 151, no. 3-4, pp. 395–413, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  21. L. K. Gallos, R. Cohen, F. Liljeros, P. Argyrakis, A. Bunde, and S. Havlin, Attack Strategies on Complex Networks, vol. 3993 of Lecture Notes in Computer Science, 2006. View at Publisher · View at Google Scholar · View at Scopus
  22. M. Bellingeri, D. Cassi, and S. Vincenzi, “Efficiency of attack strategies on complex model and real-world networks,” Physica A: Statistical Mechanics and its Applications, vol. 414, pp. 174–180, 2014. View at Publisher · View at Google Scholar · View at Scopus
  23. T. Nie, Z. Guo, K. Zhao, and Z.-M. Lu, “New attack strategies for complex networks,” Physica A: Statistical Mechanics and its Applications, vol. 424, pp. 248–253, 2015. View at Publisher · View at Google Scholar · View at Scopus
  24. R. Pastor-Satorras and A. Vespignani, “Immunization of complex networks,” Physical Review E, vol. 65, no. 3, Article ID 036104, 2002. View at Publisher · View at Google Scholar · View at Scopus
  25. R. Cohen, S. Havlin, and D. Ben-Avraham, “Efficient immunization strategies for computer networks and populations,” Physical Review Letters, vol. 91, no. 24, Article ID 247901, 2003. View at Google Scholar · View at Scopus
  26. A. Arulselvan, C. W. Commander, L. Elefteriadou, and P. M. Pardalos, “Detecting critical nodes in sparse graphs,” Computers and Operations Research, vol. 36, no. 7, pp. 2193–2200, 2009. View at Publisher · View at Google Scholar · View at Scopus
  27. A. Veremyev, O. A. Prokopyev, and E. L. Pasiliao, “Critical nodes for distance-based connectivity and related problems in graphs,” Networks, vol. 66, no. 3, pp. 170–195, 2015. View at Publisher · View at Google Scholar · View at MathSciNet
  28. B. Addis, R. Aringhieri, A. Grosso, and P. Hosteins, “Hybrid constructive heuristics for the critical node problem,” Annals of Operations Research, vol. 238, no. 1-2, pp. 637–649, 2016. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  29. Y. Deng, J. Wu, and Y.-j. Tan, “Optimal attack strategy of complex networks based on tabu search,” Physica A. Statistical Mechanics and its Applications, vol. 442, pp. 74–81, 2016. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  30. X. Zhang, J. Wu, H. Wang, J. Xiong, and K. Yang, “Optimization of disintegration strategy for multi-edges complex networks,” in Proceedings of the IEEE Congress on Evolutionary Computation (CEC '16), pp. 522–528, July 2016. View at Publisher · View at Google Scholar · View at Scopus
  31. M. Lozano, C. García-Martínez, F. J. Rodríguez, and H. M. Trujillo, “Optimizing network attacks by artificial bee colony,” Information Sciences, vol. 377, pp. 30–50, 2017. View at Publisher · View at Google Scholar · View at Scopus
  32. R. Aringhieri, A. Grosso, P. Hosteins, and R. Scatamacchia, “A general Evolutionary Framework for different classes of Critical Node Problems,” Engineering Applications of Artificial Intelligence, vol. 55, pp. 128–145, 2016. View at Publisher · View at Google Scholar · View at Scopus
  33. L. A. Adamic and N. Glance, “The political blogosphere and the 2004 U.S. Election: Divided they blog,” in Proceedings of the 3rd International Workshop on Link Discovery (LinkKDD '05), pp. 36–43, ACM, 2005. View at Publisher · View at Google Scholar · View at Scopus
  34. B. R. Da Cunha, J. C. González-Avella, and S. Gonçalves, “Fast fragmentation of networks using module-based attacks,” PLoS ONE, vol. 10, no. 11, Article ID e0142824, 2015. View at Publisher · View at Google Scholar · View at Scopus
  35. F. Morone and H. A. Makse, “Influence maximization in complex networks through optimal percolation,” Nature, vol. 524, no. 7563, pp. 65–68, 2015. View at Publisher · View at Google Scholar · View at Scopus
  36. “Webpage of Complex Networks and Soft Matter Lab of Hernan Makse at the Levich Institute and Department of Physics of City College of New York,” 2015, http://www-levich.engr.ccny.cuny.edu/webpage/hmakse/, http://www-levich.engr.ccny.cuny.edu/~hernanlab/uploads/CI_HEAP.c.
  37. F. Morone, B. Min, L. Bo, R. Mari, and H. A. Makse, “Collective Influence Algorithm to find influencers via optimal percolation in massively large social media,” Scientific Reports, vol. 6, Article ID 30062, 2016. View at Publisher · View at Google Scholar · View at Scopus
  38. L. Lü, D. Chen, X.-L. Ren, Q.-M. Zhang, Y.-C. Zhang, and T. Zhou, “Vital nodes identification in complex networks,” Physics Reports, vol. 650, pp. 1–63, 2016. View at Publisher · View at Google Scholar · View at MathSciNet
  39. L. Lü, T. Zhou, Q.-M. Zhang, and H. E. Stanley, “The H-index of a network node and its relation to degree and coreness,” Nature Communications, vol. 7, Article ID 10168, 2016. View at Publisher · View at Google Scholar · View at Scopus
  40. R. Pastor-Satorras and C. Castellano, “Topological structure and the H index in complex networks,” Physical Review E, vol. 95, no. 2, Article ID 022301, 2017. View at Google Scholar
  41. P. Erdos and A. Rényi, “On Random Graphs. I,” Publicationes Mathematicae, vol. 6, Article ID 290297, pp. 290–297, 1959. View at Google Scholar
  42. D. J. Watts and S. H. Strogatz, “Collective dynamics of 'small-world' networks,” Nature, vol. 393, no. 6684, pp. 440–442, 1998. View at Publisher · View at Google Scholar · View at Scopus
  43. M. Molloy and B. Reed, “A critical point for random graphs with a given degree sequence,” Random Structures Algorithms, vol. 6, no. 2-3, pp. 161–179, 1995. View at Publisher · View at Google Scholar · View at MathSciNet
  44. V. Latora and M. Marchiori, “Efficient behavior of small-world networks,” Physical Review Letters, vol. 87, no. 19, Article ID 198701, 2001. View at Publisher · View at Google Scholar · View at Scopus
  45. H. J. Herrmann, C. M. Schneider, A. A. Moreira, J. S. Andrade Jr., and S. Havlin, “Onion-like network topology enhances robustness against malicious attacks,” Journal of Statistical Mechanics: Theory and Experiment, vol. 2011, no. 1, Article ID P01027, 2011. View at Publisher · View at Google Scholar · View at Scopus
  46. C. M. Schneider, A. A. Moreira, J. S. Andrade Jr., S. Havlin, and H. J. Herrmann, “Mitigation of malicious attacks on networks,” Proceedings of the National Academy of Sciences of the United States of America, vol. 108, no. 10, pp. 3838–3841, 2011. View at Publisher · View at Google Scholar · View at Scopus
  47. R. M. Karp, “Reducibility among combinatorial problems,” in Complexity of Computer Computations, R. E. Miller and J. W. Thatcher, Eds., pp. 85–103, Springer, New York, NY, USA, 1972. View at Publisher · View at Google Scholar · View at MathSciNet
  48. A.-L. Barabási and R. Albert, “Emergence of scaling in random networks,” American Association for the Advancement of Science. Science, vol. 286, no. 5439, pp. 509–512, 1999. View at Publisher · View at Google Scholar · View at MathSciNet
  49. P. Holme, B. J. Kim, C. N. Yoon, and S. K. Han, “Attack vulnerability of complex networks,” Physical Review E, Statistical, Nonlinear, and Soft Matter Physics, vol. 65, no. 5, part 2, Article ID 056109, 2002. View at Publisher · View at Google Scholar · View at Scopus
  50. S. Iyer, T. Killingback, B. Sundaram, and Z. Wang, “Attack robustness and centrality of complex networks,” PLoS ONE, vol. 8, no. 4, Article ID e59613, 2013. View at Publisher · View at Google Scholar · View at Scopus
  51. U. Brandes, “A faster algorithm for betweenness centrality,” Journal of Mathematical Sociology, vol. 25, no. 2, pp. 163–177, 2001. View at Publisher · View at Google Scholar · View at Scopus
  52. F. Chung and L. Lu, “Connected components in random graphs with given expected degree sequences,” Annals of Combinatorics, vol. 6, no. 2, pp. 125–145, 2002. View at Publisher · View at Google Scholar · View at MathSciNet
  53. Y. S. Cho, J. S. Kim, J. Park, B. Kahng, and D. Kim, “Percolation transitions in scale-free networks under the achlioptas process,” Physical Review Letters, vol. 103, no. 13, Article ID 135702, 2009. View at Publisher · View at Google Scholar · View at Scopus
  54. R. A. Rossi and N. K. Ahmed, “The network data repository with interactive graph analytics and visualization,” in Proceedings of the 29th AAAI Conference on Artificial Intelligence, 2015.
  55. Pajek data sets, “Vladimir Batagelj and Andrej Mrvar,” 2006, http://vlado.fmf.uni-lj.si/pub/networks/data/.