arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1807.08630cs.CCphysics.soc-ph
收藏

SIS过程的极大似然网络重构是NP困难的

Maximum-Likelihood Network Reconstruction for SIS Processes is NP-Hard

Bastian Prasse, Piet Van Mieghem

摘要:

网络拓扑结构的知识是必要的,以精确地描述SIS流行过程的病毒动力学。在网络拓扑结构未知的情况下,人们可以通过观察病毒状态轨迹来重建网络。这项工作的重点是病毒状态的观察结果的计算复杂性的网络重建问题的影响。我们提出了一种新的方法,构建一个特定的类的病毒状态的痕迹,从中推断的存在或不存在的链接是容易或困难的。特别是,我们使用这种结构来证明最大似然SIS网络重建是NP-难的。NP-困难性对连通图的任何邻接矩阵都成立。

英文摘要:

The knowledge of the network topology is imperative to precisely describing the viral dynamics of an SIS epidemic process. In scenarios for which the network topology is unknown, one resorts to reconstructing the network from observing the viral state trace. This work focusses on the impact of the viral state observations on the computational complexity of the resulting network reconstruction problem. We propose a novel method of constructing a specific class of viral state traces from which the inference of the presence or absence of links is either easy or difficult. In particular, we use this construction to prove that the maximum-likelihood SIS network reconstruction is NP-hard. The NP-hardness holds for any adjacency matrix of a graph which is connected.

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

↑