摘要翻译：
在许多网络应用中，节点至少有k个邻居是稳定的，由k个稳定节点组成的网络称为k核。对随机攻击的脆弱性是由随机选择的k核节点被移除后发生的扑杀雪崩的大小来表征的。对二维、三维和四维晶格以及小世界网络的模拟表明，幂律雪崩发生在一阶k核系统中，而截断雪崩是二阶情形的特征。
---
英文标题：
《Dynamics of k-core percolation》
---
作者：
C. L. Farrow and P. Shukla and P. M. Duxbury
---
最新提交年份：
2008
---
分类信息：

一级分类：Physics        物理学
二级分类：Statistical Mechanics        统计力学
分类描述：Phase transitions, thermodynamics, field theory, non-equilibrium phenomena, renormalization group and scaling, integrable models, turbulence
相变，热力学，场论，非平衡现象，重整化群和标度，可积模型，湍流
--

---
英文摘要：
  In many network applications nodes are stable provided they have at least k neighbors, and a network of k-stable nodes is called a k-core. The vulnerability to random attack is characterized by the size of culling avalanches which occur after a randomly chosen k-core node is removed. Simulations of lattices in two, three and four dimensions, as well as small world networks, indicate that power-law avalanches occur in first order k-core systems, while truncated avalanches are characteristic of second order cases.
---
PDF链接：
https://arxiv.org/pdf/801.3644