Many stochastic systems can be viewed as gradient flow ('steepest descent') in the space of probability measures, where the driving functional is a relative entropy and the relevant geometry is described by a dynamical optimal transport problem. In this talk we focus on these optimal transport problems and describe recent work on the limit passage from discrete to continuous.

Surprisingly, it turns out that discrete transport metrics may fail to converge to the expected limit, even when the associated gradient flows converge. We will illustrate this phenomenon in examples and present a recent homogenisation result.This talk is based on joint work with Peter Gladbach, Eva Kopfer, and Lorenzo Portinale.

]]>