Related papers: A discrete Schrodinger equation via optimal transp…
We propose a discrete transport equation on graphs which connects distributions on both vertices and edges. We then derive a discrete analogue of the Benamou-Brenier formulation for Wasserstein-$1$ distance on a graph and as a result…
We study the least-energy way to reshape a probability distribution when motion is constrained to a horizontal bundle, that is, optimal transport and distribution steering in sub-Riemannian geometry, motivated by density control over…
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,…
In this paper we investigate the numerical approximation of an analogue of the Wasserstein distance for optimal transport on graphs that is defined via a discrete modification of the Benamou--Brenier formula. This approach involves the…
We show that the Schroedinger equation is a lift of Newton's law of motion on the space of probability measures, where derivatives are taken w.r.t. the Wasserstein Riemannian metric. Here the potential is the sum of the total classical…
We study the optimal control formulation for stochastic nonlinear Schrodinger equation (SNLSE) on a finite graph. By viewing the SNLSE as a stochastic Wasserstein Hamiltonian flow on density manifold, we show the global existence of a…
We develop a classical well-posedness and regularity theory on a finite connected weighted graph for an extended mean field game system, its associated master equation, and a Hamilton-Jacobi- Bellman equation on the probability simplex, all…
In this paper, we study dynamical optimal transport on a connected graph from the perspective of the Benamou-Brenier formulation, where densities are assigned to vertices and velocities to edges. However, directly using Newton's method on…
We study the uniqueness question for two inverse problems on graphs. Both problems consist in finding (possibly complex) edge or nodal based quantities from boundary measurements of solutions to the Dirichlet problem associated with a…
We show convergence of the gradients of the Schr\"odinger potentials to the Brenier map in the small-time limit under general assumptions on the marginals, which allow for unbounded densities and supports. Furthermore, we provide novel…
The \emph{Schr\"odinger problem} is obtained by replacing the mean square distance with the relative entropy in the Monge-Kantorovich problem. It was first addressed by Schr\"odinger as the problem of describing the most likely evolution of…
We study discretizations of Hamiltonian systems on the probability density manifold equipped with the $L^2$-Wasserstein metric. Based on discrete optimal transport theory, several Hamiltonian systems on graph (lattice) with different…
We propose a new approach to graph compression by appeal to optimal transport. The transport problem is seeded with prior information about node importance, attributes, and edges in the graph. The transport formulation can be setup for…
Schr\"odinger equation with given, {\it a priori} known current is formulated. A non-zero current density is maintained in the quantum system via a subsidiary condition imposed by vector, local Lagrange multiplier. Constrained minimization…
This paper deals with the large-scale behaviour of dynamical optimal transport on $\mathbb{Z}^d$-periodic graphs with general lower semicontinuous and convex energy densities. Our main contribution is a homogenisation result that describes…
The aim of this paper is to examine the large-scale behavior of dynamical optimal transport on stationary random graphs embedded in $\R^n$. Our primary contribution is a stochastic homogenization result that characterizes the effective…
We take a new look at the relation between the optimal transport problem and the Schr\"{o}dinger bridge problem from the stochastic control perspective. We show that the connections are richer and deeper than described in existing…
We prove a dispersive estimate for periodic discrete Schr\"odinger operators on the line with optimal rate of decay. Additionally, by standard methods, we deduce dispersive estimates for the discrete nonlinear Schr\"odinger equation with…
We present a novel model Graph Neural Stochastic Differential Equations (Graph Neural SDEs). This technique enhances the Graph Neural Ordinary Differential Equations (Graph Neural ODEs) by embedding randomness into data representation using…
We propose an approach to quantize discrete networks (graphs with discrete edges). We introduce a new exact solution of discrete Schrodinger equation that is used to write the solution for quantum graphs. Formulation of the problem and…