arXiv subjects

Manu Eder

Publications and source records attributed to Manu Eder.

5 recordsLinked to original sources

arXiv2019

Compactness in Adapted Weak Topologies

Over the years a number of topologies for the set of laws of stochastic processes have been proposed. Building on the weak topology they all aim to capture more accurately the temporal structure of the processes. In a parallel paper we show that all of these topologies (i.e. the information topology of Hellwig, the nested distance topology of Pflug-Pichler, the extended weak convergence of Aldous and a topology built from Lasalle's notion of a causal transference plan) are equal in finite discrete time. Regrettably, the simple characterization of compactness given by Prokhorov's theorem for the weak topology fails to be true in this finer topology. This phenomenon is closely related to the failure of a natural metric for this topology to be complete. For certain problems, a 'fix' consists in passing to the metric completion. Still, it also seems interesting to find out what compact sets look like in the uncompleted space. Here we give a characterization of compact sets in this adapted weak topology which is strongly reminiscent of the Arzelà-Ascoli theorem (with a dash of Prokhorov's theorem). The tools developed are also useful elsewhere. We give a different proof of the continuity of the conditionally independent gluing map of two measures with one marginal in common and in our companion paper the ideas developed here form the main non-algebraic ingredient in showing that the information topology introduced by Hellwig is equal to the nested weak topology of Pflug-Pichler.

math.PR↗

arXiv2019

All Adapted Topologies are Equal

A number of researchers have introduced topological structures on the set of laws of stochastic processes. A unifying goal of these authors is to strengthen the usual weak topology in order to adequately capture the temporal structure of stochastic processes. Aldous defines an extended weak topology based on the weak convergence of prediction processes. In the economic literature, Hellwig introduced the information topology to study the stability of equilibrium problems. Bion-Nadal and Talay introduce a version of the Wasserstein distance between the laws of diffusion processes. Pflug and Pichler consider the nested distance (and the weak nested topology) to obtain continuity of stochastic multistage programming problems. These distances can be seen as a symmetrization of Lassalle's causal transport problem, but there are also further natural ways to derive a topology from causal transport. Our main result is that all of these seemingly independent approaches define the same topology in finite discrete time. Moreover we show that this 'weak adapted topology' is characterized as the coarsest topology that guarantees continuity of optimal stopping problems for continuous bounded reward functions.

math.PR↗

arXiv2019

Adapted Wasserstein Distances and Stability in Mathematical Finance

Assume that an agent models a financial asset through a measure Q with the goal to price / hedge some derivative or optimize some expected utility. Even if the model Q is chosen in the most skilful and sophisticated way, she is left with the possibility that Q does not provide an "exact" description of reality. This leads us to the following question: will the hedge still be somewhat meaningful for models in the proximity of Q? If we measure proximity with the usual Wasserstein distance (say), the answer is NO. Models which are similar w.r.t. Wasserstein distance may provide dramatically different information on which to base a hedging strategy. Remarkably, this can be overcome by considering a suitable "adapted" version of the Wasserstein distance which takes the temporal structure of pricing models into account. This adapted Wasserstein distance is most closely related to the nested distance as pioneered by Pflug and Pichler \cite{Pf09,PfPi12,PfPi14}. It allows us to establish Lipschitz properties of hedging strategies for semimartingale models in discrete and continuous time. Notably, these abstract results are sharp already for Brownian motion and European call options.

q-fin.MF↗

arXiv2018

Fundamental Properties of Process Distances

Information is an inherent component of stochastic processes and to measure the distance between different stochastic processes it is not sufficient to consider the distance between their laws. Instead, the information which accumulates over time and which is mathematically encoded by filtrations has to be accounted for as well. The nested distance/bicausal Wasserstein distance addresses this challenge by incorporating the filtration. It is of emerging importance due to its applications in stochastic analysis, stochastic programming, mathematical economics and other disciplines. This article establishes a number of fundamental properties of the nested distance. In particular we prove that the nested distance of processes generates a Polish topology but is itself not a complete metric. We identify its completion to be the set of nested distributions, which are a form of generalized stochastic processes. We also characterize the extreme points of the set of couplings which participate in the definition of the nested distance, proving that they can be identified with adapted deterministic maps. Finally, we compare the nested distance to an alternative metric, which could possibly be easier to compute in practical situations.

math.OC↗

arXiv2017

Geometry of Distribution-Constrained Optimal Stopping Problems

We adapt ideas and concepts developed in optimal transport (and its martingale variant) to give a geometric description of optimal stopping times of Brownian motion subject to the constraint that the distribution of the stopping time is a given probability. The methods work for a large class of cost processes. (At a minimum we need the cost process to be measurable and adapted. Continuity assumptions can be used to guarantee existence of solutions.) We find that for many of the cost processes one can come up with, the solution is given by the first hitting time of a barrier in a suitable phase space. As a by-product we recover classical solutions of the inverse first passage time problem / Shiryaev's problem.

math.PR↗