arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1806.03134physics.soc-phcond-mat.dis-nncs.SImath.PR
收藏

随机网络中破坏$k$ -核的最小集合

On Minimal Sets to Destroy the $k$-Core in Random Networks

Christian Schmidt, Henry D. Pfister, Lenka Zdeborová

摘要:

我们研究的问题,找到最小的一组节点的网络中的删除结果在一个空的$k$ -核心,其中的$k$ -核心是子网络的迭代删除后得到的所有节点的度小于$k$。这个问题在文献中也被称为寻找最小传染集。我们工作的主要贡献是通过一组确定性微分方程分析了最近引入的随机网络上的cobold算法[Scientific Reports,6,37954(2016)]的性能。我们的分析提供了最小传染集的大小上界,提高了以前已知的界限。我们的第二个贡献是一个新的启发式称为弱邻居算法,优于所有目前已知的本地方法在考虑的制度。

英文摘要:

We study the problem of finding the smallest set of nodes in a network whose removal results in an empty $k$-core; where the $k$-core is the sub-network obtained after the iterative removal of all nodes of degree smaller than $k$. This problem is also known in the literature as finding the minimal contagious set. The main contribution of our work is an analysis of the performance of the recently introduced corehd algorithm [Scientific Reports, 6, 37954 (2016)] on random networks taken from the configuration model via a set of deterministic differential equations. Our analyses provides upper bounds on the size of the minimal contagious set that improve over previously known bounds. Our second contribution is a new heuristic called the weak-neighbor algorithm that outperforms all currently known local methods in the regimes considered.

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

↑