First order transition for the optimal search time of Lévy flights with resetting

preprint2014arXivOpen access

Abstract

We study analytically an intermittent search process in one dimension. There is an immobile target at the origin and a searcher undergoes a discrete time jump process starting at x0≥0x_0\geq0, where successive jumps are drawn independently from an arbitrary jump distribution f(η)f(η). In addition, with a probability 0≤r≤10\leq r \leq1 the position of the searcher is reset to its initial position x0x_0. The efficiency of the search strategy is characterized by the mean time to find the target, i.e., the mean first passage time (MFPT) to the origin. For arbitrary jump distribution f(η)f(η), initial position x0x_0 and resetting probability rr, we compute analytically the MFPT. For the heavy-tailed Lévy stable jump distribution characterized by the Lévy index 0<μ<20<μ< 2, we show that, for any given x0x_0, the MFPT has a global minimum in the (μ,r)(μ,r) plane at (μ∗(x0),r∗(x0))(μ^*(x_0),r^*(x_0)). We find a remarkable first-order phase transition as x0x_0 crosses a critical value x0∗x_0^* at which the optimal parameters change discontinuously. Our analytical results are in good agreement with numerical simulations.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.