1 code implementation • 12 Oct 2016 • Gennaro Cordasco, Luisa Gargano, Marco Mecchia, Adele A. Rescigno, Ugo Vaccaro
Given a network represented by a graph $G=(V, E)$, we consider a dynamical process of influence diffusion in $G$ that evolves as follows: Initially only the nodes of a given $S\subseteq V$ are influenced; subsequently, at each round, the set of influenced nodes is augmented by all the nodes in the network that have a sufficiently large number of already influenced neighbors.
Data Structures and Algorithms Social and Information Networks Combinatorics Physics and Society
