Papers › Sampling and Filtering with Markov Chains
Sampling and Filtering with Markov Chains
Michael A. Kouritzin
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.
A continuous-time Markov chain rate change formula for simulation, model selection, filtering and theory is proven. It is used to develop Markov chain importance sampling, rejection sampling, branching particle filtering algorithms and filtering equations akin to the Duncan-Mortensen-Zakai equation and the Fujisaki-Kallianpur-Kunita equation but for Markov signals with general continuous-time Markov chain observations. A direct method of solving these filtering equations is given that, for example, applies to trend, volatility and/or parameter estimation in financial models given tick-by-tick market data. All the results also apply to continuous-time Hidden Markov Models (CTHMM), which have become important in applications like disease progression tracking, as special cases and the corresponding CTHMM results are stated as corollaries.
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