Research Article
Open access
Published on 6 May 2025
Download pdf
Zhang,J. (2025). Dynamic Social Network Optimization via a Hybrid Genetic Algorithm with MLE-Enhanced Fitness. Theoretical and Natural Science,105,47-60.
Export citation

Dynamic Social Network Optimization via a Hybrid Genetic Algorithm with MLE-Enhanced Fitness

Jiahao Zhang *,1,
  • 1 School of Science, North China University of Technology, Beijing, China

* Author to whom correspondence should be addressed.

https://doi.org/10.54254/2753-8818/2025.22569

Abstract

Dynamic social networks present significant challenges for rapid identification of high-impact nodes, which is crucial for effective information dissemination in scenarios such as emergency management and enterprise marketing. This study introduces a hybrid optimization framework, MLE-GA, that integrates maximum likelihood estimation (MLE) with traditional genetic algorithms (GA) to address these challenges. In the proposed two-layer architecture, the outer GA layer performs a global search to optimize candidate seed node combinations, while the inner MLE layer dynamically estimates network parameters in real time, thereby constructing a probabilistic model that guides the evolution of the solution. Simulation experiments, including tests on synthetic datasets and real-world networks like Zachary’s Karate Club, demonstrate that MLE-GA achieves an error rate below 5% for identifying high-influence nodes, significantly outperforming conventional MLE approaches. The results confirm that the hybrid method not only effectively distinguishes between high- and low-influence nodes but also adapts to rapid changes in network structure, ensuring efficient resource allocation and robust optimization in dynamic environments. These findings underscore the potential of MLE-GA as a universal solution for complex social network problems where timely and accurate decision-making is imperative.

Keywords

Genetic algorithms, Maximum likelihood estimation, Node influence identification

[1]. Srivastava, M., & Manju, M. (2024). Centrality of any node in social network analysis. In Proceedings of the 2024 Sixteenth International Conference on Contemporary Computing (IC3-2024) (pp. 497–501). Association for Computing Machinery.

[2]. Barnes, L. M., Sutcliffe, S., Muly, I., et al. (2025). Agency, social networks, and adaptation to environmental change. Global Environmental Change, 92, 102983.

[3]. Zhu, X., Liu, Z., Cambria, E., Yu, X., Fan, X., Chen, H., & Wang, R. (2025). A client–server based recognition system: Non-contact single/multiple emotional and behavioral state assessment methods. Computer Methods and Programs in Biomedicine, 260, 108564.

[4]. Wang, R., Zhu, J., Wang, S., Wang, T., Huang, J., & Zhu, X. (2024). Multi-modal emotion recognition using tensor decomposition fusion and self-supervised multi-tasking. International Journal of Multimedia Information Retrieval, 13(4), 39.

[5]. Wang, F., Ju, M., Zhu, X., Zhu, Q., Wang, H., Qian, C., & Wang, R. (2025). A geometric algebra-enhanced network for skin lesion detection with diagnostic prior. The Journal of Supercomputing, 81(1), 1–24.

[6]. Zhao, Z., Zhu, X., Wei, X., Wang, X., & Zuo, J. (2021, June). Application of workflow technology in the integrated management platform of smart park. In 2021 IEEE 4th Advanced Information Management, Communicates, Electronic and Automation Control Conference (IMCEC) (Vol. 4, pp. 1433–1437). IEEE.

[7]. Zhang, Y., Zhao, H., Zhu, X., Zhao, Z., & Zuo, J. (2019, October). Strain measurement quantization technology based on DAS system. In 2019 IEEE 3rd Advanced Information Management, Communicates, Electronic and Automation Control Conference (IMCEC) (pp. 214–218). IEEE.

[8]. Kundu, G., & Choudhury, S. (2025). Learning automata-enabled ant colony optimization for group influence maximization in social networks: A two-stage approach. Social Network Analysis and Mining, 15(1), 10–10.

[9]. Shappell, H., Kramer, M., Chu, C., et al. (2025). Accounting for edge uncertainty in stochastic actor-oriented models for dynamic network analysis. bioRxiv.

[10]. Huang, W. D., Wu, W., Bi, J., et al. (2025). Timeliness-aware rumor sources identification in community-structured dynamic online social networks. Information Sciences, 689, 121508.

Cite this article

Zhang,J. (2025). Dynamic Social Network Optimization via a Hybrid Genetic Algorithm with MLE-Enhanced Fitness. Theoretical and Natural Science,105,47-60.

Data availability

The datasets used and/or analyzed during the current study will be available from the authors upon reasonable request.

Disclaimer/Publisher's Note

The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of EWA Publishing and/or the editor(s). EWA Publishing and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

About volume

Volume title: Proceedings of the 3rd International Conference on Mathematical Physics and Computational Simulation

Conference website: https://2025.confmpcs.org/
ISBN:978-1-80590-077-1(Print) / 978-1-80590-078-8(Online)
Conference date: 27 June 2025
Editor:Anil Fernando
Series: Theoretical and Natural Science
Volume number: Vol.105
ISSN:2753-8818(Print) / 2753-8826(Online)

© 2024 by the author(s). Licensee EWA Publishing, Oxford, UK. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license. Authors who publish this series agree to the following terms:
1. Authors retain copyright and grant the series right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this series.
2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the series's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this series.
3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See Open access policy for details).