The McKean-Singer Formula in Graph Theory

TL;DR

This paper extends the McKean-Singer formula to finite simple graphs, linking spectral properties of the Dirac operator to topological invariants and path counting, with implications for graph isospectrality.

Contribution

It proves a discrete McKean-Singer formula for graphs, connecting spectral data of the Dirac operator to topological and combinatorial graph properties.

Findings

The spectrum of D encodes the number of closed paths in the graph.

McKean-Singer relates even and odd simplex path counts.

Explicit examples of non-isometric isospectral graphs are provided.

Abstract

For any finite simple graph G=(V,E), the discrete Dirac operator D=d+d* and the Laplace-Beltrami operator L=d d* + d* d on the exterior algebra bundle Omega are finite v times v matrices, where dim(Omega) = v is the sum of the cardinalities v(k) of the set G(k) of complete subgraphs K(k) of G. We prove the McKean-Singer formula chi(G) = str(exp(-t L)) which holds for any complex time t, where chi(G) = str(1)= sum (-1)k v(k) is the Euler characteristic of G. The super trace of the heat kernel interpolates so the Euler-Poincare formula for t=0 with the Hodge theorem in the real limit t going to infinity. More generally, for any continuous complex valued function f satisfying f(0)=0, one has the formula chi(G) = str(exp(f(D))). This includes for example the Schroedinger evolutions chi(G) = str(cos(t D)) on the graph. After stating some general facts about the spectrum of D which includes statements about the complexity, the product of the non-zero eigenvalues as well as a perturbation result estimating the spectral difference of two graphs, we mention as a combinatorial consequence that the spectrum of D encodes the number of closed paths in the simplex space of a graph. McKean-Singer implies that the number of closed paths of length n starting at an even dimensional simplex is the same than the number of closed paths of length n starting at an odd dimensional simplex. We give a couple of worked out examples and see that McKean-Singer allows to find explicit pairs of non-isometric graphs which have isospectral Dirac operators.