The McKean-Singer Formula in Graph Theory
نویسنده
چکیده
For any finite simple graphG = (V,E), the discrete Dirac operator D = d+d∗ and the Laplace-Beltrami operator L = dd∗+d∗d = (d+d∗)2 = D2 on the exterior algebra bundle Ω = ⊕Ωk are finite v × v matrices, where dim(Ω) = v = ∑ k vk, with vk = dim(Ωk) denoting the cardinality of the set Gk of complete subgraphs Kk of G. We prove the McKean-Singer formula χ(G) = str(e−tL) which holds for any complex time t, where χ(G) = str(1) = ∑ k(−1)vk is the Euler characteristic of G. The super trace of the heat kernel interpolates so the Euler-Poincaré formula for t = 0 with the Hodge theorem in the real limit t→∞. More generally, for any continuous complex valued function f satisfying f(0) = 0, one has the formula χ(G) = str(ef(D)). This includes for example the Schrödinger evolutions χ(G) = str(cos(tD)) on the graph. After stating some immediate general facts about the spectrum which includes a perturbation result estimating the Dirac spectral difference of graphs, we mention as a combinatorial consequence that the spectrum encodes the number of closed paths in the simplex space of a graph. We give a couple of worked out examples and see that McKean-Singer allows to find explicit pairs of nonisometric graphs which have isospectral Dirac operators.
منابع مشابه
Chen Series and Atiyah-singer Theorem
The goal of this paper is to give a new and short proof of the local Atiyah-Singer index theorem by using approximations of heat semigroups. The heat equation approach to index theorems is not new: It was suggested by Atiyah-Bott [1] and McKean-Singer [18], and first carried out by Patodi [21] and Gilkey [13]. Bismut in [8] introduces stochastic methods based on Feynman-Kac formula. For probabi...
متن کاملON THE MATCHING NUMBER OF AN UNCERTAIN GRAPH
Uncertain graphs are employed to describe graph models with indeterministicinformation that produced by human beings. This paper aims to study themaximum matching problem in uncertain graphs.The number of edges of a maximum matching in a graph is called matching numberof the graph. Due to the existence of uncertain edges, the matching number of an uncertain graph is essentially an uncertain var...
متن کاملPhase locking in networks of synaptically-coupled McKean relaxation oscillators
We use geometric dynamical systems methods to derive phase equations for networks of weakly connected McKean relaxation oscillators. We derive an explicit formula for the connection function when the oscillators are coupled with chemical synapses modeled as the convolution of some input spike train with an appropriate synaptic kernel. The theory allows the systematic investigation of the way in...
متن کاملOn Helmholtz free energy for finite abstract simplicial complexes
We prove first that for the Barycentric refinement G1 of a finite abstract simplicial complexG, the Gauss-Bonnet formula χ(G) = ∑ xK (x) holds, where K(x) = (−1)(1−χ(S(x))) is the curvature of a vertex x with unit sphere S(x) in the graph G1. This curvature is dual toK −(x) = (−1) for which GaussBonnet is the definition of Euler characteristic χ(G). Because the connection Laplacian L′ = 1+A′ of...
متن کاملTwo Types of Geometric–Arithmetic Index of V–phenylenic Nanotube
The concept of geometric-arithmetic indices was introduced in the chemical graph theory. These indices are defined by the following general formula: ( ) 2 ( ) uv E G u v u v Q Q Q Q GA G , where Qu is some quantity that in a unique manner can be associated with the vertex u of graph G. In this paper the exact formula for two types of geometric-arithmetic index of Vphenylenic nanotube ar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1301.1408 شماره
صفحات -
تاریخ انتشار 2012