A Community-Aware Framework for Influence Maximization with Explicit Accounting for Inter-Community Influence
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866908804364369920 |
|---|---|
| author | Robson, Eliot W. Umrawal, Abhishek K. |
| author_facet | Robson, Eliot W. Umrawal, Abhishek K. |
| contents | Influence Maximization (IM) seeks to identify a small set of seed nodes in a social network to maximize expected information spread under a diffusion model. While community-based approaches improve scalability by exploiting modular structure, they typically assume independence between communities, overlooking inter-community influence$\unicode{x2014}$a limitation that reduces effectiveness in real-world networks. We introduce Community-IM++, a scalable framework that explicitly models cross-community diffusion through a principled heuristic based on community-based diffusion degree (CDD) and a progressive budgeting strategy. The algorithm partitions the network, computes CDD to prioritize bridging nodes, and allocates seeds adaptively across communities using lazy evaluation to minimize redundant computations. Experiments on large real-world social networks under different edge weight models show that Community-IM++ achieves near-greedy influence spread at up to 100 times lower runtime, while outperforming Community-IM and degree heuristics across budgets and structural conditions. These results demonstrate the practicality of Community-IM++ for large-scale applications such as viral marketing, misinformation control, and public health campaigns, where efficiency and cross-community reach are critical. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_23973 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A Community-Aware Framework for Influence Maximization with Explicit Accounting for Inter-Community Influence Robson, Eliot W. Umrawal, Abhishek K. Social and Information Networks Artificial Intelligence Machine Learning 05C85, 60J60, 68R05, 68R10, 68T01, 90C27, 90C35 F.2.2; G.1.6; G.2.1; G.2.2; G.3; I.2.0; J.4 Influence Maximization (IM) seeks to identify a small set of seed nodes in a social network to maximize expected information spread under a diffusion model. While community-based approaches improve scalability by exploiting modular structure, they typically assume independence between communities, overlooking inter-community influence$\unicode{x2014}$a limitation that reduces effectiveness in real-world networks. We introduce Community-IM++, a scalable framework that explicitly models cross-community diffusion through a principled heuristic based on community-based diffusion degree (CDD) and a progressive budgeting strategy. The algorithm partitions the network, computes CDD to prioritize bridging nodes, and allocates seeds adaptively across communities using lazy evaluation to minimize redundant computations. Experiments on large real-world social networks under different edge weight models show that Community-IM++ achieves near-greedy influence spread at up to 100 times lower runtime, while outperforming Community-IM and degree heuristics across budgets and structural conditions. These results demonstrate the practicality of Community-IM++ for large-scale applications such as viral marketing, misinformation control, and public health campaigns, where efficiency and cross-community reach are critical. |
| title | A Community-Aware Framework for Influence Maximization with Explicit Accounting for Inter-Community Influence |
| topic | Social and Information Networks Artificial Intelligence Machine Learning 05C85, 60J60, 68R05, 68R10, 68T01, 90C27, 90C35 F.2.2; G.1.6; G.2.1; G.2.2; G.3; I.2.0; J.4 |
| url | https://arxiv.org/abs/2512.23973 |