Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2411.15544

Stochastic calculus of run-and-tumble motion: an applied perspective

Paul C Bressloff
View original source ↗Read source document ↗Export metadata ↓

Abstract

The run-and-tumble particle (RTP) is one of the simplest examples of an active particle in which the direction of constant motion randomly switches. In the one-dimensional (1D) case this means switching between rightward and leftward velocities. Most theoretical studies of RTPs are based on the analysis of the Chapman-Kolmogorov (CK) differential equation describing the evolution of the joint probability densities for particle position and velocity state. In this paper we develop an alternative, probabilistic framework of 1D RTP motion based on the stochastic calculus of Poisson and diffusion processes. In particular, we show how a generalisation of It\^o's lemma provides a direct link between sample paths of an RTP and the underlying CK equation. This allows us to incorporate various non-trivial extensions in a systematic fashion, including stochastic resetting and partially absorbing sticky boundaries. The velocity switching process and resetting process are represented by a pair of independent Poisson processes, whereas a sticky boundary is modelled using a boundary layer. We then use the probabilistic formulation to calculate stochastic entropy production along individual trajectories of an RTP, and show how the corresponding Gibbs-Shannon entropy is recovered by averaging over the ensemble of sample paths. Finally, we extend the probabilistic framework to a population of RTPs and use this to explore the effects of global resetting.

Explore related subjects

cond-mat.stat-mech

Keep this discovery

BibTeXRIS

Paul C Bressloff. 2024-11-23. Stochastic calculus of run-and-tumble motion: an applied perspective. https://arxiv.org/abs/2411.15544

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Universal sampling of spin systems across quenched disorder

Statistical physics extracts macroscopic laws by averaging over the many microscopic degrees of freedom of a system. Disordered systems demand a second and far harder average, one over the quenched randomness itself. The classic analytical routes, the replica and cavity methods, become uncontrolled outside mean-field or tree-like limits, and conventional numerical algorithms like parallel tempering require expensive, independent equilibration for every disorder realization. In this work, we introduce a universal neural variational framework that amortizes inference across the disorder ensemble, eliminating both the need for per-instance Markov chain equilibration and the cost of retraining instance-specific variational ansatzes. Built on an encoder-decoder Transformer architecture, after training once, it produces an explicit approximation to the Boltzmann distribution given previously unseen disorder realizations without further optimization. We validate this framework on 2D Edwards-Anderson models, and apply it to the random-bond Ising model, successfully capturing the Binder cumulant crossings near the Nishimori multicritical point. These results shift the object of variational inference from the single instance to the disorder ensemble, opening a route to frustrated many-body systems where instance-by-instance computation is prohibitive.

cond-mat.stat-mech↗
arXiv2026

Information-Theoretic Characterization of Macroscopic Chaos Emerging from the Chemical Master Equation

Open chemical reaction networks exhibit stochastic concentration dynamics at finite system sizes, whereas their macroscopic limit is governed by deterministic rate equations that can display chaos. In this Letter, we show theoretically that a rate of information loss constructed from two-time mutual information recovers the Kolmogorov-Sinai entropy in the deterministic limit. We verify this result through numerical simulations of a Markov jump process for a three-species system involving seven reactions.

cond-mat.stat-mech↗
arXiv2026

Orientational order on non-orientable domains

We study the statistical properties of passive and active many-body systems with orientational degrees of freedom on non-orientable domains. By rephrasing topological constraints as non-local symmetry relations on an orientable double-cover, we show that non-orientability eliminates global rotational soft modes without acting like an external field. In a passive XY model, this results in topological caging, where orientational fluctuations that exhibit conventional diffusive behavior on a torus saturate on a Klein bottle to a finite value that we compute exactly in the thermodynamic limit. In models of active self-propelled particles with orientational degrees of freedom, topological caging persists despite continuously changing interaction neighborhoods. In an active Ising spin model, non-orientability enforces the coexistence of ordered anti-parallel domains with vanishing global polar order, a state that is absent on orientable domains.

cond-mat.stat-mech↗