Localization transition induced by learning in random searches

Abstract

We solve an adaptive search model where a random walker or Lévy flight stochastically resets to previously visited sites on a $d$-dimensional lattice containing one trapping site. Due to reinforcement, a phase transition occurs when the resetting rate crosses a threshold above which non-diffusive stationary states emerge, localized around the inhomogeneity. The threshold depends on the trapping strength and on the walker's return probability in the memoryless case. The transition belongs to the same class as the self-consistent theory of Anderson localization. These results show that similarly to many living organisms and unlike the well-studied Markovian walks, non-Markov movement processes can allow agents to learn about their environment and promise to bring adaptive solutions in search tasks.

5 pages, 5 figures + 4 pages of Supplemental Information. Accepted in Physical Review Letters

References in corpus (7)

• A survey of random processes with reinforcement
• First Passage Under Restart
• First order transition for the optimal search time of Lévy flights with resetting
• Diffusion with resetting in arbitrary spatial dimension
• Dynamical transition in the temporal relaxation of stochastic processes under resetting
• Random walks with preferential relocations to places visited in the past and their application to biology
• Reinforced walks in two and three dimensions