arXiv (All)
open access
Optimal Evasion from a Resetting Searcher
Returning to a familiar location can help a searcher find its target---but how should the target move to avoid being found? We address this question for a resetting Brownian searcher and a mobile target fluctuating around a home location. Keeping the target's typical exploration range fixed, we find
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Anticoncentration and State Design of Random Tensor Networks#218276
- Understanding the Stealthy BGP Hijacking Risk in the ROV Era#299822
- Retrieval Stopping in Delayed Fear Extinction#393499
- Localization of information driven by stochastic resetting#156260
- Vanishing L2 regularization for the softmax Multi Armed Bandit#155303
Record · ID 1064670
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive