期刊文献+

空间活跃度网络模型构建与特性研究

Modeling and characteristic research for spatial activity network
下载PDF
导出
摘要 基于现实网络拓扑的时变特征,利用Twitter数据集构建了在线社交网络,分析发现网络中用户的活跃度分布独立于时间尺度,并且网络的度分布与边长分布均具有异质性。结合该网络的特点,提出了一种空间活跃度网络模型。模型中网络的拓扑变化受节点活跃度和偏好连边概率影响,通过统计特性分析验证了机制的准确性。为了研究时变网络的动力学过程,在空间活跃度网络中进行了随机游走,得到节点活跃度越大、平均首达时间越短的结论。最后在基于最短路径的搜索策略下研究了偏好连边幂指数与平均搜索时间的关系,发现在空间活跃度网络中使搜索效率最高的幂指数在2左右。该活跃度网络模型可应用于时变网络。 Based on the characteristics of time-varying for the topology of real networks,an online social network was constructed by Twitter data set. Some results were found that the activity distribution of users was virtually independent of the time scale and degree distribution was heterogeneous as well as the side length distribution through analysis. Combined with the characteristics of the network,a spatial activity network model was proposed. The network topology was affected by the activity of nodes and the preferential attachment probability,the accuracy of the mechanism was proved through the analysis of the statistical characteristics. In order to study the dynamic process in time-varying network,a random walk process was carried out in the spatial activity network,the conclusion was obtained that the Mean First-Passage Time( MFPT) was shorter when the node was more active. Finally,the relationship between the preferential attachment power exponent and the average search time was discussed,and it was found that the power exponent with the highest search efficiency was 2 in spatial activity network. The proposed activity network model can be applied to time-varying network.
出处 《计算机应用》 CSCD 北大核心 2016年第6期1502-1505,共4页 journal of Computer Applications
关键词 时变网络 活跃度驱动 空间特性 随机游走 最优搜索 time-varying network activity driven spatial property random walk optimal search
  • 相关文献

参考文献18

  • 1HOLME P, SARAMKI J. Temporal networks [ J]. Physics Re- ports, 2012, 519(3): 97-125.
  • 2PERRA N, GONALVES B, PASTOR-SATORRAS R, et al. Ac- tivity driven modeling of time varying networks [ J]. Scientific Re- ports, 2012, 2(6) : 1717 - 1720.
  • 3LIU S Y, PERRA N, KARSAI M, ses in activity driven networks [ J]. et al. Controlling contagion proees- Physical Review Letters, 2014, 112(11): 118702.
  • 4RIZZO A, FRASCA M, PORFIRI M. Effect of individual behavior on epidemic spreading in activity-driven networks [ J]. Physical Re- view E, Statistical, Nonlinear, and Soft Matter Physics, 2014, 90 (4) : 042501.
  • 5STROGATZ S H. Exploring complex networks [ J]. Nature, 2001, 410(6525) : 268 -276.
  • 6ADAMIC L, ADAR E. How to search a social network [ J]. Social Networks, 2005, 27(3): 187-203.
  • 7LAMB1OTI"E R, BLONDEL V D, DE KERCHOVE C, et al. Geo- graphical dispersal of mobile communication networks [ J]. Physica A: Statistical Mechanics and Its Applications, 2008, 387 ( 21 ) : 5317 -5325.
  • 8ZHANG Z, QI , ZHOU S, et al. Explicit determination of mean first-passage time for random walks on deterministic uniform recur- sive trees [ J]. Physical Review E, Statistical, Nonlinear, and Soft Matter Physics, 2010, 81(1 Pt 2) : 016114.
  • 9ZHANG Z, LIN Y, GAO S, et al. Trapping in scale-free networks with hierarchical organization of modularity [ J]. Physical Review E, Statistical, Nonlinear, and Soft Matter Physics, 2009, 80(5 Pt 1): 051120.
  • 10ZHANG Z, WU B, ZHANG H, et al. Determining global mean- first-passage time of random walks on Vicsek fractals using eigen- values of Laplacian matrices [ J]. Physical Review E, Statistical, Nonlinear, and Soft Matter Physics, 2010, 81(3 Pt 1): 031118.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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