通信学报 ›› 2015, Vol. 36 ›› Issue (1): 224-229.doi: 10.11959/j.issn.1000-436x.2015025

• 学术通信 • 上一篇    下一篇

复杂网络中k-核与网络聚集系数的关联性研究

刘君,乔建志   

  1. 东北大学 信息科学与工程学院,辽宁 沈阳 110819
  • 出版日期:2015-01-25 发布日期:2017-06-21
  • 基金资助:
    国家自然科学基金资助项目

Research on relevance between k-core and clustering coefficient in complex network

Jun LIU,Jian-zhong QIAO   

  1. School of Information Science & Engineering,Northeastern University,Shenyang 110819,China
  • Online:2015-01-25 Published:2017-06-21
  • Supported by:
    The National Natural Science Foundation of China

摘要:

选取复杂网络特征变量—聚集系数为研究目标,通过数学推导与证明,清晰描述了k-核与聚集系数的关联性。通过仿真实验证明,随着k-核的不断解析、k值的不断增加,网络聚集系数亦呈现逐步增加的趋势。该结论为k-核解析在复杂网络中的进一步应用提供相应的理论基础与指导。

关键词: 复杂网络, k-核, 聚集系数, 关联性

Abstract:

K-core analysis is an effective way to simplify the graphic topological structure.Many researches considered that the higher value k is,the more important the core is in complex network.But the relevance analysis between k-core and clustering coefficient has not been made.Experimental results show that with the k-core analysis,the trend of the clustering coefficient is consistent with k.The proposed conclusions can provide theoretical basis and guidance for the future applications of k-core analysis in complex network.

Key words: complex network, k-core, clustering coefficient, relevance