What is a stochastic Hamiltonian process on finite graph? An optimal transport answer
DOI10.1016/j.jde.2021.10.009zbMath1477.35293arXiv2101.08420OpenAlexW3211146400MaRDI QIDQ2242553
Jianbo Cui, Shu Liu, Hao-Min Zhou
Publication date: 9 November 2021
Published in: Journal of Differential Equations (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2101.08420
optimal transportSchrödinger bridge problemtime-inhomogeneous Markov processWasserstein-Hamiltonian flow
Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Geodesics in global differential geometry (53C22) PDEs on graphs and networks (ramified or polygonal spaces) (35R02) Optimal transportation (49Q22)
Related Items (4)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey of the Schrödinger problem and some of its connections with optimal transport
- Gradient flows of the entropy for finite Markov chains
- Lazy random walks and optimal transport on graphs
- Conservative diffusions
- A new class of transport distances between measures
- Critical point theory and Hamiltonian systems
- Controllability of a Fokker-Planck equation, the Schrödinger system, and a related stochastic optimal control (revised version)
- A discrete Schrödinger equation via optimal transport on graphs
- A computational fluid mechanics solution to the Monge-Kantorovich mass transfer problem
- Fokker-Planck equations for a free energy functional or Markov process on a graph
- Wasserstein Hamiltonian flows
- Port-Hamiltonian Systems on Graphs
- Girsanov Theory Under a Finite Entropy Condition
- Periodic solutions of hamiltonian systems
- Robust Transport Over Networks
- Extremal flows in Wasserstein space
- Geodesics of minimal length in the set of probability measures on graphs
- Continuous-time Random Walks for the Numerical Solution of Stochastic Differential Equations
- Optimal Transport
This page was built for publication: What is a stochastic Hamiltonian process on finite graph? An optimal transport answer