论文标题
在依赖于节点的随机重置下的复杂网络上随机步行
Random walks on complex networks under node-dependent stochastic resetting
论文作者
论文摘要
In the present work, we study random walks on complex networks subject to stochastic resetting when the resetting probability is node-dependent.使用续订方法，我们得出每个节点上沃克的固定职业概率的精确表达方式以及任意两个节点之间的平均第一个通道时间。最后，我们在三个网络上展示了我们的理论结果，该网络具有两个不同的重置协议，也通过数值模拟验证。我们发现，在精致的环境下，通过与节点相关的重置概率优化对此类网络的全局搜索的效率是有利的。
In the present work, we study random walks on complex networks subject to stochastic resetting when the resetting probability is node-dependent. Using a renewal approach, we derive the exact expressions of the stationary occupation probabilities of the walker on each node and the mean first passage time between arbitrary two nodes. Finally, we demonstrate our theoretical results on three networks with two different resetting protocols, validated by numerical simulations as well. We find that under a delicate setting it is advantageous to optimize the efficiency of a global search on such networks by the node-dependent resetting probability.
