arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1402.6273cs.SIphysics.soc-ph
收藏

解释网络扩散的快照:结构和硬度结果

Explaining Snapshots of Network Diffusions: Structural and Hardness Results

Georgios Askalidis, Randall A. Berry, Vijay G. Subramanian

摘要:

关于思想或技术在社交网络上的传播,包括\textit{Influence Maximization}问题及其许多变体,已经做了很多研究。在这里,我们研究一类反问题。给定扩散过程的快照,我们试图理解快照对于给定的动态是否可行,即,是否存在有限数量的节点,其初始采用可以导致有限时间内的快照。虽然类似的问题已经被认为是流行病的动力学,在这里,我们认为这个问题的变化的确定性线性阈值模型,这是更适合建模的战略代理。具体来说,我们考虑顺序和同时动态时,停用是允许的,当他们不。即使我们显示硬度的结果,我们考虑的所有变化,我们表明,顺序动态的情况下,允许停用是显着困难比所有其他的。相比之下,序列动力学使问题在集团上变得微不足道,即使它的复杂性是未知的。我们补充我们的硬度结果与结构的见解,可以帮助更好地理解各种动态下的社交网络的扩散。

英文摘要:

Much research has been done on studying the diffusion of ideas or technologies on social networks including the \textit{Influence Maximization} problem and many of its variations. Here, we investigate a type of inverse problem. Given a snapshot of the diffusion process, we seek to understand if the snapshot is feasible for a given dynamic, i.e., whether there is a limited number of nodes whose initial adoption can result in the snapshot in finite time. While similar questions have been considered for epidemic dynamics, here, we consider this problem for variations of the deterministic Linear Threshold Model, which is more appropriate for modeling strategic agents. Specifically, we consider both sequential and simultaneous dynamics when deactivations are allowed and when they are not. Even though we show hardness results for all variations we consider, we show that the case of sequential dynamics with deactivations allowed is significantly harder than all others. In contrast, sequential dynamics make the problem trivial on cliques even though it's complexity for simultaneous dynamics is unknown. We complement our hardness results with structural insights that can help better understand diffusions of social networks under various dynamics.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