4 citations · 6 across the 7 of their papers we have counts for
5 papers
How to Find a Joint Probability Distribution of Minimum Entropy (almost) given the Marginals
Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro
Given two discrete random variables and , with probability distributions and , respectively, denote by ${\cal C}(…
Whom to befriend to influence people
Gennaro Cordasco, Luisa Gargano, Manuel Lafond +4
Alice wants to join a new social network, and influence its members to adopt a new product or idea. Each person in the network has a certain threshold for {\em activatio…
Evangelism in Social Networks: Algorithms and Complexity
Gennaro Cordasco, Luisa Gargano, Adele Anna Rescigno +1
We consider a population of interconnected individuals that, with respect to a piece of information, at each time instant can be subdivided into three (time-dependent) categories:…
Discovering Small Target Sets in Social Networks: A Fast and Effective Algorithm
Gennaro Cordasco, Luisa Gargano, Marco Mecchia +2
Given a network represented by a graph , we consider a dynamical process of influence diffusion in that evolves as follows: Initially only the nodes of a given $S\subs…
How to go Viral: Cheaply and Quickly
Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano +3
Given a social network represented by a graph , we consider the problem of finding a bounded cardinality set of nodes with the property that the influence spreading from …