2022
DOI: 10.1137/21m1410968
|View full text |Cite
|
Sign up to set email alerts
|

Evolutionary $\Gamma$-Convergence of Entropic Gradient Flow Structures for Fokker--Planck Equations in Multiple Dimensions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
3
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 9 publications
(5 citation statements)
references
References 34 publications
0
3
0
Order By: Relevance
“…Another difference is that the method used relies on a generalized gradient structure of the forward Kolmogorov equation with respect to the relative entropy -the so called cosh gradient structure to be precise. This result on tessellations is related to [21,32], where a similar problem is considered, though the gradient structure is the so called quadratic gradient structure. The latter manuscripts concern the convergence of discrete optimal transport distances to their continuous counterparts, see also [38,39].…”
mentioning
confidence: 86%
“…Another difference is that the method used relies on a generalized gradient structure of the forward Kolmogorov equation with respect to the relative entropy -the so called cosh gradient structure to be precise. This result on tessellations is related to [21,32], where a similar problem is considered, though the gradient structure is the so called quadratic gradient structure. The latter manuscripts concern the convergence of discrete optimal transport distances to their continuous counterparts, see also [38,39].…”
mentioning
confidence: 86%
“…Recently, [19,18] study graphs as nonlocal approximation of nonlocal interaction equations on graphs. This is linked to discrete-to-continuum evolution problems using tessellations, [16,24,30,29]. Structures resembling graphs have been also noticed in collision dynamics in kinetic theory, see [17].…”
Section: Introductionmentioning
confidence: 97%
“…and(24), uniformly in n, and ω :[0, T ] × M M T V (R d ) × R 2d → R d satisfy (ω1)-(ω3). Assume ((x, y) → V [•](•, x, y)) ∈ C 0 (R 2d ) and ((x, y) → ω t [•](•, x, y)) ∈ C 0 (R 2d ).…”
mentioning
confidence: 99%
“…Another related question concerns the convergence of discrete optimal transport distances to its continuous counterpart, cf. [14,17,18]. Similarly, the variational convergence of discretisation for evolution problems is investigated in [21].…”
Section: Introductionmentioning
confidence: 99%