Random walks on complex networks with first-passage resetting.

Abstract

We study discrete-time random walks on arbitrary networks with first-passage resetting processes. To the end, a set of nodes are chosen as observable nodes, and the walker is reset instantaneously to a given resetting node whenever it hits either of observable nodes. We derive exact expressions of the stationary occupation probability, the average number of resets in the long time, and the mean first-passage time between arbitrary two nonobservable nodes. We show that all the quantities can be expressed in terms of the fundamental matrix Z=(I-Q)^{-1}, where I is the identity matrix and Q is the transition matrix between nonobservable nodes. Finally, we use ring networks, two-dimensional square lattices, barbell networks, and Cayley trees to demonstrate the advantage of first-passage resetting in global search on such networks.