Related papers: On some tractable and hard instances for partial i…
Many phenomena in real world social networks are interpreted as spread of influence between activated and non-activated network elements. These phenomena are formulated by combinatorial graphs, where vertices represent the elements and…
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…
Let $G$ be a graph and ${\mathcal{\tau}}: V(G)\rightarrow \Bbb{N}\cup \{0\}$ be an assignment of thresholds to the vertices of $G$. A subset of vertices $D$ is said to be a dynamic monopoly corresponding to $(G, \tau)$ if the vertices of…
Let $G$ be a directed graph such that the in-degree of any vertex $G$ is at least one. Let also ${\mathcal{\tau}}: V(G)\rightarrow \Bbb{N}$ be an assignment of thresholds to the vertices of $G$. A subset $M$ of vertices of $G$ is called a…
A widely studied model of influence diffusion in social networks represents the network as a graph $G=(V,E)$ with an influence threshold $t(v)$ for each node. Initially the members of an initial set $S\subseteq V$ are influenced. During…
For a graph $G$ and an integer-valued function $\tau$ on its vertex set, a dynamic monopoly is a set of vertices of $G$ such that iteratively adding to it vertices $u$ of $G$ that have at least $\tau(u)$ neighbors in it eventually yields…
For a graph $G$ and an integer-valued threshold function $\tau$ on its vertex set, a dynamic monopoly is a set of vertices of $G$ such that iteratively adding to it vertices $u$ of $G$ that have at least $\tau(u)$ neighbors in it eventually…
In many real-world scenarios, an individual's local social network carries significant influence over the opinions they form and subsequently propagate. In this paper, we propose a novel diffusion model -- the Pressure Threshold model (PT)…
A widely studied process of influence diffusion in social networks posits that the dynamics of influence diffusion evolves as follows: Given a graph $G=(V,E)$, representing the network, initially \emph{only} the members of a given…
In this paper, we consider the problem of maximizing the spread of influence through a social network. Given a graph with a threshold value~$thr(v)$ attached to each vertex~$v$, the spread of influence is modeled as follows: A vertex~$v$…
Given a simple, undirected graph $G$ with a threshold function $\tau:V(G) \rightarrow \mathbb{N}$, the \textsc{Target Set Selection} (TSS) problem is about choosing a minimum cardinality set, say $S \subseteq V(G)$, such that starting a…
Various kinds of spread of influence occur in real world social and virtual networks. These phenomena are formulated by activation processes and irreversible dynamic monopolies in combinatorial graphs representing the topology of the…
The spread of influence in social networks is studied in two main categories: the progressive model and the non-progressive model (see e.g. the seminal work of Kempe, Kleinberg, and Tardos in KDD 2003). While the progressive models are…
Dynamic monopolies were already defined and studied for the formulation of the phenomena of the spread of influence in social networks such as disease, opinion, adaptation of new product and etc. The elements of the network which have been…
We consider a dynamic model for competition in a social network, where two strategic agents have fixed beliefs and the non-strategic/regular agents adjust their states according to a distributed consensus protocol. We suppose that one…
Our work bridges the literature on incentive-compatible mechanism design and the literature on diffusion algorithms. We introduce the study of finding an incentive-compatible (strategy-proof) mechanism for selecting an influential vertex in…
Let $G$ be a graph and $\tau$ be an assignment of nonnegative integer thresholds to the vertices of $G$. A subset of vertices $D$ is said to be a $\tau$-dynamic monopoly, if $V(G)$ can be partitioned into subsets $D_0, D_1, \ldots, D_k$…
We consider the problem of controlling a partially-observed dynamic process on a graph by a limited number of interventions. This problem naturally arises in contexts such as scheduling virus tests to curb an epidemic; targeted marketing in…
In this paper, we study the Target Set Selection problem from a parameterized complexity perspective. Here for a given graph and a threshold for each vertex, the task is to find a set of vertices (called a target set) which activates the…
We study a combinatorial model of the spread of influence in networks that generalizes existing schemata recently proposed in the literature. In our model, agents change behaviors/opinions on the basis of information collected from their…