most citedFast decisions reflect biases, slow decisions do not

1 citations · 1 across the 6 of their papers we have counts for

collaborators

6 papers

cond-mat.stat-mech2026

Universality in the target arrival statistics of non-conservative search processes

José Giral-Barajas, Samantha Linn, Paul C. Bressloff

Stochastic search processes in which agents are continuously inserted into and removed from a target search domain are fundamental to a wide class of physical and artificial system…

cond-mat.stat-mech2026

Renewal theory for a run-and-tumble particle with stochastic resetting and a sticky boundary

Paul C Bressloff, Samantha Linn

We consider a run-and-tumble particle (RTP) with stochastic resetting confined to the half line with a sticky boundary at . In the bulk the RTP tumbles at a const…

cond-mat.stat-mech2026

Dynamic redundancy and mortality in stochastic search

Samantha Linn, Aanjaneya Kumar

Search processes are a fundamental part of natural and artificial systems. In such settings, the number of searchers is rarely constant: new agents may be recruited while others ca…

math.PR2024

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…

cond-mat.stat-mech2024

Hitting probabilities for fast stochastic search

Samantha Linn, Sean D. Lawley

Many physical phenomena are modeled as stochastic searchers looking for targets. In these models, the probability that a searcher finds a particular target, its so-called hitting p…

physics.soc-ph2024★ 1 cited

Fast decisions reflect biases, slow decisions do not

Samantha Linn, Sean D. Lawley, Bhargav R. Karamched +2

Decisions are often made by heterogeneous groups of individuals, each with distinct initial biases and access to information of different quality. We show that in large groups of i…