Shadow martingales -- a stochastic mass transport approach to the peacock problem
Martin Br\"uckerhoff, Martin Huesmann, Nicolas Juillet

TL;DR
This paper introduces a systematic method to construct martingales that exactly match a given family of probability measures over time, using a novel stochastic mass transport approach called shadow martingales, applicable without restrictions on the measures.
Contribution
It develops a new approach using obstructed shadows to construct unique martingales fitting prescribed marginals, extending previous shadow concepts and linking to martingale optimal transport.
Findings
Defines the obstructed shadow in a peacock of measures.
Proves conditions for uniqueness of the shadow martingale.
Connects the shadow martingale to the martingale optimal transport problem.
Abstract
Given a family of real probability measures increasing in convex order (a peacock) we describe a systematic method to create a martingale exactly fitting the marginals at any time. The key object for our approach is the obstructed shadow of a measure in a peacock, a generalization of the (obstructed) shadow introduced in \cite{BeJu16,NuStTa17}. As input data we take an increasing family of measures with that are submeasures of , called a parametrization of . Then, for any we define an evolution of the measure across our peacock by setting equal to the obstructed shadow of in . We identify conditions on the parametrization such that this…
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 · Stochastic processes and financial applications · Geometric Analysis and Curvature Flows
