Arcade Processes for Informed Martingale Interpolation

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Kassis, Georges, Macrina, Andrea
Format: Preprint
Published: 2023
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866910012309241856
author Kassis, Georges
Macrina, Andrea
author_facet Kassis, Georges
Macrina, Andrea
contents Arcade processes are a class of continuous stochastic processes that interpolate in a strong sense, i.e., omega by omega, between zeros at fixed pre-specified times. Their additive randomisation allows one to match any finite sequence of target random variables, indexed by the given fixed dates, on the whole probability space. The randomised arcade processes (RAPs) can thus be interpreted as a generalisation of anticipative stochastic bridges. The filtrations generated by these processes are utilised to construct a class of martingales that interpolate between the given target random variables. These so-called filtered arcade martingales (FAMs) are almost-sure solutions to the martingale interpolation problem and reveal an underlying stochastic filtering structure. In the special case of conditionally Markov randomised arcade processes, the dynamics of FAMs are informed by Bayesian updating. The same ideas are applied to filtered arcade reverse-martingales, which are constructed in a similar fashion, using reverse-filtrations of RAPs, instead. Several explicit examples for RAPs and FAMs are provided and simulated. This paper concludes with an outlook on potential connections between FAMs and martingale optimal transport, and related applications.
format Preprint
id arxiv_https___arxiv_org_abs_2301_05936
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Arcade Processes for Informed Martingale Interpolation
Kassis, Georges
Macrina, Andrea
Probability
Optimization and Control
Statistics Theory
49Q22, 60G35, 60G44, 60J60, 62M20, 94A15
Arcade processes are a class of continuous stochastic processes that interpolate in a strong sense, i.e., omega by omega, between zeros at fixed pre-specified times. Their additive randomisation allows one to match any finite sequence of target random variables, indexed by the given fixed dates, on the whole probability space. The randomised arcade processes (RAPs) can thus be interpreted as a generalisation of anticipative stochastic bridges. The filtrations generated by these processes are utilised to construct a class of martingales that interpolate between the given target random variables. These so-called filtered arcade martingales (FAMs) are almost-sure solutions to the martingale interpolation problem and reveal an underlying stochastic filtering structure. In the special case of conditionally Markov randomised arcade processes, the dynamics of FAMs are informed by Bayesian updating. The same ideas are applied to filtered arcade reverse-martingales, which are constructed in a similar fashion, using reverse-filtrations of RAPs, instead. Several explicit examples for RAPs and FAMs are provided and simulated. This paper concludes with an outlook on potential connections between FAMs and martingale optimal transport, and related applications.
title Arcade Processes for Informed Martingale Interpolation
topic Probability
Optimization and Control
Statistics Theory
49Q22, 60G35, 60G44, 60J60, 62M20, 94A15
url https://arxiv.org/abs/2301.05936