Pathwise duals of monotone and additive Markov processes
Anja Sturm, Jan M. Swart

TL;DR
This paper systematically develops pathwise dualities for Markov processes in partially ordered sets, unifying and extending known dualities, and generalizing graphical representations to broader classes of processes.
Contribution
It introduces a unified framework for dualities of Markov processes in lattices, extending existing dualities and providing new constructions, especially for additive and monotone processes.
Findings
Unified treatment of several classical dualities.
Generalization of graphical representations to additive Markov processes.
Extension of duality concepts to processes on general lattices.
Abstract
This paper develops a systematic treatment of monotonicity-based pathwise dualities for Markov processes taking values in partially ordered sets. We show that every Markov process that takes values in a finite partially ordered set and whose generator can be represented in monotone maps has a pathwise dual process. In the special setting of attractive spin systems this has been discovered earlier by Gray. We show that the dual simplifies a lot when the state space is a lattice (in the order-theoretic meaning of the word) and all monotone maps satisfy an additivity condition. This leads to a unified treatment of several well-known dualities, including Siegmund's dual for processes with a totally ordered state space, duality of additive spin systems, and a duality due to Krone for the two-stage contact process, and allows for the construction of new dualities as well. We show that the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMarkov Chains and Monte Carlo Methods · Gene Regulatory Network Analysis
