期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

介数中心性和平均最短路径长度整合近似算法 被引量：8

An Integrated Approximation Algorithm for the Betweenness Centrality and Average Shortest-Path Length
在线阅读 下载PDF
导出
摘要 基于Brandes算法给出了复杂网络中介数中心性和平均最短路径长度的整合近似算法,通过理论分析和Rocketfuel项目实测数据的实验分析,验证了该整合算法能够快速有效地估计出复杂网络的介数中心性和平均最短路径长度,为进一步的研究工作奠定了基础。 An integrated approximation algorithm for the betweenness centrality and average shortest-path length in complex networks is given in this paper.By academic and experimental analysis,the algorithm has a good performance,which will give help to the further studies.
作者 何宇 赵洪利 姚曜 赵东杰 付芸
机构地区 装备指挥技术学院
出处 《复杂系统与复杂性科学》 EI CSCD 2011年第3期44-53,共10页 Complex Systems and Complexity Science
基金 部委级资助项目(513300403)
关键词 复杂网络 介数中心性 平均最短路径长度 估算 complex networks betweenness centrality average shortest-path length approximation
分类号 TP301.6 [自动化与计算机技术—计算机系统结构]
  • 相关文献

参考文献15

  • 1Yan G, Zhou T, Hu B, et al. Efficient routing on complex networks [J]. Physical Review E,2006,73(4): 046108.
  • 2严钢,汪秉宏,傅忠谦,周涛.复杂网络上的交通动力学[J].ITS通讯,2006,8(2):11-13. 被引量：2
  • 3Carpenter T, Karakostas G, Shallcross D. Practical issues and algorithms for analyzing terrorist networks [EB/ OL]. [2010 -05 -22]. http://www. cas. mcmaster.ca/-gk/papers/wmc2002. pdf.
  • 4Brandes U. A faster algorithm for betweenness centrality [J]. Journal of Mathematical Sociology, 2001, 25(2):163 - 177.
  • 5Brandes U, Pich C. Centrality estimation in large networks [J]. International Journal of Bifurcation and Chaos in Applied Sciences and Engineering, 2007, 17(7) :2303.
  • 6Robert G, Peter S, Dominik S. Better approximation of betweenness centrality[C]// Munro I,Wagner D. Proceedings of the Workshop on Algorithm Engineering and Experiments, ALENEX 2008. San Francisco, California, USA: Society for Industrial and Applied Mathematics, 2008: 90- 100.
  • 7Bader D, Kintali S, Madduri K, et al. Approximating betweenness centrality [C]//Bonato A,Chung F R K. The 5th Workshop on Algorithms and Models for the Web-Graph. San Diego, CA, USA: Springer, 2007:124 -137.
  • 8唐晋韬,王挺.复杂社会网络的介数性质近似计算方法研究[J].计算机工程与科学,2008,30(12):9-14. 被引量：14
  • 9Dabek F, Cox R, Kaashoek F, et al. Vivaldi: a decentralized network coordinate system [C]// Yavatkar R,Feng W C. The annual conference of the Special Interest Group on Data Communication 2004. Portland, Oregon, USA: Association for Computing Machinery, 2004 :15 - 26.
  • 10Samet H, Sankaranarayanan J, Alborzi H. Scalable network distance browsing in spatial database [C]// Tsong J,Wang L. Proceedings of the ACM SIGMOD International Conference on Management of Data 2008. Vancouver, BC, Canada: Association for Computing Machinery, 2008:43 -54.

二级参考文献22

  • 1Scot J. Social Network Analysis: A Handbook[M]. 2nd ed. Sage Publications, 1991.
  • 2Stolfo S J, Hershkoip S, WANG K, et al. Behavior Profiling of Email [C]//Proc of the 1st NSF/NIJ Syrup on Intelli gence, Security Informatics,2003.
  • 3Newman M E J. The Structure of Scientific Collaboration Networks[C]//Proc of the National Academy of Sciences of the United States of America, 2001,98(2): 404-409.
  • 4Ishida K. Extracting Latent Weblog Communities: A Parti tioning Algorithm for Bipartite Graphs[C]//Proc of the 2nd Annual Workshop on the Weblogging Ecosystem, 2005.
  • 5I.erman K, Jones L. Social Browsing on Flickr[C]//Proc of the Int' Conf on Weblogs and Social. Media, 2006.
  • 6Lerman K. Social Networks and Sccial Information Filtering on Digg[C]//Proc of the Int'l Conf on Weblogs and Social Media, 2006.
  • 7Milgram S. The Small World Problem[J]. Psychology Tody, 1967,2:60-67.
  • 8Contributors W. Six Degrees of Kevin Bacon.[EB/OL], [2006-01-15]. http://en. wikipedia. org/w/index. php? lille =Six_Degrees_of_Kevin_ Bacon &oldid= 48040027.
  • 9Watts D J, Strogalz S H. Collective Dynamics of ‘Small World' Networks[J]. Nature, 1998,393 : 140-442.
  • 10Barabdsi A-L, Albert R. Emergence of Scaling in Random Networks [J]. Science, 1999,286 : 509-512.

共引文献14

同被引文献58

引证文献8

二级引证文献24

复杂系统与复杂性科学
2011年 第3期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部