{"paper":{"title":"Efficient search by optimized intermittent random walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","q-bio.PE"],"primary_cat":"cond-mat.stat-mech","authors_text":"2), (2) LPTMC, (3) Department of Chemistry, (4) Instituto de Fisica de Cantabria, (5) United Technologies Research Center, Biochemistry, East Hartford, France, Gleb Oshanin (1, Horacio S Wio (4), Independent University of Moscow, Katja Lindenberg (3), Paris, Russia, Santander, Sergei Burlatsky (5) ((1)Laboratory J.-V. Poncelet, Spain, University of California at San Diego, University Pierre & Marie Curie/CNRS, USA, USA)","submitted_at":"2009-09-05T18:42:32Z","abstract_excerpt":"We study the kinetics for the search of an immobile target by randomly moving searchers that detect it only upon encounter. The searchers perform intermittent random walks on a one-dimensional lattice. Each searcher can step on a nearest neighbor site with probability \"alpha\", or go off lattice with probability \"1 - \\alpha\" to move in a random direction until it lands back on the lattice at a fixed distance L away from the departure point. Considering \"alpha\" and L as optimization parameters, we seek to enhance the chances of successful detection by minimizing the probability P_N that the targ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0909.1048","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}