A rigorous proof that lattice run-and-tumble particle models converge to a continuous jamming piecewise deterministic Markov process, with sharp non-asymptotic mixing time bounds.
Markov Chains on Metric Spaces: A Short Course
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.PR 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Long-time analysis of a pair of on-lattice and continuous run-and-tumble particles with jamming interactions
A rigorous proof that lattice run-and-tumble particle models converge to a continuous jamming piecewise deterministic Markov process, with sharp non-asymptotic mixing time bounds.