Random walks on networks with stochastic resetting.,Physical Review E

当前位置： X-MOL 学术 › Phys. Rev. E › 论文详情

Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)

Random walks on networks with stochastic resetting.
Physical Review E ( IF 2.2 ) Pub Date : 2020-06-29 , DOI: 10.1103/physreve.101.062147
Alejandro P Riascos ₁ , Denis Boyer ₁ , Paul Herringer ₂ , José L Mateos _{1,

3}

Affiliation

We study random walks with stochastic resetting to the initial position on arbitrary networks. We obtain the stationary probability distribution as well as the mean and global first passage times, which allow us to characterize the effect of resetting on the capacity of a random walker to reach a particular target or to explore a finite network. We apply the results to rings, Cayley trees, and random and complex networks. Our formalism holds for undirected networks and can be implemented from the spectral properties of the random walk without resetting, providing a tool to analyze the search efficiency in different structures with the small-world property or communities. In this way, we extend the study of resetting processes to the domain of networks.

中文翻译：

随机行走在具有随机重置的网络上。

我们研究随机游动随机复位到任意网络上的初始位置。我们获得平稳的概率分布以及均值和全局首次通过时间，这使我们能够表征重置对随机步行者达到特定目标或探索有限网络的能力的影响。我们将结果应用于环，Cayley树以及随机和复杂的网络。我们的形式主义适用于无向网络，可以从随机游走的光谱属性中实施而无需重置，从而为分析具有小世界属性或社区的不同结构中的搜索效率提供了一种工具。通过这种方式，我们将重置过程的研究扩展到了网络领域。

更新日期：2020-06-29

点击分享查看原文

点击收藏

公开下载

阅读更多本刊最新论文本刊介绍/投稿指南11