Slide 1

Slide 1 text

Schr¨ odinger equation on graphs via optimal transport Wuchen Li (UCLA) 2017 Joint work with Shui-Nee Chow (GT) and Haomin Zhou (GT) Partially supported by NSF and ONR.

Slide 2

Slide 2 text

Outline Introduction Derivation Properties Examples Introduction 2

Slide 3

Slide 3 text

Introduction Schr¨ odinger in 1925 proposed his famous equation. Nowadays Schr¨ odinger equation plays vital roles in physics, optics etc. It is worth noting that its formulation looks very different from the classical mechanics governed by Newton’s law. Introduction 3

Slide 4

Slide 4 text

Introduction Consider a nonlinear Schr¨ odinger equation hi ∂ ∂t Ψ = −h2 1 2 ∆Ψ + ΨV (x) + Ψ Rd W(x, y)|Ψ(y)|2dy . The unknown Ψ(t, x) is a complex function, x ∈ Rd, i = √ −1, | · | is the modulus of a complex number, h is a positive constant; V is a linear potential, W is a mean field interaction potential with W(x, y) = W(y, x). There are many important properties of the equation, e.g. conservation of total mass, total energy, etc. It is a Hamiltonian system. Introduction 4

Slide 5

Slide 5 text

History Remark Optimal transport + Hamiltonian system (Recently) Introduction 5

Slide 6

Slide 6 text

Introduction Optimal transport + Hamiltonian system: Related to Schr¨ odinger equations (Nelson, Carlen); Related to Mean field games (Larsy, Lions, Gangbo, Ambrosio); Related to weak KAM theory (Evans); Related to 2-Wasserstein metric (Brenier, Benamou, Villani). Introduction 6

Slide 7

Slide 7 text

Motivation Based on optimal transport (OT) and Nelson’s idea, we plan to propose a discrete Schr¨ odinger equation. Later, we shall show that the derived equation has the following properties: Method1 TSSP CNFD ReFD TSFD OT+Nelson Time Reversible Yes Yes Yes Yes Yes Time Transverse Invariant Yes No No Yes Yes Mass Conservation Yes Yes Yes Yes Yes Energy Conservation No Yes Yes No Yes Dispersion Relation Yes No No Yes Yes 1Antoinea et al (2013), where TSSP: Time Splitting SPectral; CNFD: Crank-Nicolson Finite Difference; ReFD: Relaxation Finite Difference; TSFD: Time splitting Finite Difference. Introduction 7

Slide 8

Slide 8 text

Optimal transport The optimal transport problem was first introduced by Monge in 1781, relaxed by Kantorovich by 1940. It introduces a particular metric on probability set. Introduction 8

Slide 9

Slide 9 text

Probability Manifold The problem has an important optimal control formulation (Benamou-Breiner 2000): W(ρ0, ρ1)2 := inf v 1 0 Ev2 t dt , where E is the expectation operator and the infimum runs over all vector field v, such that ˙ Xt = vt , X0 ∼ ρ0 , X1 ∼ ρ1 . Under this metric, the probability set enjoys Riemannian geometry structures. Introduction 9

Slide 10

Slide 10 text

Brownian motion and Optimal transport The gradient flow of (negative) Boltzmann-Shannon entropy Rd ρ(x) log ρ(x)dx w.r.t. optimal transport distance is: ∂ρ ∂t = ∇ · ρ∇ log ρ = ∆ρ . This geometric understanding will be the key for Schr¨ odinger equation. Introduction 10

Slide 11

Slide 11 text

Nelson’s approach Nelson in 1966 proposed a slightly different problem of optimal transport distance inf bt { 1 0 1 2E ˙ X2 t dt : ˙ Xt = bt + √ h ˙ Bt , X(0) ∼ ρ0, X(1) ∼ ρ1} , where Bt is a standard Brownian motion in Rd and h is a small positive constant. Although Nelson’s problem and Schr¨ odinger equation look very different from each other, it can be shown that Schr¨ odinger equation is a critical point of the above variation. Introduction 11

