Invariants of motion with stochastic resetting and space-time coupled returns
Bibliographic record
Abstract
Abstract Motion under stochastic resetting serves to model a myriad of processes in physics and beyond, but in most cases studied to date resetting to the origin was assumed to take zero time or a time decoupled from the spatial position at the resetting moment. However, in our world, getting from one place to another always takes time and places that are further away take more time to be reached. We thus set off to extend the theory of stochastic resetting such that it would account for this inherent spatio-temporal coupling. We consider a particle that starts at the origin and follows a certain law of stochastic motion until it is interrupted at some random time. The particle then returns to the origin via a prescribed protocol. We study this model and surprisingly discover that the shape of the steady-state distribution which governs the stochastic motion phase does not depend on the return protocol. This shape invariance then gives rise to a simple, and generic, recipe for the computation of the full steady state distribution. Several case studies are analyzed and a class of processes whose steady state is completely invariant with respect to the speed of return is highlighted. For processes in this class we recover the same steady-state obtained for resetting with instantaneous returns—irrespective of whether the actual return speed is high or low. Our work significantly extends previous results on motion with stochastic resetting and is expected to find various applications in statistical, chemical, and biological physics.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.004 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.003 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".