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

doi:10.11959/j.issn.1000-436x.2015025

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

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

刘君,乔建志

东北大学信息科学与工程学院，辽宁沈阳 110819

出版日期:2015-01-25 发布日期:2017-06-21
基金资助:
国家自然科学基金资助项目

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

Jun LIU,Jian-zhong QIAO

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

摘要/Abstract

摘要：

选取复杂网络特征变量—聚集系数为研究目标，通过数学推导与证明，清晰描述了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

刘君,乔建志. 复杂网络中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.

图/表 7

图1

图2

图3

图4

表1

图5

表2

参考文献 12

[1]	汪小帆，李翔，陈关荣．复杂网络理论及其应用[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.
[2]	SONG C , HAVLIN S , MAKSE H A . Origins of fractality in the growth of complex network[J]. Nature Physics, 2006,2(4): 275-281.
[3]	GOH K I , SALVI G , KAHNG B , et al. Skeleton and fractal scaling in complex networks[J]. Physical Review Letters, 2006,96:018701
[4]	GUO Q Z , et al. Exploring the local connectivity preference in Internet AS level topology[J]. Piscataway, 2007,13(1): 6439-6445.
[5]	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.
[6]	ONNELA J , SARAMAKI , HYVONEN J . Structure and tie strengths in mobile commutation networks[J]. PNAS, 2007,104(18): 7332-7336.
[7]	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.
[8]	DIMITROPOULOS X , KRIOUKOV D , FOMENKOV M , et al. AS relationships:inference and validation[J]. SIGCOMM Computer Communications Review, 2007,37(1): 29-40.
[9]	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.
[10]	ZHOU S , MONDRAGON R J . The rich-club phenomenon in the Internet topology[J]. IEEE Communication Letters, 2004,8(3): 180-182.
[11]	ZHOU S , MONDRAGON R J . Structural constraints in complex networks[J]. New Journal of Physics, 2007,9(172): 1-11.
[12]	KNUTH D E . The Stanford GraphBase:A Platform for Combinatorial Computing[M]. Addison-Wesley,Reading,MA, 1993.

项目	数值
图类型	无向图
节点数	77
边数	254
动态图	No
分层图	No
自动标尺	Yes
创建丢失节点	Yes

k值	聚集系数
1	0.736
2	0.777
3	0.822
4	0.826
5,6	0.826
7	0.827
8	0.827
9	0.952

[1]	孙雁飞, 尹嘉峥, 亓晋, 胡筱旋, 陈梦婷, 董振江. 基于动态图嵌入的车联网拓扑控制[J]. 通信学报, 2022, 43(6): 133-142.
[2]	顾秋阳, 吴宝, 池仁勇. 基于高阶路径相似度的复杂网络链路预测方法[J]. 通信学报, 2021, 42(7): 61-69.
[3]	顾秋阳, 吴宝, 孙兆洋, 池仁勇. 基于改进灰狼优化的复杂网络重要节点识别算法[J]. 通信学报, 2021, 42(6): 72-83.
[4]	韩涛, 贺威, 代俊, 左勇, 杨旸, 葛晓虎. 基于无标度网络的车联网连通性研究[J]. 通信学报, 2021, 42(4): 100-108.
[5]	朱近康, 柴名扬, 周武旸. 面向B5G/6G的三三三网络体系架构和优化学习机制[J]. 通信学报, 2021, 42(4): 62-75.
[6]	张胜,戴维凯,吴锋,蓝文祥. 基于分形特性的复杂网络全局效率估计方法[J]. 通信学报, 2020, 41(7): 204-212.
[7]	吴翼腾,于洪涛,黄瑞阳,李华巍. 采用组合方法进行链路预测的理论极限研究[J]. 通信学报, 2020, 41(6): 34-50.
[8]	刘树新,李星,陈鸿昶,王凯. 基于资源传输匹配度的复杂网络链路预测方法[J]. 通信学报, 2020, 41(6): 70-79.
[9]	项英倬,徐正国,游凌. 基于节点通信行为时序的指控信息流挖掘算法[J]. 通信学报, 2019, 40(9): 51-60.
[10]	李凤华,陈天柱,王震,张林杰,史国振,郭云川. 复杂网络环境下跨网访问控制机制[J]. 通信学报, 2018, 39(2): 1-10.
[11]	周长利,田晖,马春光,杨松涛. 路网环境下基于伪随机置换的LBS隐私保护方法研究[J]. 通信学报, 2017, 38(6): 19-29.
[12]	邓琨,李文平,余法红,张健沛. 基于多核心标签传播的复杂网络重叠社区识别方法[J]. 通信学报, 2017, 38(2): 53-66.
[13]	雷凯跃,李兴华,刘海,裴卓雄,马建峰,李晖. 轨迹发布中基于时空关联性的假轨迹隐私保护方案[J]. 通信学报, 2016, 37(12): 156-164.
[14]	仲红,黄丛林,许艳,崔杰. 高效的可撤销群签名方案[J]. 通信学报, 2016, 37(10): 18-24.
[15]	温雅敏,龚征. 新型组织隐藏的认证密钥交换协议[J]. 通信学报, 2015, 36(9): 82-90.

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

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

在线阅读

PDF下载

可视化

被引次数

摘要/Abstract

引用本文

使用本文

图/表 7

参考文献 12

相关文章 15

Metrics

推荐阅读 0