2000 character limit reached
Comparison of pure and combined search strategies for single and multiple targets
Published 31 Oct 2017 in cond-mat.stat-mech and q-bio.QM | (1710.11411v1)
Abstract: We address the generic problem of random search for a point-like target on a line. Using the measures of search reliability and efficiency to quantify the random search quality, we compare Brownian search with L\'evy search based on long-tailed jump length distributions. We then compare these results with a search process combined of two different long-tailed jump length distributions. Moreover, we study the case of multiple targets located by a L\'evy searcher.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.