ON THIS PAGE

Divide-and-Conquer-Based Optimization of Propagation Paths in Complex Networks for New Media Marketing

Lili Hu1
1School of Economics and Management, Nanchang Institute of Science and Technology, Nanchang 330108, Jiangxi, China

Abstract

In the context of complex digital media ecosystems, effective dissemination of marketing content demands robust, adaptive, and structure-aware optimization strategies. This study proposes a novel framework—Complex Network Propagation with Divide-and-Conquer (CNP-Div)—designed to enhance information propagation in large-scale media networks by leveraging modular path optimization and probabilistic triplet modeling. The proposed model represents dissemination events as structured triplets (source, path, target) and formulates propagation likelihood as a function of source influence, platform channel weight, and audience receptivity. To address the computational difficulty of global optimization in dynamic media networks, a divide-and-conquer strategy is implemented: the global graph is partitioned into semantically coherent subgraphs, local path optimizations are executed within each, and a global aggregation phase ensures cross-community coherence. The framework further incorporates user feedback, platform centrality, and temporal factors to dynamically adjust propagation probabilities. Extensive experiments across simulated and real-world dissemination scenarios demonstrate that CNP-Div consistently outperforms baseline strategies—including random walk, greedy heuristics, and centrality-based models—across multiple metrics: propagation reach, average depth, engagement score, redundancy reduction, and runtime efficiency. Visualizations including heatmaps and precision–recall curves reveal that CNP-Div achieves more balanced content visibility across user activity phases and platform layers. Ablation results highlight the roles of triplet modeling, feedback reinforcement, and hierarchical path optimization in achieving these improvements.

Related Articles
Jiayu Sun1, Guan Yang2, Zhenguo Cao3, Wei Zhao4
1School of Economics, Guangzhou College of Commerce, Guangzhou, Guangdong, 511363, China
2School of Business, Guangzhou College of Technology and Business, Guangzhou, Guangdong 510850, China
3School of Educational Science and Technology, Guangzhou College of Technology and Business, Guangzhou, Guangdong, 528138, China
4School of Digital Economy Industry, Guangzhou College of Commerce, Guangzhou, Guangdong, 511363, China
Ravi Dubey1, Arpit Sharma2, Sharad Kumar Pandey3
1Advocate, Maahir Associates–Legal Solution, Lucknow, India
2School of Law, Forensic Justice and Policy Studies, National Forensic Sciences University, Delhi Campus, India
3Symbiosis Law School, Noida Campus, Symbiosis International (Deemed University), Pune, India
Da Li1, Jing Zhou2, Qiyan Tan1
1School of Arts, Nanchang University, Nanchang, Jiangxi 330027, China
2School of Music, Jiangxi Science and Technology Normal University, Nanchang, Jiangxi 330038, China
Mustafa Salah Hasan1
1College of Veterinary Medicine, University of Fallujah, Fallujah, Al-Anbar, Iraq
Jianna Huang1
1School of Foreign Languages, Hanshan Normal University, Chaozhou 521041, Guangdong, China

Citation

Lili Hu. Divide-and-Conquer-Based Optimization of Propagation Paths in Complex Networks for New Media Marketing[J], Archives Des Sciences, Volume 76, Issue 4, 2026. 26-37. DOI: https://doi.org/10.68304/as/76404.