浏览全部资源
扫码关注微信
东北大学 信息科学与工程学院,辽宁 沈阳 110819
[ "刘君(1982-),女,山东潍坊人,博士,东北大学讲师,主要研究方向为复杂网络、分布式计算等。" ]
[ "乔建忠(1964-),男,辽宁沈阳人,博士,东北大学教授、博士生导师,主要研究方向为网格计算、分布式计算等。" ]
网络出版日期:2015-01,
纸质出版日期:2015-01-25
移动端阅览
刘君, 乔建志. 复杂网络中k-核与网络聚集系数的关联性研究[J]. 通信学报, 2015,36(1):224-229.
Jun LIU, Jian-zhong QIAO. Research on relevance between k-core and clustering coefficient in complex network[J]. Journal on communications, 2015, 36(1): 224-229.
刘君, 乔建志. 复杂网络中k-核与网络聚集系数的关联性研究[J]. 通信学报, 2015,36(1):224-229. DOI: 10.11959/j.issn.1000-436x.2015025.
Jun LIU, Jian-zhong QIAO. Research on relevance between k-core and clustering coefficient in complex network[J]. Journal on communications, 2015, 36(1): 224-229. DOI: 10.11959/j.issn.1000-436x.2015025.
选取复杂网络特征变量—聚集系数为研究目标,通过数学推导与证明,清晰描述了k-核与聚集系数的关联性。通过仿真实验证明,随着k-核的不断解析、k值的不断增加,网络聚集系数亦呈现逐步增加的趋势。该结论为k-核解析在复杂网络中的进一步应用提供相应的理论基础与指导。
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.
汪小帆 , 李翔 , 陈关荣 . 复杂网络理论及其应用 [M ] . 北京 : 清华大学出版社 , 2006 . 49 - 70 .
WANG X F , LI X , CHEN G R . Theory and Applications of Complex Network [M ] . Beijing : Tsinghua University Press , 2006 . 49 - 70 .
SONG C , HAVLIN S , MAKSE H A . Origins of fractality in the growth of complex network [J ] . Nature Physics , 2006 , 2 ( 4 ): 275 - 281 .
GOH K I , SALVI G , KAHNG B , et al . Skeleton and fractal scaling in complex networks [J ] . Physical Review Letters , 2006 , 96 :018701
GUO Q Z , et al . Exploring the local connectivity preference in Internet AS level topology [J ] . Piscataway , 2007 , 13 ( 1 ): 6439 - 6445 .
ZEGURA E W , CALVERT K L , DONAHOO M I . A quantitative comparison of graph-based models for internet topology [J ] . IEEE/ACM Trans on Networking , 1997 , 5 ( 6 ): 770 - 783 .
ONNELA J , SARAMAKI , HYVONEN J . Structure and tie strengths in mobile commutation networks [J ] . PNAS , 2007 , 104 ( 18 ): 7332 - 7336 .
BARCELÓ J M , NIETO-HIPÓLITO J I , GARCIA-VIDAL J . Study of Internet autonomous system interconnectivity from BGP routing tables [J ] . Computer Networks , 2004 , 45 ( 3 ): 333 - 344 .
DIMITROPOULOS X , KRIOUKOV D , FOMENKOV M , et al . AS relationships:inference and validation [J ] . SIGCOMM Computer Communications Review , 2007 , 37 ( 1 ): 29 - 40 .
PARK S T , PENNOCK D M , GILES C L . Comparing static and dynamic measurements and models of the Internet's topology [A ] . Proceedings of the 23rd Annual Joint Conference of the IEEE Computer and Communications Societies [C ] . 2004 . 1616 - 1627 .
ZHOU S , MONDRAGON R J . The rich-club phenomenon in the Internet topology [J ] . IEEE Communication Letters , 2004 , 8 ( 3 ): 180 - 182 .
ZHOU S , MONDRAGON R J . Structural constraints in complex networks [J ] . New Journal of Physics , 2007 , 9 ( 172 ): 1 - 11 .
KNUTH D E . The Stanford GraphBase:A Platform for Combinatorial Computing [M ] . Addison-Wesley,Reading,MA , 1993 .
0
浏览量
1401
下载量
0
CSCD
关联资源
相关文章
相关作者
相关机构