A strategy for non-strictly convex distance transport cost and the obstacle problem

Details A strategy for non-strictly convex distance transport cost and the obstacle problem A strategy for non-strictly convex distance transport cost and the obstacle problem

2011-03-14

arxiv.org/abs/1103.2797v1

Mathematics

Probability

Scientific paper

We address the Monge problem in metric spaces with a geodesic distance: (X, d) is a Polish space and dN is a geodesic Borel distance which makes (X,dN) a possibly branching geodesic space. We show that under some assumptions on the transference plan we can reduce the transport problem to transport problems along family of geodesics. We introduce two assumptions on the transference plan {\pi} which imply that the conditional probabilities of the first marginal on each family of geodesics are continuous and that each family of geodesics is a hourglass-like set. We show that this regularity is sufficient for the construction of a transport map. We apply these results to the Monge problem in d with smooth, convex and compact obstacle obtaining the existence of an optimal map provided the first marginal is absolutely continuous w.r.t. the d-dimensional Lebesgue measure.

Affiliated with

Also associated with

No associations

Rating

A strategy for non-strictly convex distance transport cost and the obstacle problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A strategy for non-strictly convex distance transport cost and the obstacle problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A strategy for non-strictly convex distance transport cost and the obstacle problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-138257