Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/91600
| Title: | What is a stochastic Hamiltonian process on finite graph? An optimal transport answer | Authors: | Cui, J Liu, S Zhou, H |
Issue Date: | Dec-2021 | Source: | Journal of differential equations, 25 Dec. 2021, v. 305, p. 428-457 | Abstract: | We present a definition of stochastic Hamiltonian process on finite graph via its corresponding density dynamics in Wasserstein manifold. We demonstrate the existence of stochastic Hamiltonian process in many classical discrete problems, such as the optimal transport problem, Schrödinger equation and Schrödinger bridge problem (SBP). The stationary and periodic properties of Hamiltonian processes are also investigated in the framework of SBP. | Keywords: | Wasserstein-Hamiltonian flow Schrodinger bridge problem Optimal transport Time-inhomogeneous Markov process |
Publisher: | Academic Press | Journal: | Journal of differential equations | ISSN: | 0022-0396 | EISSN: | 1090-2732 | DOI: | 10.1016/j.jde.2021.10.009 | Rights: | © 2021 Elsevier Inc. All rights reserved. © 2021. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/. The following publication Cui, J., Liu, S., & Zhou, H. (2021). What is a stochastic Hamiltonian process on finite graph? An optimal transport answer. Journal of Differential Equations, 305, 428-457 is available at https://dx.doi.org/10.1016/j.jde.2021.10.009. |
| Appears in Collections: | Journal/Magazine Article |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| JDE_hamiltonian_system_on_graph_copy.pdf | Pre-Published version | 1.03 MB | Adobe PDF | View/Open |
Page views
155
Last Week
6
6
Last month
Citations as of Nov 9, 2025
Downloads
61
Citations as of Nov 9, 2025
SCOPUSTM
Citations
6
Citations as of Jun 21, 2024
WEB OF SCIENCETM
Citations
8
Citations as of Dec 18, 2025
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.



