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

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

Abstract

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

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.

Figures/Tables 7

References 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.

Metrics

Recommended 0

No Suggested Reading articles found!

项目	数值
图类型	无向图
节点数	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]	Yanfei SUN, Jiazheng YIN, Jin QI, Xiaoxuan HU, Mengting CHEN, Zhenjiang DONG. Topology control based on dynamic graph embedding in Internet of vehicles [J]. Journal on Communications, 2022, 43(6): 133-142.
[2]	Qiuyang GU, Bao WU, Renyong CHI. Link prediction method based on the similarity of high path [J]. Journal on Communications, 2021, 42(7): 61-69.
[3]	Qiuyang GU, Bao WU, Zhaoyang SUN, Renyong CHI. Key node identification algorithm for complex network based on improved grey wolf optimization [J]. Journal on Communications, 2021, 42(6): 72-83.
[4]	Jinkang ZHU, Mingyang CHAI, Wuyang ZHOU. Three-three-three network architecture and learning optimization mechanism for B5G/6G [J]. Journal on Communications, 2021, 42(4): 62-75.
[5]	Tao HAN, Wei HE, Jun DAI, Yong ZUO, Yang YANG, Xiaohu GE. Connectivity analysis of IoV based on scale-free network [J]. Journal on Communications, 2021, 42(4): 100-108.
[6]	Sheng ZHANG,Weikai DAI,Feng WU,Wenxiang LAN. Global efficiency estimation method of complex network based on fractal property [J]. Journal on Communications, 2020, 41(7): 204-212.
[7]	Yiteng WU,Hongtao YU,Ruiyang HUANG,Huawei LI. Theoretical limit of link prediction using a combination method [J]. Journal on Communications, 2020, 41(6): 34-50.
[8]	Shuxin LIU,Xing LI,Hongchang CHEN,Kai WANG. Link prediction method based on matching degree of resource transmission for complex network [J]. Journal on Communications, 2020, 41(6): 70-79.
[9]	Yingzhuo XIANG,Zhengguo XU,Ling YOU. Instruction flow mining algorithm based on the temporal sequence of node communication actions [J]. Journal on Communications, 2019, 40(9): 51-60.
[10]	Li ZHANG,Cong WANG. Multi-label feature selection algorithm based on joint mutual information of max-relevance and min-redundancy [J]. Journal on Communications, 2018, 39(5): 111-122.
[11]	Fenghua LI,Tianzhu CHEN,Zhen WANG,Linjie ZHANG,Guozhen SHI,Yunchuan GUO. Cross-network access control mechanism for complex network environment [J]. Journal on Communications, 2018, 39(2): 1-10.
[12]	Kun DENG,Wen-ping LI,Fa-hong YU,Jian-pei ZHANG. Overlapping community detection in complex networks based on multi kernel label propagation [J]. Journal on Communications, 2017, 38(2): 53-66.
[13]	Jian-wei NIU,Bin DAI,Chao TONG,Guan-ying HUO,Jing PENG. Complex network clustering algorithm based on Jordan-form of Laplace-matrix [J]. Journal on Communications, 2014, 35(3): 11-21.
[14]	. Complex network clustering algorithm based on Jordan-form of Laplace-matrix [J]. Journal on Communications, 2014, 35(3): 2-21.
[15]	. Communication community detection algorithm based on ranking of strength [J]. Journal on Communications, 2014, 35(10): 19-170.

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

RichHTML

PDF

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 7

References 12

Related Articles 15

Metrics

Recommended 0