Efficient search by optimized intermittent random walks

DOI10.1088/1751-8113/42/43/434008zbMath1186.68151arXiv0909.1048OpenAlexW2072187027MaRDI QIDQ3643237

G. Oshanin, Katja Lindenberg, Sergei Burlatsky, Horacio S. Wio

Publication date: 10 November 2009

Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0909.1048

zbMATH Keywords

search algorithmsheavy-tailed Cauchy jump-length distributions

Mathematics Subject Classification ID

Searching and sorting (68P10) Sums of independent random variables; random walks (60G50) Search theory (90B40)

Related Items

Optimal foraging strategies: Lévy walks balance searching and patch exploitation under a very broad range of conditions ⋮ THE TRAPPING PROBLEM OF WEIGHTED (2,2)-FLOWER NETWORKS WITH THE SAME WEIGHT SEQUENCE ⋮ First passage time statistics for two-channel diffusion ⋮ Stochastic switching in biology: from genotype to phenotype ⋮ Stochastic models in seed dispersals: random walks and birth–death processes ⋮ Distribution of the least-squares estimators of a single Brownian trajectory diffusion coefficient ⋮ Target competition for resources under multiple search-and-capture events with stochastic resetting ⋮ TRAPPING PROBLEM OF THE WEIGHTED SCALE-FREE TRIANGULATION NETWORKS FOR BIASED WALKS ⋮ RANDOM WALKS WITH A TRAP IN SCALE-FREE FRACTAL HIERARCHICAL LATTICES ⋮ Search reliability and search efficiency of combined Lévy–Brownian motion: long relocations mingled with thorough local exploration ⋮ Active transport improves the precision of linear long distance molecular signalling ⋮ Extreme first passage times of piecewise deterministic Markov processes ⋮ Stochastic resetting in underdamped Brownian motion ⋮ Random search on comb