期刊文献+

基于置乱算法的复杂网络零模型构造及其应用本期“复杂性科学”专栏评述 被引量:19

Construction and Application for Null Models of Complex Networks Based on Randomized Algorithms
在线阅读 下载PDF
导出
摘要 整理了无权网络、加权网络和时变网络中经常使用的各种零模型构造算法,重点总结了基于置乱算法的零模型构造过程和它们的实际应用。置乱算法既可以将网络上的连接关系进行断边重连,也可以在保持原有连接的前提下随机化某些因素。通过对这些置乱算法的分析和比较,有助于相关学者了解如何使用置乱算法来构造复杂网络零模型,在参考零模型的前提下合理计算各种统计量的相对值,进一步深化对各种复杂系统的理解和应用。 In this paper, a variety of fundamental construction algorithms of null model for un-weighted networks, weighted networks, and temporal networks have been reviewed, especially the construction of null models based on randomized algorithms and their practical applications have been summarized. Randomized algorithms can not only rewire edges of networks, but also randomize some factors on the condition of keeping the original connection. By analyzing and comparing randomized algorithms, this study is helpful for researchers to know how to use randomized algorithms to construct null models of complex networks, and this study is useful to calculate relative values of various statistics by comparing the original network with its null model. Furthermore, this work can deepen our understanding and utilizing various complex systems.
出处 《电子科技大学学报》 EI CAS CSCD 北大核心 2014年第1期7-20,共14页 Journal of University of Electronic Science and Technology of China
基金 国家自然科学基金(61004104,61104143,61374170) 山东省自然科学基金(ZR2011FQ008)
关键词 复杂网络 零模型 置乱算法 时变网络 无权网络 加权网络 complex networks null model randomized algorithm temporal networks unweighted networks weighted networks
  • 相关文献

参考文献82

  • 1COSTA L F, RODRIGUES F A, TRAVIESO G; et al. Characterization of complex networks: a survey of measurements[J]. Advances in Physics, 2007, 56(1): 167- 242.
  • 2NEWMAN M E J. The physics of networks[J]. Physics Today, 2008, 61(11): 33-38.
  • 3AMARAL LAN, GUIMERA R. Complex networks: Lies, damned lies and statistics[J]. Nature Physics, 2006, 2(2): 75-76.
  • 4MIOL R, SHEN-ORR S S, ITZKOVITZ S, et al. Network motifs: Simple building blocks of complex networks [J]. Science, 2002, 298(5594): 824-827.
  • 5MILO R, ITZKOVITZ S, KASHTAN N, et al. Superfamilies of evolved and designed networks[J]. Science, 2004,303(5663): 1538-1542.
  • 6COLIZZA V, FLAMMlNI A, SERRANO M A, et al. Detecting rich-club ordering in complex networks[J]. Nature Physics, 2006, 2(2): 110-115.
  • 7FOETER J G; FOSTER D V, GRASSBERGER P, et al. Edge direction and the structure of networks[J]. Proceedings of the National Academy of Sciences, 2010, 107(24): 10815-10820.
  • 8MAHADEVAN P, HUBBLE C, KRIOUKOV D, et al. Orbis: Rescaling degree correlations to generate annotated Internet topologies[C]IIACM SIGCOMM Computer Communication Review. Kyoto: ACM, 2007, 37(4): 325-336.
  • 9GJOKA M, KURANT M, MARKOPOULOU A. 2.5 k-graphs: from sampling to generation[J/OL]. (2012-8-17). arXiv Preprint arXiv:1208.3667.
  • 10WATTS D J, STROGATZ S H. Collective dynamics of small-world networks [J]. Nature, 1998, 393(6684): 440- 442.

二级参考文献64

  • 1周涛,柏文洁,汪秉宏,刘之景,严钢.复杂网络研究概述[J].物理,2005,34(1):31-36. 被引量:244
  • 2严网,周涛,王杰,傅忠谦,汪秉宏.Epidemic Spread in Weighted Scale-Free Networks[J].Chinese Physics Letters,2005,22(2):510-513. 被引量:20
  • 3汪秉宏,王文旭,周涛.交通流驱动的含权网络[J].物理,2006,35(4):304-310. 被引量:14
  • 4Watts D J,Strogatz S H.Collective dynamics of " smallworld" networks[J].Nature,1998,393(6684):440 -442.
  • 5Barabasi A L,Albert R.Emergence of scaling in random networks[J].Science,1999,286(5439):509- 512.
  • 6Albert R,Barabasi A L.Statistical mechanics of complex networks[J].Review of Modern Physics, 2002,74(1):47-97.
  • 7Newman ME J,The structure and function of complex networks[J].SIAM Review,2003,45(2):167 - 256.
  • 8Boccaletti S,Latora V,Moreno Y,et al.Complex networks:structure and dynamics[J].Physics Reports,2006,424(4/5):175 - 308.
  • 9Newman M E J.Analysis of weighted networks[J]. Physical Review E,2004,70(5):056131.
  • 10Granovetter M S.The strength of weak ties[J].The American Journal of Sociology,1973,78(6):1360 -1380.

共引文献40

同被引文献110

  • 1陈庆华.无标度网络的相关性和联合度分布[J].福建师范大学学报(自然科学版),2006,22(1):1-6. 被引量:2
  • 2王林,戴冠中.复杂网络的度分布研究[J].西北工业大学学报,2006,24(4):405-409. 被引量:68
  • 3GRANOVETTER M S. The strength of weak ties[J]. American Journal of Sociology, 1973, 78(6): 1360-1380.
  • 4MASSA P, AVESANI E Trust-aware recommender systems[C]//Proceedings of the 2007 ACM Conference on Recommender Systems. [S. l.]: ACM, 2007: 17-24.
  • 5LU L, MEDO M, YEUNG C H, et al. Recommender systems[J]. Physics Reports, 2012, 519(1): 1-49.
  • 6ASUR S, HUBERMAN B A. Predicting the future with social media[C]//Web Intelligence and Intelligent Agent Teehnology (WI-IAT), 2010 IEEE/WIC/ACM International Conference on. [S. l.]: IEEE, 2010, 1: 492-499.
  • 7BOLLEN J, MAO H, ZENG X. Twitter mood predicts the stock market[J]. Journal of Computational Science, 2011, 2(1): 1-8.
  • 8苏萌,柏林森,周涛.个性化:商业的未来[M].北京:机械工业出版社,2011.
  • 9KWAK H, LEE C, PARK H, et al. What is Twitter, a social network or a news media?[C]//Proeeedings of the 19th International Conference on World Wide Web. [S.l.]: ACM, 2010: 591-600.
  • 10DOERR B, FOUZ M, FRIEDRICH T. Why rumors spread so quickly in social networks[J]. Communications of the ACM, 2012, 55(6): 70-75.

引证文献19

二级引证文献33

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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