Gradient flow formulation of diffusion equations in the Wasserstein space over a Metric graph

  • Received: 01 May 2021 Revised: 01 April 2022 Published: 16 June 2022
  • Primary: 35R02; Secondary: 49Q22, 60B05

  • This paper contains two contributions in the study of optimal transport on metric graphs. Firstly, we prove a Benamou–Brenier formula for the Wasserstein distance, which establishes the equivalence of static and dynamical optimal transport. Secondly, in the spirit of Jordan–Kinderlehrer–Otto, we show that McKean–Vlasov equations can be formulated as gradient flow of the free energy in the Wasserstein space of probability measures. The proofs of these results are based on careful regularisation arguments to circumvent some of the difficulties arising in metric graphs, namely, branching of geodesics and the failure of semi-convexity of entropy functionals in the Wasserstein space.

    Citation: Matthias Erbar, Dominik Forkert, Jan Maas, Delio Mugnolo. Gradient flow formulation of diffusion equations in the Wasserstein space over a Metric graph[J]. Networks and Heterogeneous Media, 2022, 17(5): 687-717. doi: 10.3934/nhm.2022023

    Related Papers:

  • This paper contains two contributions in the study of optimal transport on metric graphs. Firstly, we prove a Benamou–Brenier formula for the Wasserstein distance, which establishes the equivalence of static and dynamical optimal transport. Secondly, in the spirit of Jordan–Kinderlehrer–Otto, we show that McKean–Vlasov equations can be formulated as gradient flow of the free energy in the Wasserstein space of probability measures. The proofs of these results are based on careful regularisation arguments to circumvent some of the difficulties arising in metric graphs, namely, branching of geodesics and the failure of semi-convexity of entropy functionals in the Wasserstein space.



    加载中


    [1] A user's guide to optimal transport. Modelling and Optimisation of Flows on Networks (2013) 2062: 1-155.
    [2]

    L. Ambrosio, N. Gigli and G. Savaré, Gradient Flows: In Metric Spaces and in the Space of Probability Measures, 2$^{nd}$ edition, Springer Science & Business Media, 2008.

    [3] Calculus and heat flow in metric measure spaces and applications to spaces with Ricci bounds from below. Invent. Math. (2014) 195: 289-391.
    [4] A numerical method for the optimal time-continuous mass transport problem and related problems. Monge Ampére Equation: Applications to Geometry and Optimization (1999) 226: 1-12.
    [5] A computational fluid mechanics solution to the Monge-Kantorovich mass transfer problem. Numer. Math. (2000) 84: 375-393.
    [6]

    G. Berkolaiko and P. Kuchment, Introduction to Quantum Graphs, Mathematical Surveys and Monographs, 186. American Mathematical Society, Providence, RI, 2013.

    [7]

    M. Bernot, V. Caselles and J.-M. Morel, Optimal Transportation Networks, Models and theory. Lecture Notes in Mathematics, 1955. Springer-Verlag, Berlin, 2009.

    [8]

    V. I. Bogachev, Measure Theory, Springer-Verlag, Berlin, 2007.

    [9]

    D. Burago, Y. Burago and S. Ivanov, A Course in Metric Geometry, Studies in Mathematics, 33. American Mathematical Society, Providence, RI, 2001.

    [10]

    M. Burger, I. Humpert and J.-F. Pietschmann, Dynamic optimal transport on networks, arXiv: 2101.03415, 2021.

    [11] Fokker-Planck equations for a free energy functional or Markov process on a graph. Arch. Ration. Mech. Anal. (2012) 203: 969-1008.
    [12] A Riemannian interpolation inequality à la Borell, Brascamp and Lieb. Invent. Math. (2001) 146: 219-257.
    [13] The continuity equation on metric measure spaces. Calc. Var. Partial Differential Equations (2015) 53: 149-177.
    [14] The variational formulation of the Fokker–Planck equation. SIAM J. Math. Anal. (1998) 29: 1-17.
    [15] Variational and semigroup methods for waves and diffusion in networks. Appl. Math. Optim. (2007) 55: 219-240.
    [16] Quantum graphs: An introduction and a brief survey. Analysis on Graphs and Its Applications (2008) 77: 291-312.
    [17] Optimal entropy-transport problems and a new Hellinger-Kantorovich distance between positive measures. Invent. Math. (2018) 211: 969-1117.
    [18] Connecting of local operators and evolution equations on networks. Potential Theory (Proc. Copenhagen 1979) (1980) 234: 230-243.
    [19] Gradient flows of the entropy for finite Markov chains. J. Funct. Anal. (2011) 261: 2250-2292.
    [20] Optimal mass transport on metric graphs. SIAM J. Optim. (2015) 25: 1609-1632.
    [21] A gradient structure for reaction-diffusion systems and for energy-drift-diffusion systems. Nonlinearity (2011) 24: 1329-1346.
    [22] Gaussian estimates for a heat equation on a network. Networks Het. Media (2007) 2: 55-79.
    [23]

    D. Mugnolo, Semigroup Methods for Evolution Equations on Networks, Understanding Complex Systems. Springer, Cham, 2014.

    [24] Generalization of an inequality by Talagrand and links with the logarithmic Sobolev inequality. J. Funct. Anal. (2000) 173: 361-400.
    [25] Transport inequalities, gradient estimates, entropy, and Ricci curvature. Comm. Pure Appl. Math. (2005) 58: 923-940.
    [26]

    F. Santambrogio, Optimal Transport for Applied Mathematicians, Progress in Nonlinear Differential Equations and their Applications, 87. Birkhäuser/Springer, Cham, 2015.

    [27]

    C. Villani, Optimal Transport: Old and New, volume 338., Springer-Verlag, Berlin, 2009.

    [28]

    Q. Xia, Optimal paths related to transport problems, Commun. Contemp. Math., 5 2003,251–279.

  • Reader Comments
  • © 2022 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(1675) PDF downloads(246) Cited by(3)

Article outline

Figures and Tables

Figures(3)

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog