Results 1 
4 of
4
An asymmetric ArzelàAscoli theorem
 Topology and Its Applications
"... An ArzelàAscoli theorem for asymmetric metric spaces (sometimes called quasimetric spaces) is proved. One genuinely asymmetric condition is introduced, and it is shown that several classic statements fail in the asymmetric context if this assumption is dropped. ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
An ArzelàAscoli theorem for asymmetric metric spaces (sometimes called quasimetric spaces) is proved. One genuinely asymmetric condition is introduced, and it is shown that several classic statements fail in the asymmetric context if this assumption is dropped.
Gradient flows in asymmetric metric spaces
 In preparation
"... This article is concerned with gradient flows in asymmetric metric spaces, that is, spaces with a topology induced by an asymmetric metric. Such asymmetry appears naturally in many applications, e.g., in mathematical models for materials with hysteresis. A framework of asymmetric gradient flows is e ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
This article is concerned with gradient flows in asymmetric metric spaces, that is, spaces with a topology induced by an asymmetric metric. Such asymmetry appears naturally in many applications, e.g., in mathematical models for materials with hysteresis. A framework of asymmetric gradient flows is established under the assumption that the metric is weakly lower semicontinuous in the second argument (and not necessarily on the first), and an existence theorem for gradient flows defined on an asymmetric metric space is given. 1
Monotonicity of transport plans
, 2006
"... We study monotonicity properties for minimizers of transport problems. In the onedimensional case, we present an algorithm to construct minimizing monotone transport plans by “monotonizing ” a given minimizing transport plan. This method applies in particular to the case of the L 1Wasserstein metr ..."
Abstract
 Add to MetaCart
We study monotonicity properties for minimizers of transport problems. In the onedimensional case, we present an algorithm to construct minimizing monotone transport plans by “monotonizing ” a given minimizing transport plan. This method applies in particular to the case of the L 1Wasserstein metric where we prove the existence of monotone minimizers for arbitrary marginals. We find that monotone transport plans are in a certain sense close to monotone transport maps.