首页> 外文会议>Conference on noise in complex systems and stochastic dynamics >Reaction-diffusion processes in scale-free networks
【24h】

Reaction-diffusion processes in scale-free networks

机译:无规模网络中的反应扩散过程

获取原文

摘要

In this work we investigate the dynamics of reaction-diffusion processes on scale-free networks. Particles of two types, A and B, are randomly distributed on such a network and diffuse using random walk models by hopping to nearest neighbor nodes only. Here we treat the case where one species is immobile and the other is mobile. The immobile species acts as a trap, i.e. when particles of the other species encounter a trap node they are immediately annihilated. We numerically compute Φ(n, c), the survival probability of mobile species at time n, as a function of the concentration of trap nodes, c. We compare our results to the mean-field result (Rosenstock approximation), and the exact result for lattices of Donsker-Varadhan. We find that for high connectivity networks and high trap concentrations the mean-field result of a simple exponential decay is also valid here. But for low connectivity networks and low c the behavior is much more complicated. We explain these trends in terms of the number of sites visited, S_n, the system size, and the concentration of traps.
机译:在这项工作中,我们研究了无规模网络上的反应扩散过程的动态。两种类型,A和B的粒子随机分布在这种网络上,并仅使用随机步行模型漫射仅跳到最近的邻居节点。在这里,我们对待一个物种是不动的情况,另一个物种是移动的。固定物种充当陷阱,即当其他物种的颗粒遇到陷阱节点时,它们立即被歼灭。我们在数值上计算φ(n,c),在时间n时移动物种的存活概率,作为陷阱节点浓度c的函数。我们将结果与平均字段结果(RosenStock近似值)进行比较,以及Donsker-varadhan的格子的确切结果。我们发现,对于高连接网络和高陷阱浓度,简单指数衰减的平均场地结果也在这里有效。但对于低连接网络和低c而且行为更复杂。我们在访问的网站数量,S_N,系统规模和陷阱浓度方面解释了这些趋势。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号