PGPeter Gladbach
Peter Gladbach
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Peter Gladbach has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Eva Kopfer
Institut für Angewandte Mathematik Universität Bonn Endenicher Allee 60 Bonn Germany
2 shared publications - Jan Maas
Institute of Science and Technology Austria
2 shared publications - Lorenzo Portinale1 shared publication
Latest Publications
- Open Access
Scaling limits of discrete optimal transport
We consider dynamical transport metrics for probability measures on discretisations of a bounded convex domain in $\mathbb{R}^d$. These metrics are natural discrete counterparts to the Kantorovich metric $\mathbb{W}_2$, defined using a Benamou-Brenier type formula. Under mild assumptions we prove an asymptotic upper bound for the discrete transport metric $\mathcal{W}_{\mathcal{T}}$ in terms of $\mathbb{W}_2$, as the size of the mesh $\mathcal{T}$ tends to $0$. However, we show that the corresponding lower bound may fail in general, even on certain one-dimensional and symmetric two-dimensional meshes. In addition, we show that the asymptotic lower bound holds under an isotropy assumption on the mesh, which turns out to be essentially necessary. This assumption is satisfied, e.g., for tilings by convex regular polygons, and it implies Gromov-Hausdorff convergence of the transport metric.Open AccessScaling limits of discrete optimal transport
We consider dynamical transport metrics for probability measures on discretisations of a bounded convex domain in $\mathbb{R}^d$. These metrics are natural discrete counterparts to the Kantorovich metric $\mathbb{W}_2$, defined using a Benamou-Brenier type formula. Under mild assumptions we prove an asymptotic upper bound for the discrete transport metric $\mathcal{W}_{\mathcal{T}}$ in terms of $\mathbb{W}_2$, as the size of the mesh $\mathcal{T}$ tends to $0$. However, we show that the corresponding lower bound may fail in general, even on certain one-dimensional and symmetric two-dimensional meshes. In addition, we show that the asymptotic lower bound holds under an isotropy assumption on the mesh, which turns out to be essentially necessary. This assumption is satisfied, e.g., for tilings by convex regular polygons, and it implies Gromov-Hausdorff convergence of the transport metric. - Open Access
Homogenisation of one-dimensional discrete optimal transport
This paper deals with dynamical optimal transport metrics defined by spatial discretisation of the Benamou--Benamou formula for the Kantorovich metric $W_2$. Such metrics appear naturally in discretisations of $W_2$-gradient flow formulations for dissipative PDE. However, it has recently been shown that these metrics do not in general converge to $W_2$, unless strong geometric constraints are imposed on the discrete mesh. In this paper we prove that, in a $1$-dimensional periodic setting, discrete transport metrics converge to a limiting transport metric with a non-trivial effective mobility. This mobility depends sensitively on the geometry of the mesh and on the non-local mobility at the discrete level. Our result quantifies to what extent discrete transport can make use of microstructure in the mesh to reduce the cost of transport.Open AccessHomogenisation of one-dimensional discrete optimal transport
This paper deals with dynamical optimal transport metrics defined by spatial discretisation of the Benamou--Benamou formula for the Kantorovich metric $W_2$. Such metrics appear naturally in discretisations of $W_2$-gradient flow formulations for dissipative PDE. However, it has recently been shown that these metrics do not in general converge to $W_2$, unless strong geometric constraints are imposed on the discrete mesh. In this paper we prove that, in a $1$-dimensional periodic setting, discrete transport metrics converge to a limiting transport metric with a non-trivial effective mobility. This mobility depends sensitively on the geometry of the mesh and on the non-local mobility at the discrete level. Our result quantifies to what extent discrete transport can make use of microstructure in the mesh to reduce the cost of transport.