更改

跳到导航 跳到搜索
添加22字节 、 2025年6月15日 (日) 10:11
第100行: 第100行:  
<math>y=f(y)=1 - \sum_{m=0}^{k-2} \frac {y^m}{m!}·G_1^{(m)}(1-y)</math></br>
 
<math>y=f(y)=1 - \sum_{m=0}^{k-2} \frac {y^m}{m!}·G_1^{(m)}(1-y)</math></br>
 
下图表示基于以上关系得到的ER网络上最大k-core的变化情况:当k=2时是连续变化,<math>k \ge 3</math>时是非连续变化</br>
 
下图表示基于以上关系得到的ER网络上最大k-core的变化情况:当k=2时是连续变化,<math>k \ge 3</math>时是非连续变化</br>
−
[[文件:ER网络的kcore相变.png|缩略图|ER网络的k-core变化]]
+
[[文件:ER网络的kcore相变.png|缩略图|ER网络的k-cored大小与平均度的关系]]
    
Wu 等人<ref name='nbeb related'>{{Cite journal| publisher = arXiv| doi = 10.48550/arXiv.1811.04295| last1 = Wu| first1 = Rui-jie| last2 = Kong| first2 = Yi-Xiu| last3 = Shi| first3 = Gui-yuan| last4 = Zhang| first4 = Yi-Cheng| title = Using NonBacktracking Expansion to Analyze k-core Pruning Process| date = 2018-11-10| url = http://arxiv.org/abs/1811.04295}}</ref>指出非回溯扩展分支(NBEB)方法能够处理度相关网络,并且通过在多种网络上的数值模拟验证了其结果的正确性。在此基础上,Wu等人<ref name='nbeb multilayer'>{{Cite journal| publisher = arXiv| doi = 10.48550/arXiv.1812.11111| last1 = Wu| first1 = Rui-jie| last2 = Kong| first2 = Yi-Xiu| last3 = Shi| first3 = Gui-Yuan| last4 = Zhang| first4 = Yi-Cheng| title = Analytical Results of k-core Pruning Process on Multi-layer Networks| access-date = 2025-06-15| url = http://arxiv.org/abs/1812.11111}}</ref>进一步拓展了NBEB方法,不仅解决了多层网络中的k核剪枝过程问题,还提出了"多色非回溯扩展分支"(MNEB)算法。该方法可分析从最简单的非关联多层网络,到同时存在层内与层间关联的最复杂情况。</br>
 
Wu 等人<ref name='nbeb related'>{{Cite journal| publisher = arXiv| doi = 10.48550/arXiv.1811.04295| last1 = Wu| first1 = Rui-jie| last2 = Kong| first2 = Yi-Xiu| last3 = Shi| first3 = Gui-yuan| last4 = Zhang| first4 = Yi-Cheng| title = Using NonBacktracking Expansion to Analyze k-core Pruning Process| date = 2018-11-10| url = http://arxiv.org/abs/1811.04295}}</ref>指出非回溯扩展分支(NBEB)方法能够处理度相关网络,并且通过在多种网络上的数值模拟验证了其结果的正确性。在此基础上,Wu等人<ref name='nbeb multilayer'>{{Cite journal| publisher = arXiv| doi = 10.48550/arXiv.1812.11111| last1 = Wu| first1 = Rui-jie| last2 = Kong| first2 = Yi-Xiu| last3 = Shi| first3 = Gui-Yuan| last4 = Zhang| first4 = Yi-Cheng| title = Analytical Results of k-core Pruning Process on Multi-layer Networks| access-date = 2025-06-15| url = http://arxiv.org/abs/1812.11111}}</ref>进一步拓展了NBEB方法,不仅解决了多层网络中的k核剪枝过程问题,还提出了"多色非回溯扩展分支"(MNEB)算法。该方法可分析从最简单的非关联多层网络,到同时存在层内与层间关联的最复杂情况。</br>
281

个编辑

导航菜单