5 papers · 1 filter
Search at bounded speed with immigration
Hwai-Ray Tung, Sean D Lawley
Many biophysical search processes employ searchers which enter or "immigrate" into the domain progressively over time. Existing search time estimates can become unphysical for fast…
Passage times of fast inhomogeneous immigration processes
Hwai-Ray Tung, Sean D Lawley
In many biophysical systems, key events are triggered when the fastest of many random searchers find a target. Most mathematical models of such systems assume that all searchers ar…
Cover times with stochastic resetting
Samantha Linn, Sean D Lawley
Cover times quantify the speed of exhaustive search. In this work, we compute exactly the mean cover time associated with a one-dimensional Brownian search under exponentially dist…
First passage times with fast immigration
Hwai-Ray Tung, Sean D Lawley
Many scientific questions can be framed as asking for a first passage time (FPT), which generically describes the time it takes a random "searcher" to find a "target." The importan…
Cover times of many diffusive or subdiffusive searchers
Hyunjoong Kim, Sean D Lawley
Cover times measure the speed of exhaustive searches which require the exploration of an entire spatial region(s). Applications include the immune system hunting pathogens, animals…