Optimal non-Markovian search strategies with n-step memory

TL;DR

This paper develops a formalism to analyze non-Markovian search strategies with memory, demonstrating that optimal strategies significantly reduce search time and are often mirror-asymmetric, especially in chemotactic contexts.

Contribution

It introduces a general method to compute mean first passage times for n-step non-Markovian walks and identifies optimal strategies that outperform Markovian searches.

Findings

Optimal n-step strategies reduce MFPT systematically.

Mirror-asymmetric walks are more efficient.

Chemotactic coupling can reduce MFPT to one-third of Markovian case.

Abstract

Stochastic search processes are ubiquitous in nature and are expected to become more efficient when equipped with a memory, where the searcher has been before. A natural realization of a search process with long-lasting memory is a migrating cell that is repelled from the diffusive chemotactic signal that it secrets on its way, denoted as auto-chemotactic searcher. To analyze the efficiency of this class of non-Markovian search processes we present a general formalism that allows to compute the mean first passage time (MFPT) for a given set of conditional transition probabilities for non-Markovian random walks on a lattice. We show that the optimal choice of the $n$-step transition probabilities decreases the MFPT systematically and substantially with an increasing number of steps. It turns out that the optimal search strategies can be reduced to simple cycles defined by a small parameter set and that mirror-asymmetric walks are more efficient. For the auto-chemotactic searcher we show that an optimal coupling between the searcher and the chemical reduces the MFPT to 1/3 of the one for a Markovian random walk.