关于随机k-核的鲁棒性
On the robustness of random k-cores
摘要:
一个图的k-核心是它的最小度至少为k的极大子图。在本文中,我们解决了k核的鲁棒性问题。给定一个k-核,随机均匀地移除一条边并找到它的新k-核。我们感兴趣的是从原始k核中删除多少个顶点来找到新的顶点。这可以看作是原始k核的鲁棒性的度量。我们证明了,如果初始k-核是从具有n个顶点和m条边的k-核中均匀随机选择的,则其鲁棒性本质上取决于其平均度c。我们证明,如果c收敛到k,那么新的k-核是空的概率为1+o(1)。我们定义了一个常数c(k)′,使得当k+ ε < c < c(k ε ′-ε)时,新的k-核是空的,概率远离零,如果c > c(k ε ′ + ε,ε = ω(n^{-1/4}),psi(n)> 0且c有界,则新k-核具有小于n-h(n)个顶点的概率变为零,对于每个h(n)= omega(1/psi)。
英文摘要:
The k-core of a graph is its maximal subgraph with minimum degree at least k. In this paper, we address robustness questions about k-cores. Given a k-core, remove one edge uniformly at random and find its new k-core. We are interested in how many vertices are deleted from the original k-core to find the new one. This can be seem as a measure of robustness of the original k-core. We prove that, if the initial k-core is chosen uniformly at random from the k-cores with n vertices and m edges, its robustness depends essentially on its average degree c. We prove that, if c converges to k, then the new k-core is empty with probability 1+o(1). We define a constant c(k)' such that when k+epsilon < c < c(k)'- epsilon, the new k-core is empty with probability bounded away from zero and, if c > c(k)'+ psi with psi = omega(n^{-1/4}), psi(n) > 0 and c is bounded, then the probability that the new k-core has less than n-h(n) vertices goes to zero, for every h(n) = omega(1/psi).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。