1 citations · 1 across the 3 of their papers we have counts for
3 papers
physics.soc-ph2026
Network exploration by random walks: A large deviation perspective
Sarvesh K. Upadhyay, Trifce Sandev, Sanjay Kumar +1
We study exploration properties of a random walk on a network. For a fully connected network we find that the problem can be mapped to the well known coupon collector problem, thus…
cond-mat.stat-mech2024★ 1 cited
Competing random searchers under restarts
R. K. Singh, R. Metzler, T. Sandev
We study independent searchers competing for a target under restarts and find that introduction of restarts tends to enhance the search efficiency of an already efficient searcher.…
cond-mat.stat-mech2024
Restarts delay escape over a potential barrier
R. K. Singh
In the barrier escape problem, a random searcher starting at the energy minima tries to escape the barrier under the effect of thermal fluctuations. If the random searcher is subje…