Slide 12

Slide 12 text

Nelson’s approach Rewrite Nelson’s problem in terms of densities, i.e. represent Xt by its density ρ: Pr(Xt ∈ A) = A ρ(t, x)dx . Consider inf b 1 0 1 2 [b2 − hb · ∇ log ρ]ρdx dt , where the infimum is among all drift vector fields b(t, x), such that ∂ρ ∂t + ∇ · (ρb) = h 2 ∆ρ , ρ(0) = ρ0 , ρ(1) = ρ1 . Introduction 12

Slide 13

Slide 13 text

Change of variable The key of Nelson’s idea comes from the change of variables v = b − h 2 ∇ log ρ . Substituting the v into Nelson’s problem, the problem is arrived at inf v { 1 0 Rd 1 2 v2ρdx − h2 8 I(ρ) dt : ∂ρ ∂t + ∇ · (ρv) = 0} , where the functional I(ρ) = (∇ log ρ)2ρdx , is called Fisher information. It is worth noting that I is a key concept in physics and modeling (Frieden 2004). Introduction 13

Slide 14

Slide 14 text

Critical points Following Euler-Lagrangian equation, the critical point of Nelson problem satisfies a pair of equations        ∂ρ ∂t + ∇ · (ρ∇S) = 0 ∂S ∂t + 1 2 (∇S)2 = − δ δρ(x) [ h2 8 I(ρ)] where δ δρ(x) is the L2 first variation, the first equation is a continuity equation while the second one is a Hamilton-Jacobi equation. Define Ψ(t, x) = ρ(t, x)eiS(t,x) h , then Ψ satisfies the linear Schr¨ odinger equation ih ∂ ∂t Ψ = − h2 2 ∆Ψ . This derivation is also true for various potential energies. Introduction 14

Slide 15

Slide 15 text

Goals Following the geometry introduced by optimal transport, we plan to establish a Schr¨ odinger equation on a graph. Why on graphs? Numerics and modeling for nonlinear Schr¨ odinger equations, Mean Field Games; Optics; Computation of optimal transport metric. Introduction 15

Slide 16

Slide 16 text

Outline Introduction Derivation Properties Examples Derivation 16

Slide 17

Slide 17 text

Basic settings Graph with finite vertices G = (V, E), V = {1, · · · , n}, E is the edge set; Probability set P(G) = {(ρi )n i=1 | n i=1 ρi = 1, ρi ≥ 0}; Linear and interaction potential energies: V(ρ) = n i=1 Vi ρi , W(ρ) = 1 2 n i=1 n j=1 Wij ρi ρj , where Vi , Wij are constants with Wij = Wji . Derivation 17

Slide 18

Slide 18 text

Definition We plan to find the discrete analog of Nelson’s problem. First, it is natural to define a vector field on a graph v = (vij )(i,j)∈E , satisfying vij = −vji . Next, we define a divergence operator of a vector field v on a graph w.r.t a probability measure ρ (Chow, Li, Huang, Zhou 2012): ∇ · (ρv). Derivation 18

Slide 19

Slide 19 text

Key Definitions Let2 gij (ρ) = ρi + ρj 2 . We define an inner product of two vector fields v1, v2: (v1, v2)ρ := 1 2 (i,j)∈E v1 ij v2 ij gij (ρ); and a divergence of a vector field v at ρ ∈ P(G): divG (ρv) := − j∈N(i) vij gij (ρ) n i=1 . 2There are many choices of gij. We generally require min{ρi, ρj} ≤ gij(ρ) ≤ max{ρi, ρj}, gij(ρ) = gji(ρ). Derivation 19

Slide 20

Slide 20 text

Optimal transport distance on a graph For any ρ0, ρ1 ∈ Po (G), we define an optimal transport distance (also named Wassersetin metric) by W(ρ0, ρ1)2 := inf v { 1 0 (v, v)ρ dt : dρ dt + divG (ρv) = 0, ρ(0) = ρ0, ρ(1) = ρ1}. Metric W gives geometry understanding of P(G). Derivation 20

