Papers › Generating constrained run-and-tumble trajectories
Generating constrained run-and-tumble trajectories
Benjamin De Bruyne, Satya N. Majumdar, Gregory Schehr
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We propose a method to exactly generate bridge run-and-tumble trajectories that are constrained to start at the origin with a given velocity and to return to the origin after a fixed time with another given velocity. The method extends the concept of effective Langevin equations, valid for Markovian stochastic processes such as Brownian motion, to a non-Markovian stochastic process driven by a telegraphic noise, with exponentially decaying correlations. We obtain effective space-time dependent tumbling rates that implicitly accounts for the bridge constraint. We extend the method to other types of constrained run-and-tumble particles such as excursions and meanders. The method is implemented numerically and is shown to be very efficient.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections