Optimization and universality of Brownian search in quenched heterogeneous media
Aljaz Godec, Ralf Metzler

TL;DR
This paper demonstrates that a spatially heterogeneous random walk can universally optimize search efficiency across dimensions, revealing an optimal heterogeneity that minimizes mean first passage time, with implications for biological processes.
Contribution
It introduces a minimal model showing how spatial heterogeneity in diffusivity universally enhances search efficiency and identifies an optimal heterogeneity level that minimizes MFPT.
Findings
Existence of an optimal heterogeneity reducing MFPT
Universality of the heterogeneous search across target sizes and dimensions
Heterogeneous search outperforms intermittent strategies in higher dimensions
Abstract
The kinetics of a variety of transport-controlled processes can be reduced to the problem of determining the mean time needed to arrive at a given location for the first time, the so called mean first passage time (MFPT) problem. The occurrence of occasional large jumps or intermittent patterns combining various types of motion are known to outperform the standard random walk with respect to the MFPT, by reducing oversampling of space. Here we show that a regular but spatially heterogeneous random walk can significantly and universally enhance the search in any spatial dimension. In a generic minimal model we consider a spherically symmetric system comprising two concentric regions with piece-wise constant diffusivity. The MFPT is analyzed under the constraint of conserved average dynamics, that is, the spatially averaged diffusivity is kept constant. Our analytical calculations and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
