如何传播病毒:便宜而快速
How to go Viral: Cheaply and Quickly
摘要:
给定一个由图$G$表示的社会网络,我们考虑寻找一个有界的节点集$S$的问题,该节点集具有从$S$到$G$的影响传播尽可能大的性质.控制影响力扩散的动态如下:最初只有$S$中的元素受到影响;随后在每一轮,受影响元素的集合被网络中具有足够多的已受影响邻居的所有节点所增加。虽然它是已知的,一般的问题是很难解决-即使在近似意义上-我们提出了确切的多项式时间算法的树,路径,循环,和完整的图形。
英文摘要:
Given a social network represented by a graph $G$, we consider the problem of finding a bounded cardinality set of nodes $S$ with the property that the influence spreading from $S$ in $G$ is as large as possible. The dynamics that govern the spread of influence is the following: initially only elements in $S$ are influenced; subsequently at each round, the set of influenced elements is augmented by all nodes in the network that have a sufficiently large number of already influenced neighbors. While it is known that the general problem is hard to solve --- even in the approximate sense --- we present exact polynomial time algorithms for trees, paths, cycles, and complete graphs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。