期刊文献+

时变网络上零模型的构造算法及应用 被引量:1

Study on the construction algorithm and application of zero model on time-varying network
下载PDF
导出
摘要 时变网络体现了拓扑结构与动力学相结合的网络特性,准确测量时变网络的性能在预测、控制信息传播等方面有重要的研究价值。零模型的引入使得对于时变网络具有的阵发性、周期性以及因果特性等研究更加全面。文章首先介绍了零模型在生物学等领域的研究背景,接着利用各类网络所适用的置乱算法,构造不同参数要求的零模型。针对不同情况对于构造要求的不同,提出并分析了时变网络零模型在构造过程中计算量的概念,并利用计算模型和理论解析验证对比了所提出算法与随机变动方法在变动过程中的计算量优势,最后讨论了在双层耦合网络中零模型的应用。 Time-varying network can reflect the network’s characters bases on combining between the topological structure and the kinetics. Measuring the time-varying network precisely has important study value to predict and control the information spreading. Null model makes studies about the time-varying network’s characters like paroxysmal, periodism and causality more comprehensive. This paper introduces the null model’s research background in biology and uses kinds of scrambling algorithms to construct different demands null models of network. For different situations and different demands, it puts forward and analyzes a concept named calculated quantity occurred the construction of time varying network’s null model. It uses a calculation model and theoretical analysis to verify and compare two kinds of calculated quantities. At last, it discusses the null model’s application on double coupling network.
作者 于咏平 Yu Yongping(College of Computer Science and Technology,Xinjiang University of Finance and Economics,Urumqi 830012,China)
出处 《无线互联科技》 2019年第5期114-116,共3页 Wireless Internet Technology
基金 自治区研究生科研创新项目 项目编号:无 新疆财经大学研究生科研基金项目 项目编号:无 华为产学协同育人项目 项目编号:无
关键词 时变网络 零模型 社交网络 置乱算法 time-varying network null model social network scrambling algorithms
  • 相关文献

参考文献6

二级参考文献130

  • 1刘军.QAP:测量“关系”之间关系的一种方法[J].社会,2007,27(4):164-174. 被引量:126
  • 2P Holme, J Saramaki. Temporal Networks [J/OL]. Physics Reports (S0370-1573), (2012) [2012]. doi: 10.1016 / j.physrep.
  • 3K Misue, P Eades, Wei Lai, Kozo Sugiyama. Layout Adjustment and the Mental Map [J]. Journal of Visual Languages and Computing (S1045-926X), 1995, 6(2): 183-210.
  • 4G Ellis, A Dix. A Taxonomy of Clutter Reduction for Information Visualization [J]. IEEE Transactions on Visualization and Computer Graphics (S1077-2626), 2007, 13(6): 1216-1223.
  • 5A Aris. Network Visualization by Semantic Substrates [J]. IEEE Transactions on Visualization and Computer Graphics (S 1077-2626), 2006, 12(5): 1-8.
  • 6K Sugiyama, S Tagawa, M Toda. Methods for Visual Understanding of Hierarchical System Structures [J]. IEEE Transactions on Systems, Man and Cybernetics (S0018-9472), 1981, 11 (2): 109-125.
  • 7K Sugiyama. A Cognitive Approach for Graph Drawing [J]. Cybernetics and Systems (S0196-9722), 1987, 18(6): 447-488.
  • 8G Sindre, B Gulla, H Jokstad. Onion Graphs: Aesthetic and Layout [C]//Proc. 1993 IEEE Symposium on Visual Languages. USA: IEEE, 1993: 287-291.
  • 9Purchase H C, Cohen R F, James M. Validating Graph Drawing Aesthetics [C]//Proc. Symp. Graph Drawing, 1996. UK: Springer- Verlag London, 1996: 435-446.
  • 10Quan Nguyen, Peter Eades, Seok-Hee I-long. On the Faithfulness of Graph Visualizations [R]. Australia: The University of Sydney, 2012.

共引文献24

同被引文献9

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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