Abstract
Let \(G=(V, E)\) be a graph that represents an underlying network. Let \(\tau \) (resp. \({\textbf{p}}\)) be an assignment of non-negative integers as thresholds (resp. incentives) to the vertices of G. The discrete time activation process with incentives corresponding to \((G, \tau , {\textbf{p}})\) is the following. First, all vertices u with \({\textbf{p}}(u)\ge \tau (u)\) are activated. Then at each time t, every vertex u gets activated if the number of previously activated neighbors of u plus \({\textbf{p}}(u)\) is at least \(\tau (v)\). The optimal target vector problem (OTV) is to find the minimum total incentives \({\sum }_{v\in V} {\textbf{p}}(v)\) that activates the whole network. We extend this model of activation with incentives, for graphs with weighted edges such that the spread of activation in the network depends on the weight of influence between any two participants. The new version is more realistic for the real world networks. We first prove that the new problem OTVW, is \(\texttt {NP}\)-complete even for the complete graphs. Two lower bounds for the minimum total incentives are presented. Next, we prove that OTVW has polynomial time solutions for (weighted) path and cycle graphs. Finally, we extend the discussed model and OTV, for bi-directed graphs with weighted edges and prove that to obtain the optimal target vector in weighted bi-directed paths and cycles has polynomial time solutions.
Similar content being viewed by others
Data availability
No data are used in the paper.
References
Ackerman E, Ben-Zwi O, Wolfovitz G (2010) Combinatorial model and bounds for target set selection. Theor Comput Sci 411:4017–4022
Chen N (2009) On the approximability of influence in social networks. SIAM J Discrete Math 23:1400–1415
Cordasco G, Gargano L, Rescigno AA, Vaccaro U (2015) Optimizing spread of influence in social networks via partial incentives. In: International colloquium on structural information and communication complexity, pp 119–134
Cordasco G, Gargano L, Rescigno AA (2019) Active influence spreading in social networks. Theor Comput Sci 764:15–29
Cordasco G, Gargano L, Lafond M, Narayanan L, Rescigno AA, Vaccaro U, Wu K (2020a) Whom to befriend to influence people. Theor Comput Sci 810:26–42
Cordasco G, Gargano L, Peters JG, Rescigno AA, Vaccaro U (2020b) Fast and frugal targeting with incentives. Theor Comput Sci 812:62–79
Demaine ED, Hajiaghayi M, Mahini H, Malec DL, Raghavan S, Sawant A, Zadimoghadam M (2014) How to influence people with partial incentives. In: Proceedings of the 23rd international conference on World wide web, pp 937–948
Dreyer PA, Roberts FS (2009) Irreversible \(k\)-threshold processes: graph-theoretical threshold models of the spread of disease and of opinion. Discrete Appl Math 157:1615–1627
Ehard S, Rautenbach D (2019) On some tractable and hard instances for partial incentives and target set selection. Discrete Optim 34:100547
Feige U, Kogan Sh (2021) Target set selection for conservative populations. Discrete Appl Math 305:119–132
Flocchini P, Kralovic R, Roncato A, Ruzicka P, Santoro N (2003) On time versus size for monotone dynamic monopolies in regular topologies. J Discrete Algorithms 1:129–150
Günneç D, Raghavan S, Zhang R (2020a) A branch-and-cut approach for the least cost influence problem on social networks. Networks 76:84–105
Günneç D, Raghavan S, Zhang R (2020b) Least-cost influence maximization on social networks. INFORMS J Comput 32:289–302
Kempe D, Kleinberg J, Tardos É (2015) Maximizing the spread of influence through a social network. Theory Comput 11:105–147
Khoshkhah K, Soltani H, Zaker M (2012) On dynamic monopolies of graphs: the average and strict majority thresholds. Discrete Optim 9:77–83
Khoshkhah K, Soltani H, Zaker M (2014) Dynamic monopolies in directed graphs: spread of unilateral influence in social networks. Discrete Appl Math 171:81–89
Melo RS, Vignatti AL, Miyazawa FK, Ota MJ (2023) Combinatorial dual bounds on the least cost influence problem. Pesquisa Operacional 43:e275468
Narayanan L, Wu K (2020) How to choose friends strategically. Theor Comput Sci 811:99–111
Raghavan S, Zhang R (2021) Weighted target set selection on trees and cycles. Networks 77:587–609
Zaker M (2012) On dynamic monopolies of graphs with general thresholds. Discrete Math 312:1136–1143
Zaker M (2013) Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs. Discrete Appl Math 161:2716–2723
Zaker M (2020) On irreversible spread of influence in edge-weighted graphs. Contrib Discrete Math 15:60–72
Acknowledgements
We thank the anonymous reviewers of the paper for useful comments.
Funding
The authors declare that no funds, grants, or other support were received during the preparation of this manuscript.
Author information
Authors and Affiliations
Contributions
All authors have equal contributions in this paper. All authors read and approved the final manuscript.
Corresponding author
Ethics declarations
Conflict of interest
The authors have no relevant financial or non-financial interests to disclose.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Askari, S., Zaker, M. Spread of influence with incentives in edge-weighted graphs with emphasis on some families of graphs. J Comb Optim 47, 61 (2024). https://doi.org/10.1007/s10878-024-01164-4
Accepted:
Published:
DOI: https://doi.org/10.1007/s10878-024-01164-4
Keywords
- Target set selection
- Dynamic monopoly
- Target vector
- Spread of influence
- Edge-weighted graphs
- Directed graphs