Papers
Topics
Authors
Recent
2000 character limit reached

Skorohod's topologies on path space (2301.05637v1)

Published 15 Dec 2022 in math.GN, math.MG, and math.PR

Abstract: We introduce the path space over a general metrisable space. Elements of this space are paths, which are pairs consisting of a closed subset of the real line and a cadlag function that is defined on that subset and takes values in the metrisable space. We equip the space of all paths with topologies that generalise Skorohod's J1 and M1 topologies, prove that these topologies are Polish, and derive compactness criteria. The central idea is that the closed graph (in case of the J1 topology) and the filled-in graph (in case of the M1 topology) of a path can naturally be viewed as totally ordered compact sets. We define a variant of the Hausdorff metric that measures the distance between two compact sets, each of which is equipped with a total order. We show that the topology generated by this metric is Polish and derive a compactness criterion. Specialising to closed or filled-in graphs then yields Skorohod's J1 and M1 topologies, generalised to functions that need not all be defined on the same domain.

Summary

We haven't generated a summary for this paper yet.

Whiteboard

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.