The hydrogen identity for Laplacians

03/05/2018
by   Oliver Knill, et al.
0

For any finite simple graph G, the hydrogen identity H=L-L^(-1) holds, where H=(d+d^*)^2 is the sign-less Hodge Laplacian defined by sign-less incidence matrix d and where L is the connection Laplacian. Any spectral information about L directly leads to estimates for the Hodge Laplacian H=(d+d^*)^2 and allows to estimate the spectrum of the Kirchhoff Laplacian H_0=d^* d. The hydrogen identity implies that the random walk u(n) = L^n u with integer n solves the one-dimensional Jacobi equation Delta u=H^2 with (Delta u)(n)=u(n+2)-2 u(n)+u(n-2). Every solution is represented by such a reversible path integral. Over a finite field, we get a reversible cellular automaton. By taking products of complexes such processes can be defined over any lattice Z^r. Since L^2 and L^(-2) are isospectral, by a theorem of Kirby, the matrix L^2 is always similar to a symplectic matrix if the graph has an even number of simplices. The hydrogen relation is robust: any Schrödinger operator K close to H with the same support can still can be written as K=L-L^-1 where both L(x,y) and L^-1(x,y) are zero if x and y do not intersect.

READ FULL TEXT

page 9

page 13

research
01/15/2018

An Elementary Dyadic Riemann Hypothesis

The connection zeta function of a finite abstract simplicial complex G i...
research
08/13/2020

Bilinear matrix equation characterizes Laplacian and distance matrices of weighted trees

It is known from the algebraic graph theory that if L is the Laplacian m...
research
02/12/2015

Spectral Sparsification of Random-Walk Matrix Polynomials

We consider a fundamental algorithmic question in spectral graph theory:...
research
02/05/2018

Listening to the cohomology of graphs

We prove that the spectrum of the Kirchhoff Laplacian H0 of a finite sim...
research
04/24/2019

PAN: Path Integral Based Convolution for Deep Graph Neural Networks

Convolution operations designed for graph-structured data usually utiliz...
research
02/28/2020

On Fast Computation of Directed Graph Laplacian Pseudo-Inverse

The Laplacian matrix and its pseudo-inverse for a strongly connected dir...
research
12/04/2020

Persistent Laplacians: properties, algorithms and implications

The combinatorial graph Laplacian has been a fundamental object in the a...

Please sign up or login with your details

Forgot password? Click here to reset