Slide 21

Slide 21 text

Fisher information on a graph The gradient flow of entropy S(ρ) = n i=1 ρi log ρi in (P(G), W) is the diffusion process on a graph: dρ dt = −gradW S(ρ) = divG (ρ∇G log ρ) . The dissipation of entropy defines the Fisher information on a graph: I(ρ) = (gradW S(ρ), gradW S(ρ))ρ = 1 2 (i,j)∈E (log ρi − log ρj )2gij (ρ) . Many interesting topics have been extracted from this observation. E.g. entropy dissipation, Log-Sobolev inequalities, Ricci curvature, Yano formula (Annals of Mathematics, 1952, 7 pages). Derivation 21

Slide 22

Slide 22 text

Discrete Nelson’s problem We introduce Nelson’s problem on a graph: inf b 1 0 1 2 (b, b)ρ − 1 2 h(∇G log ρ, b)ρ − V(ρ) − W(ρ)dt, where the infimum is taken among all vector fields b on G, such that dρ dt + divG (ρ(b − h 2 ∇G log ρ)) = 0 , ρ(0) = ρ0, ρ(1) = ρ1 . Derivation 22

Slide 23

Slide 23 text

Derivation From the change of variables v = b − h 2 ∇G log ρ, Nelson’s problem on a graph can be written as inf v 1 0 1 2 (v, v)ρ − h2 8 I(ρ) − V(ρ) − W(ρ)dt where the infimum is taken among all discrete vector fields v, such that dρ dt + divG (ρv) = 0 , ρ(0) = ρ0, ρ(1) = ρ1 . Derivation 23

Slide 24

Slide 24 text

Hodge decomposition on graphs Consider a Hodge decomposition on a graph v = ∇G S + u Gradient Divergence free where the divergence free on a graph means divG (ρu) = 0. Lemma The discrete Nelson’s problem is equivalent to inf v 1 0 1 2 (∇G S, ∇G S)ρ − h2 8 I(ρ) − V(ρ) − W(ρ)dt, where the critical point is taken among all discrete potential vector fields ∇G S, such that dρ dt + divG (ρ∇G S) = 0 , ρ(0) = ρ0, ρ(1) = ρ1 . Derivation 24

Slide 25

Slide 25 text

Critical points Applying Euler-Lagrange equation, the solution of Nelson’s problem on a graph satisfies an ODE system:            dρi dt + j∈N(i) (Sj − Si )gij (ρ) = 0 dSi dt + 1 2 j∈N(i) (Si − Sj )2 ∂ ∂ρi gij (ρ) = − ∂ ∂ρi [ h2 8 I(ρ) + V(ρ) + W(ρ)] where the first equation is the continuity equation on a graph while the second one is the Hamilton-Jacobi equation on a graph. Derivation 25

Slide 26

Slide 26 text

Schr¨ odinger equation on a graph Denote two real value function ρ(t), S(t) by Ψ(t) = ρ(t)e √ −1S(t) h . Theorem Given a graph G = (V, E), a real constant vector (Vi )n i=1 and symmetric matrix (Wij )1≤i,j≤n . Then every critical point of Nelson problem on graph satisfies h √ −1 dΨi dt = h2 2 Ψi { j∈N(i) (log Ψi − log Ψj ) gij |Ψi |2 + j∈N(i) | log Ψi − log Ψj |2 ∂gij ∂|Ψi |2 } + Ψi Vi + Ψi n i=1 Wij |Ψj |2. Derivation 26

Slide 27

Slide 27 text

