Skip to main content
Springer Nature Link
Log in

A Memetic Algorithm for Solving the Robust Influence Problem on Directed Networks

  • Conference paper
  • First Online:
Advances in Swarm Intelligence (ICSI 2023)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13968))

Included in the following conference series:

  • 591 Accesses

Abstract

The influence maximization problem has been intensively emphasized in recent studies, and the robust influence maximization problem is aimed at studying the information spreading ability of seeds under external attacks which is a current research hotspot. Elaborate diffusion models and seed determination methods are developed in previous studies. As a general form of networked systems, the plain undirected networks are thoroughly investigated. However, as indicated by related researches, directed networks show significance in daily life. Existing models and determination methods omit the effect of directness of networks, which may cause barriers in applications. Therefore, in order to study the influence robustness of directed networks, a metric, \( R_{SD} \), is proposed to evaluate the robustness of influence pertaining to certain seeds in networks with directness. Then, a Memetic algorithm is devised to calculate the robust influence ability of seeds under intentional attacks, named MA-RIM\(_\text {D}\). The algorithm considers networks with directed links, and several problem-directed operators are maintained. Experimental results on several networks demonstrate that the algorithm exhibits a competitive convergence compared with existing approaches, and superior optimized results can be attained.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Albert, R., Barabási, A.L.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74(1), 47 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  2. Barabási, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509–512 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  3. Chen, W., Lin, T., Tan, Z., Zhao, M., Zhou, X.: Robust influence maximization. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 795–804 (2016)

    Google Scholar 

  4. Chen, W., Wang, Y., Yang, S.: Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 199–208 (2009)

    Google Scholar 

  5. Deep, K., Thakur, M.: A new mutation operator for real coded genetic algorithms. Appl. Math. Comput. 193(1), 211–230 (2007)

    MathSciNet  MATH  Google Scholar 

  6. Erdős, P., Rényi, A., et al.: On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci 5(1), 17–60 (1960)

    MathSciNet  MATH  Google Scholar 

  7. Gong, M., Yan, J., Shen, B., Ma, L., Cai, Q.: Influence maximization in social networks based on discrete particle swarm optimization. Inf. Sci. 367, 600–614 (2016)

    Article  Google Scholar 

  8. Holme, P., Kim, B.J., Yoon, C.N., Han, S.K.: Attack vulnerability of complex networks. Phys. Rev. E 65(5), 056109 (2002)

    Article  Google Scholar 

  9. Huang, D., Tan, X., Chen, N., Fan, Z.: A memetic algorithm for solving the robust influence maximization problem on complex networks against structural failures. Sensors 22(6), 2191 (2022)

    Article  Google Scholar 

  10. Kempe, D., Kleinberg, J., Tardos, É.: Maximizing the spread of influence through a social network. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 137–146 (2003)

    Google Scholar 

  11. Lee, J.R., Chung, C.W.: A fast approximation for influence maximization in large social networks. In: Proceedings of the 23rd International Conference on World Wide Web, pp. 1157–1162 (2014)

    Google Scholar 

  12. Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J., Glance, N.: Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 420–429 (2007)

    Google Scholar 

  13. Lim, S.M., Sultan, A.B.M., Sulaiman, M.N., Mustapha, A., Leong, K.Y.: Crossover and mutation operators of genetic algorithms. Int. J. Mach. Learn. Comput. 7(1), 9–12 (2017)

    Article  Google Scholar 

  14. Liu, X., Stanley, H.E., Gao, J.: Breakdown of interdependent directed networks. Proc. Natl. Acad. Sci. 113(5), 1138–1143 (2016)

    Article  Google Scholar 

  15. Nepusz, T., Vicsek, T.: Controlling edge dynamics in complex networks. Nat. Phys. 8(7), 568–573 (2012)

    Article  Google Scholar 

  16. Schneider, C.M., Moreira, A.A., Andrade, J.S., Jr., Havlin, S., Herrmann, H.J.: Mitigation of malicious attacks on networks. Proc. Natl. Acad. Sci. 108(10), 3838–3841 (2011)

    Article  Google Scholar 

  17. Son, S.W., Kim, B.J., Hong, H., Jeong, H.: Dynamics and directionality in complex networks. Phys. Rev. Lett. 103(22), 228702 (2009)

    Article  Google Scholar 

  18. Umbarkar, A.J., Sheth, P.D.: Crossover operators in genetic algorithms: a review. ICTACT J. Soft Comput. 6(1) (2015)

    Google Scholar 

  19. Wang, B., Gao, L., Gao, Y., Deng, Y.: Maintain the structural controllability under malicious attacks on directed networks. Europhys. Lett. 101(5), 58003 (2013)

    Article  Google Scholar 

  20. Wang, S., Liu, J.: A multi-objective evolutionary algorithm for promoting the emergence of cooperation and controllable robustness on directed networks. IEEE Trans. Netw. Sci. Eng. 5(2), 92–100 (2017)

    Article  MathSciNet  Google Scholar 

  21. Wang, S., Liu, J.: Constructing robust community structure against edge-based attacks. IEEE Syst. J. 13(1), 582–592 (2018)

    Article  Google Scholar 

  22. Wang, S., Liu, J.: A memetic algorithm for solving the robust influence maximization problem towards network structural perturbances. Chin. J. Comput. 44(6), 1153–1167 (2021)

    Google Scholar 

  23. Wang, S., Liu, J., Jin, Y.: Finding influential nodes in multiplex networks using a memetic algorithm. IEEE Trans. Cybern. 51(2), 900–912 (2019)

    Article  Google Scholar 

  24. Wang, S., Tan, X.: Determining seeds with robust influential ability from multi-layer networks: a multi-factorial evolutionary approach. Knowl.-Based Syst. 246, 108697 (2022)

    Article  Google Scholar 

  25. Wang, W.X., Ni, X., Lai, Y.C., Grebogi, C.: Optimizing controllability of complex networks by minimum structural perturbations. Phys. Rev. E 85(2), 026115 (2012)

    Article  Google Scholar 

  26. Watts, D.J., Strogatz, S.H.: Collective dynamics of ‘small-world’ networks. Nature 393(6684), 440–442 (1998)

    Article  MATH  Google Scholar 

  27. Zeng, A., Liu, W.: Enhancing network robustness against malicious attacks. Phys. Rev. E 85(6), 066130 (2012)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

This work was supported in part by Guangdong Basic and Applied Basic Research Foundation under Grant 2021A1515110543, and in part by National Natural Science Foundation of China under Grant 62203477.

Author information

Authors and Affiliations

  1. School of Intelligent Systems Engineering, Sun Yat-sen University, Shenzhen, 518107, China

    Zhaoxi Ou, Shuai Wang & Shun Cai

Authors
  1. Zhaoxi Ou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shuai Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shun Cai
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shuai Wang .

Editor information

Editors and Affiliations

  1. Peking University, Beijing, China

    Ying Tan

  2. Southern University of Science and Technology, Shenzhen, China

    Yuhui Shi

  3. Harbin Institute of Technology, Shenzhen, China

    Wenjian Luo

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Ou, Z., Wang, S., Cai, S. (2023). A Memetic Algorithm for Solving the Robust Influence Problem on Directed Networks. In: Tan, Y., Shi, Y., Luo, W. (eds) Advances in Swarm Intelligence. ICSI 2023. Lecture Notes in Computer Science, vol 13968. Springer, Cham. https://doi.org/10.1007/978-3-031-36622-2_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-36622-2_22

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-36621-5

  • Online ISBN: 978-3-031-36622-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics