It is well-documented that social networks play a considerable role in information spreading. The dynamic processes governing the diffusion of information have been studied in many fields, including epidemiology, sociology, economics, and computer science. A widely studied problem in the area of viral marketing is the target set selection: in order to market a new product, hoping it will be adopted by a large fraction of individuals in the network, which set of individuals should we “target” (for instance, by offering them free samples of the product)? In this paper, we introduce a diffusion model in which some of the neighbors of a node have a negative influence on that node, namely, they induce the node to reject the feature that is supposed to be spread. We study the target set selection problem within this model, first proving a strong inapproximability result holding also when the diffusion process is required to reach all the nodes in a couple of rounds. Then, we consider a set of restrictions under which the problem is approximable to some extent.
Di Ianni, M., & Varricchio, G. (2020). Latency-bounded target set selection in signed networks. ALGORITHMS, 13(2) [10.3390/a13020032].
|Tipologia:||Articolo su rivista|
|Citazione:||Di Ianni, M., & Varricchio, G. (2020). Latency-bounded target set selection in signed networks. ALGORITHMS, 13(2) [10.3390/a13020032].|
|Settore Scientifico Disciplinare:||Settore INF/01|
|Revisione (peer review):||Esperti anonimi|
|Digital Object Identifier (DOI):||http://dx.doi.org/10.3390/a13020032|
|Stato di pubblicazione:||Pubblicato|
|Data di pubblicazione:||2020|
|Titolo:||Latency-bounded target set selection in signed networks|
|Autori:||Di Ianni, M; Varricchio, G|
|Appare nelle tipologie:||01 - Articolo su rivista|