Laplacian on graph with Hamiltonian structure We propose a new interpolation of Laplacian operator on a graph ∆G Ψ|i := −Ψi { j∈N(i) (log Ψi − log Ψj ) gij |Ψi |2 + j∈N(i) | log Ψi − log Ψj |2 ∂gij ∂|Ψi |2 } . In fact, it is not hard to show that this is consistent with the Laplacian in continuous setting: ∆Ψ = Ψ( 1 |Ψ|2 ∇ · (|Ψ|2∇ log Ψ) − |∇ log Ψ|2) . What are the benefits from this nonlinear interpolation? Derivation 27

Slide 28

Slide 28 text

Outline Introduction Derivation Properties Examples Properties 28

Slide 29

Slide 29 text

Properties Theorem Given a graph (V, E) and an initial condition Ψ0 (complex vector) with positive modulus. There exists a unique solution of Schr¨ odinger equation on a graph for all t > 0. Moreover, the solution Ψ(t) (i) conserves the total mass; (ii) conserves the total energy; (iii) matches the stationary solution (Ground state); (iv) is time reversible; (v) is time transverse invariant. Properties 29

Slide 30

Slide 30 text

Proof of (i) and (ii) We obtain a Hamiltonian system on the probability space P(G) w.r.t the discrete optimal transport metric. d dt ρ S = 0 −I I 0 ∂ ∂ρ H ∂ ∂S H , where I ∈ Rn×n is the identity matrix and H is the Hamiltonian: H(ρ, S) = 1 2 (∇G S, ∇G S)ρ + h2 8 I(ρ) + V(ρ) + W(ρ) . Properties 30

Slide 31

Slide 31 text

(iii) Stationary solution (Ground state) Denote E(Ψ) = H(ρ, S) . Theorem If Ψ∗(t) is a stationary solution, i.e. there exists a constant scalar µ and vector ρ∗ = (ρ∗ i )n i=1 , such that Ψ∗(t) = √ ρ∗e−iµt . Then ρ∗ = arg min ρ∈Po(G) {E( √ ρ)} ; and µ = E( √ ρ∗) + W(ρ∗) . Properties 31

Slide 32

Slide 32 text

Outline Introduction Derivation Properties Examples Examples 32

Slide 33

Slide 33 text

Two point Schr¨ odinger equation Examples 33

Slide 34

Slide 34 text

Schr¨ odinger equation on a Lattice hi ∂ ∂t Ψ = −h2 1 2 ∆Ψ + ΨV (x) , V (x) = x2 2 . Examples 34

Slide 35

Slide 35 text

Nonlinear Schr¨ odinger equation on a lattice hi ∂ ∂t Ψ = −h2 1 2 ∆Ψ + Ψ|Ψ|2 . Examples 35

Slide 36

Slide 36 text

Example: Ground state Compute the ground state via min ρ∈P(G) h2 8 I(ρ) + V(ρ) + W(ρ) . −1 −0.5 0 0.5 1 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 x ρ h=1 h=0.1 h=0.01 Figure: The plot of ground state’s density function. The blue, black, red curves represents h = 1, 0.1, 0.01, respectively. Examples 36

Slide 37

Slide 37 text

Discussion In this talk, we introduce a Schr¨ odinger equation on a graph, which enjoys many dynamical properties. Here the discrete Fisher information plays the main effect. From it, we show that the equation exists a unique solution for all time; matches the stationary solution. Examples 37

Slide 38

Slide 38 text

Main references Edward Nelson Derivation of the Schr¨ odinger Equation from Newtonian Mechanics, 1966. Edward Nelson Quantum Fluctuations, 1985. B. Frieden Science from Fisher Information: A Unification, 2004. Shui-Nee Chow, Wuchen Li and Haomin Zhou Nonlinear Fokker-Planck equations on finite graphs, 2017. Shui-Nee Chow, Wuchen Li and Haomin Zhou Schr¨ oodinger equation on finite graphs via optimal transport, 2017. Wuchen Li, Penghang Yin, and Stanley Osher Computations of optimal transport distance with Fisher information regularization, 2017. Examples 38

Slide 39

Slide 39 text

Thanks! Examples 39