Apparent superballistic dynamics in one-dimensional random walks with biased detachment
Bibliographic record
Abstract
The mean-squared displacement (MSD) is an averaged quantity widely used to assess anomalous diffusion. In many cases, such as molecular motors with finite processivity, the dynamics of the system of interest produce trajectories of varying duration. Here, we explore the effects of finite processivity on different measures of the MSD. We do so by investigating a deceptively simple dynamical system: a one-dimensional random walk (with equidistant jump lengths, symmetric move probabilities, and constant step duration) with an origin-directed detachment bias. By tuning the time dependence of the detachment bias, we find through analytical calculations and trajectory simulations that the system can exhibit a broad range of anomalous diffusion, extending beyond conventional diffusion to superdiffusion and even superballistic motion. We analytically determine that protocols with a time-increasing detachment lead to an ensemble-averaged velocity increasing in time, thereby providing the effective acceleration that is required to push the system above the ballistic threshold. An MSD analysis of burnt-bridges ratchets similarly reveals superballistic behavior. Because superdiffusive MSDs are often used to infer biased, motorlike dynamics, these findings provide a cautionary tale for dynamical interpretation.
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.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 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".