Search arXivSearch

arXiv · 1802.01238

Listening to the cohomology of graphs

Abstract

We prove that the spectrum of the Kirchhoff Laplacian H0 of a finite simple Barycentric refined graph and the spectrum of the connection Laplacian L of G determine each other: we prove that L-L^(-1) is similar to the Hodge Laplacian H of G which is in one dimensions the direct sum of the Kirchhoff Laplacian H0 and its 1-form analog H1. The spectrum of a single choice of H0,H1 or H alone determines the Betti numbers b0,b1 of G as well as the spectrum of the other matrices. It follows that b0 is the number of eigenvalues 1 of L and that b1 is the number of eigenvalues -1 of L. For a general abstract finite simplicial complex G, we express the matrix entries g(x,y) = w(x) w(y) X( St(x) cap St(y) ) of the inverse of L using stars St(x)= { z in G | x subset of z } of x and w(x)=(-1)^dim(x) and Euler characteristic X. One can see W+(x)=St(x) and W-(x)={ z in G | z subset x } as stable and unstable manifolds of a simplex x in G and g(x,y) =w(x) w(y) X(W+(x) cap W+(y)) as heteroclinic intersection numbers or curvatures and the identity L g=1 as a collection of Gauss-Bonnet formulas. The homoclinic energy w(x)=X(W+(x) cap W-(x)) by definition adds up to X(G). The matrix M(x,y)=w(x) w(y) X(W-(x) cap W-(y)) is similar to L(x,y)=X(W-(x) cap W-(y)). The sum of the matrix entries of M is the definition of Wu characteristic. For dimension 2 and higher we don't know yet how to recover the Betti numbers from the eigenvalues of the matrix H or from L. So far, it can only be obtained from a collection of block matrices, via the Hodge relations b_k = dim(H_k). A natural conjecture is that for a Barycentric refinement of a complex G, the spectrum of L determines the Betti vector. We know this now in one dimensions.

Explore related subjects

Keep this discovery

BibTeXRIS

Oliver Knill. 2018-02-05. Listening to the cohomology of graphs. https://arxiv.org/abs/1802.01238

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

KEEP EXPLORING

Related papers

An FPTAS for Two-Machine Open-Shop Scheduling with a Single Unavailability Interval

We consider the two-machine open-shop scheduling problem in which one machine is unavailable during a fixed interval. We study the resumable setting: an operation interrupted by the unavailability interval may resume, without penalty, when the machine becomes available. The objective is to minimize the makespan. Although the problem is NP-hard and several approximation algorithms are known, whether it admits a fully polynomial-time approximation scheme (FPTAS) has remained open for two decades. We resolve this question affirmatively by giving the first FPTAS, thereby strengthening the previously known polynomial-time approximation scheme (PTAS). As an intermediate result, we develop a new pseudo-polynomial dynamic program with seven state dimensions, improving on the ten-dimensional formulation in the literature.

cs.DM

Generalized Graph Search Trees

Graph search algorithms and their corresponding graph search trees are commonly used in algorithmic graph theory. In recent years, the recognition problem of these graph search trees has received significant attention. So far, the research has focused on two types of search trees: first-in trees that behave like BFS-trees and last-in trees that behave like DFS-trees. The search tree paradigms differ from each other by the parent a vertex is connected to. In first-in trees, it is the first visited neighbor, while in last-in trees it is the last neighbor visited before that vertex. Here, we will generalize these concepts of graph search trees by allowing every preceding neighbor of a vertex to be the parent. We study the complexity of the recognition problem of these generalized graph search trees. We present NP-completeness proofs for most searches. We also show that the problem is trivial for Generic Search and polynomial-time solvable for several searches on bipartite graphs and chordal graphs. We also study the question how fixing the start vertex influences the complexity of the problem.

cs.DM

The exact asymptotic constant in the metric dimension of Jaccard space

Let $X$ be a finite set with $|X|=n$ and let $\mathrm{Jac}(a,b)=|a\,\triangle\, b|/|a\cup b|$ be the Jaccard distance on the power set $2^X$. Lladser and Paradise recently proved that the metric dimension of $(2^X,\mathrm{Jac})$ is $\Theta(n/\ln n)$, with the constant left open; their bounds are $(\ln 2)\,n/\ln n\lesssim \beta(2^X,\mathrm{Jac})\lesssim 2\ln(2e)\,n/\ln n$. We determine the constant: \[ \beta(2^X,\mathrm{Jac})=\frac{2n}{\log_2 n}\,(1+o(1))=(2\ln 2)\,\frac{n}{\ln n}\,(1+o(1)). \] The proof identifies the problem, on each ``slice'' of subsets of fixed cardinality, with the Erd\H{o}s--R\'enyi coin-weighing problem for a spring scale (the problem of \emph{detecting matrices}). The lower bound is the Erd\H{o}s--R\'enyi entropy argument applied to the middle slice; the upper bound follows from the explicit detecting families of Lindstr\"om and of Cantor and Mills, augmented by a single extra landmark that reveals cardinality.

cs.DM