{"paper":{"title":"First order transition for the optimal search time of L\\'evy flights with resetting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.stat-mech","authors_text":"Gregory Schehr, Lukasz Kusmierz, Sanjib Sabhapandit, Satya N. Majumdar","submitted_at":"2014-09-05T10:34:14Z","abstract_excerpt":"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 $x_0\\geq0$, where successive jumps are drawn independently from an arbitrary jump distribution $f(\\eta)$. In addition, with a probability $0\\leq r \\leq1$ the position of the searcher is reset to its initial position $x_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(\\eta)$, initial"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.1733","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"}