Search arXiv⌕ Search

arXiv · 0708.3707

First order approach and index theorems for discrete and metric graphs

Abstract

The aim of the present paper is to introduce the notion of first order (supersymmetric) Dirac operators on discrete and metric (``quantum'') graphs. In order to cover all self-adjoint boundary conditions for the associated metric graph Laplacian, we develop systematically a new type of discrete graph operators acting on a decorated graph. The decoration at each vertex of degree-d is given by a subspace of $\C^d$, generalising the fact that a function on the standard vertex space has only a scalar value. We develop the notion of exterior derivative, differential forms, Dirac and Laplace operators in the discrete and metric case, using a supersymmetric framework. We calculate the (supersymmetric) index of the discrete Dirac operator generalising the standard index formula involving the Euler characteristic of a graph. Finally, we show that the corresponding index for the metric Dirac operator agrees with the discrete one.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Olaf Post. 2007-09-03. First order approach and index theorems for discrete and metric graphs. https://arxiv.org/abs/0708.3707

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Surface plasmons in metamaterial cavities

We study scattering by metamaterials with negative indices of refraction, which are known to support \emph{surface plasmons} -- long-lived states that are highly localized at the boundary of the cavity. This type of states has found uses in a variety of modern technologies. In this article, we study surface plasmons in the setting of non-trapping cavities; i.e. when all billiard trajectories outside the cavity escape to infinity. We characterize the indices of refraction which support surface plasmons, show that the corresponding resonances lie super-polynomially close to the real axis, describe the localization properties of the corresponding resonant states, and give an asymptotic formula for their number.

math.SP↗

Graph transformations and eigenvectors of the Laplacian, signless Laplacian and Adjacency matrices

We study graph transformations and their effects on the eigenvectors of three fundamental graph matrices: the adjacency matrix $A$, the signless Laplacian $Q$, and the Laplacian $L$. We extend the Laplacian eigenvector edge and matching principles introduced by Merris to $Q$ and $A$. We also extend some of the known $L$ graph transformations to $Q$ and $A$ and prove that graphs admitting a common eigenvector $\mathbf{x}$ for $A, L$ and $Q$ are such that vertices corresponding to nonzero components of $\mathbf{x}$ have same degree. Following our previous work for $L$, we investigate bivalent graphs for $A$ and $Q$, that is graphs admitting an eigenvector with all components in $\{-1, 1\}$. In particular, for trees, we characterize $Q$-bivalence and establish that $A$-bivalence forces all vertex degrees to be odd.

math.SP↗

Smooth spectral statistics of random perturbations of Schrödinger operators near Anosov energy levels

We investigate the spectral statistics of random perturbations of semiclassical Schrödinger operators on compact manifolds, near energy levels corresponding to chaotic classical dynamics. The prototypical example is that of an operator $h^2Δ+V(x)$ that is perturbed by a smooth potential $h^αV_ω$ with $α\in (0,1)$, and $V_ω$ is a random potential that decorrelates on distances $h^β$, with $0<β<2α$. We show that for a generic perturbation, the spectral fluctuations of the smoothed counting function of eigenvalues obey a universal behavior at a certain mesoscopic scale, which is coherent with the predictions of random matrix theory.

math.SP↗