Maximizing Information Dissemination in Social Network via a Fast Local Search
In recent years, social networks have become increasingly popular as platforms for personal expression, commercial transactions, and government management. The way information propagates on these networks influences the quality and expenses of social network activities, garnering substantial interes...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-01-01
|
| Series: | Systems |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2079-8954/13/1/59 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832587461641895936 |
|---|---|
| author | Lijia Tian Xingjian Ji Yupeng Zhou |
| author_facet | Lijia Tian Xingjian Ji Yupeng Zhou |
| author_sort | Lijia Tian |
| collection | DOAJ |
| description | In recent years, social networks have become increasingly popular as platforms for personal expression, commercial transactions, and government management. The way information propagates on these networks influences the quality and expenses of social network activities, garnering substantial interest. This study addresses the enhancement of information spread in large-scale social networks constrained by resources, by framing the issue as a unique weighted <i>k</i>-vertex cover problem. To tackle this complex NP-hard optimization problem, a rapid local search algorithm named FastIM is introduced. A fast constructive heuristic is initially used to quickly find a starting solution, while a sampling selection method is incorporated to minimize complexity during the local search. When the algorithm stalls in local optima, a random walk operator reorients the search towards unexplored regions. Comparative tests highlight the proposed method’s robustness, scalability, and efficacy in maximizing information distribution across social networks. Moreover, strategy validation trials confirm that each element of the framework enhances its overall performance. |
| format | Article |
| id | doaj-art-de189de0eeef46e5ae6615b5c3eacab8 |
| institution | Kabale University |
| issn | 2079-8954 |
| language | English |
| publishDate | 2025-01-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Systems |
| spelling | doaj-art-de189de0eeef46e5ae6615b5c3eacab82025-01-24T13:50:40ZengMDPI AGSystems2079-89542025-01-011315910.3390/systems13010059Maximizing Information Dissemination in Social Network via a Fast Local SearchLijia Tian0Xingjian Ji1Yupeng Zhou2School of Politics and Law, Northeast Normal University, Changchun 130117, ChinaSchool of Information Science and Technology, Northeast Normal University, Changchun 130117, ChinaSchool of Information Science and Technology, Northeast Normal University, Changchun 130117, ChinaIn recent years, social networks have become increasingly popular as platforms for personal expression, commercial transactions, and government management. The way information propagates on these networks influences the quality and expenses of social network activities, garnering substantial interest. This study addresses the enhancement of information spread in large-scale social networks constrained by resources, by framing the issue as a unique weighted <i>k</i>-vertex cover problem. To tackle this complex NP-hard optimization problem, a rapid local search algorithm named FastIM is introduced. A fast constructive heuristic is initially used to quickly find a starting solution, while a sampling selection method is incorporated to minimize complexity during the local search. When the algorithm stalls in local optima, a random walk operator reorients the search towards unexplored regions. Comparative tests highlight the proposed method’s robustness, scalability, and efficacy in maximizing information distribution across social networks. Moreover, strategy validation trials confirm that each element of the framework enhances its overall performance.https://www.mdpi.com/2079-8954/13/1/59social networkinformation dissemination maximizationweighted <i>k</i>-vertex coversampling selectionlocal search |
| spellingShingle | Lijia Tian Xingjian Ji Yupeng Zhou Maximizing Information Dissemination in Social Network via a Fast Local Search Systems social network information dissemination maximization weighted <i>k</i>-vertex cover sampling selection local search |
| title | Maximizing Information Dissemination in Social Network via a Fast Local Search |
| title_full | Maximizing Information Dissemination in Social Network via a Fast Local Search |
| title_fullStr | Maximizing Information Dissemination in Social Network via a Fast Local Search |
| title_full_unstemmed | Maximizing Information Dissemination in Social Network via a Fast Local Search |
| title_short | Maximizing Information Dissemination in Social Network via a Fast Local Search |
| title_sort | maximizing information dissemination in social network via a fast local search |
| topic | social network information dissemination maximization weighted <i>k</i>-vertex cover sampling selection local search |
| url | https://www.mdpi.com/2079-8954/13/1/59 |
| work_keys_str_mv | AT lijiatian maximizinginformationdisseminationinsocialnetworkviaafastlocalsearch AT xingjianji maximizinginformationdisseminationinsocialnetworkviaafastlocalsearch AT yupengzhou maximizinginformationdisseminationinsocialnetworkviaafastlocalsearch |