Mean first-passage times in confined media: from Markovian to non-Markovian processes

We review recent theoretical works that enable the accurate evaluation of the mean first passage time (MFPT) of a random walker to a target in confinement for Markovian (memory-less) and non-Markovian walkers. For the Markovian problem, we present a general theory which allows one to accurately evaluate the MFPT and its extensions to related first-passage observables such as splitting probabilities and occupation times. We show that this analytical approach provides a universal scaling dependence of the MFPT on both the volume of the confining domain and the source target distance in the case of general scale-invariant processes. This analysis is applicable to a broad range of stochastic processes characterized by length scale-invariant properties, and reveals the key role that can be played by the starting position of the random walker. We then present an extension to non-Markovian walks by taking the specific example of a tagged monomer of a polymer chain looking for a target in confinement. We show that the MFPT can be calculated accurately by computing the distribution of the positions of all the monomers in the chain at the instant of reaction. Such a theory can be used to derive asymptotic relations that generalize the scaling dependence with the volume and the initial distance to the target derived for Markovian walks. Finally, we present an application of this theory to the problem of the first contact time between the two ends of a polymer chain, and review the various theoretical approaches of this non-Markovian problem.First-passage times and optimization of target search strategie