跳到主要导航 跳到搜索 跳到主要内容

Rich-club connectivity in large-scale complex networks

  • Beihang University

科研成果: 书/报告/会议事项章节会议稿件同行评审

摘要

In the real-world network, i.e., Internet, the nodes with high degrees are found closely connected with each other, which is stated as the rich-club connectivity. Obtaining the rich club connectivity is an easy job for small graphs. However, with the continuous expansion of the network size, especially for the online social networks, the naive algorithm could not handle these complex networks any more for the reason of limited memory and too much consuming time. In order to tackle this problem, in this paper, we propose two models for computing rich-club connectivity on MapReduce. We evaluate two models and find the second model outperforms the first one on large scale networks. Then we employ the second model to obtain the rich-club connectivity of several large-scale networks, including both technological and social ones. It is also interesting that as compared to technology networks, the rich-club connectivity in large-scale social systems is indeed different.

源语言英语
主期刊名Proceedings - 2nd International Conference on Cloud and Green Computing and 2nd International Conference on Social Computing and Its Applications, CGC/SCA 2012
730-735
页数6
DOI
出版状态已出版 - 2012
活动2nd International Conference on Cloud and Green Computing, CGC 2012, Held Jointly with the 2nd International Conference on Social Computing and Its Applications, SCA 2012 - Xiangtan, Hunan, 中国
期限: 1 11月 20123 11月 2012

出版系列

姓名Proceedings - 2nd International Conference on Cloud and Green Computing and 2nd International Conference on Social Computing and Its Applications, CGC/SCA 2012

会议

会议2nd International Conference on Cloud and Green Computing, CGC 2012, Held Jointly with the 2nd International Conference on Social Computing and Its Applications, SCA 2012
国家/地区中国
Xiangtan, Hunan
时期1/11/123/11/12

指纹

探究 'Rich-club connectivity in large-scale complex networks' 的科研主题。它们共同构成独一无二的指纹。

引用此