A discrete Schrödinger equation via optimal transport on graphs

DOI10.1016/J.JFA.2019.02.005MaRDI QIDQ1729708zbMATH OpenOpenAlexFDO

Authors Shui-Nee Chow, Wuchen Li, Haomin Zhou

Publication date 28 February 2019

Published in Journal of Functional Analysis (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1705.07583

zbMATH Keywords

Fisher informationNelson's approachnonlinear Schrödinger equationsoptimal transport

Mathematics Subject Classification ID

Boundary value problems on graphs and networks for ordinary differential equations (34B45) Variational methods applied to PDEs (35A15) NLS equations (nonlinear Schrödinger equations) (35Q55) Hamilton-Jacobi theories (49L99) Dynamic lattice systems (kinetic Ising, etc.) and systems on graphs in time-dependent statistical mechanics (82C20) Stochastic methods (Fokker-Planck, Langevin, etc.) applied to problems in time-dependent statistical mechanics (82C31) Transport processes in time-dependent statistical mechanics (82C70)

Abstract: In 1966, Edward Nelson presented an interesting derivation of the Schrodinger equation using Brownian motion. Recently, this derivation is linked to the theory of optimal transport, which shows that the Schrodinger equation is a Hamiltonian system on the probability density manifold equipped with the Wasserstein metric. In this paper, we consider similar matters on a finite graph. By using discrete optimal transport and its corresponding Nelson's approach, we derive a discrete Schrodinger equation on a finite graph. The proposed system is quite different from the commonly referred discretized Schrodinger equations. It is a system of nonlinear ordinary differential equations (ODEs) with many desirable properties. Several numerical examples are presented to illustrate the properties.

Review text

The authors of this work introduce the nonlinear Schrödinger equation (NSE) on graphs following the approach proposed by E. Nelson, who connected the Schrödinger equation with the probability density evolution generated by a random walk in the continuous case. Here, this approach is transferred to the discrete case, namely to finite graphs, where the nonlinear Laplacian on graphs is considered. In addition to the construction, some properties of the obtained system are analysed.

Recommendations

• On a class of nonlinear Schrödinger equations on finite graphs
• Nonlinear Schrödinger equation on graphs: recent results and open problems
• scientific article; zbMATH DE number 7043733
• Existence of solutions to the nonlinear Schrödinger equation on locally finite graphs
• Stationary nonlinear Schrödinger equation on simplest graphs

Cites work

• A computational fluid mechanics solution to the Monge-Kantorovich mass transfer problem
• A gradient structure for reaction–diffusion systems and for energy-drift-diffusion systems
• An analog of the 2-Wasserstein metric in non-commutative probability under which the fermionic Fokker-Planck equation is gradient flow for the entropy
• An asymptotic preserving scheme for the Schrödinger equation in the semiclassical limit
• An entropic gradient structure for Lindblad equations and couplings of quantum systems to macroscopic models
• Bounds on the density of states for Schrödinger operators
• Computational methods for the dynamics of the nonlinear Schrödinger/Gross-Pitaevskii equations
• Entropy dissipation of Fokker-Planck equations on graphs
• Fokker-Planck equations for a free energy functional or Markov process on a graph
• Gradient flow and entropy inequalities for quantum Markov semigroups with detailed balance
• Gradient flows of the entropy for finite Markov chains
• Hamilton-Jacobi equations in the Wasserstein space
• Hamiltonian ODEs in the Wasserstein space of probability measures
• scientific article; zbMATH DE number 3897897 (Why is no real title available?)
• Nonlinear Schrödinger equation on graphs: recent results and open problems
• On local Poincaré via transportation
• On the relation between gradient flows and the large-deviation principle, with applications to Markov chains and diffusion
• Probabilistic methods for discrete nonlinear Schrödinger equations
• Science from Fisher Information
• The Density Manifold and Configuration Space Quantization

Cited in

(26)

• Multigrid methods for image registration model based on optimal mass transport
• The Łojasiewicz inequality for free energy functionals on a graph
• What is a stochastic Hamiltonian process on finite graph? An optimal transport answer
• Existence and convergence of solutions for nonlinear biharmonic equations on graphs
• Wasserstein Hamiltonian flows
• Uncertainty principle for discrete Schrödinger evolution on graphs
• A continuation multiple shooting method for Wasserstein geodesic equation
• Time discretizations of Wasserstein-Hamiltonian flows
• Tracial smooth functions of non-commuting variables and the free Wasserstein manifold
• Scaling limits of discrete optimal transport
• Hessian metric via transport information geometry
• Wasserstein Hamiltonian Flow with Common Noise on Graph
• Normalized solutions for nonlinear Schrödinger equations on graphs
• Optimal Control for Stochastic Nonlinear Schrödinger Equation on Graph
• Topological degree for Chern-Simons Higgs models on finite graphs
• Existence and convergence of solutions for nonlinear elliptic systems on graphs
• Stochastic Wasserstein Hamiltonian flows
• Sobolev spaces on locally finite graphs
• Brouwer degree for Chern-Simons Higgs models on finite graphs
• Sinh-Gordon equations on finite graphs
• Homoclinic solutions for perturbed discrete Schrödinger systems with concave-convex terms and bounded potentials
• Multiple solutions of discrete Schrödinger systems with perturbed and combined nonlinearities
• Convergence and variational structure of a staggered scheme for mean field games with individual noise on graphs
• Finite difference schemes for Hamilton-Jacobi equation on the Wasserstein space on graphs
• Multiple standing waves for discrete nonlinear Schrödinger systems with general nonlinearities
• Fisher information regularization schemes for Wasserstein gradient flows

This page was built for publication: A discrete Schrödinger equation via optimal transport on graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1729708)