A general framework for search with fluctuating numbers of independent agents provides exact first-passage statistics and identifies regimes where stochastic resetting is a universal lower bound or where DRM is faster.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cond-mat.stat-mech 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Dynamic redundancy and mortality in stochastic search
A general framework for search with fluctuating numbers of independent agents provides exact first-passage statistics and identifies regimes where stochastic resetting is a universal lower bound or where DRM is faster.