Related papers: Spectral triples and wavelets for higher-rank grap…

This paper extends the notion of a spectral triple to a relative spectral triple, an unbounded analogue of a relative Fredholm module for an ideal $J\triangleleft A$. Examples include manifolds with boundary, manifolds with conical…

For a unital C*-algebra A, which is equipped with a spectral triple and an extension T of A by the compacts, we construct a family of spectral triples associated to T and depending on the two positive parameters (s,t). Using Rieffel's…

This article investigates spectral redundancy, a concept initially introduced by Alberto Seeger. Spectral redundancy arises when different connected induced subgraphs of a graph share the same spectral radius in their adjacency spectrum.…

An analogue of the Riemannian Geometry for an ultrametric Cantor set (C, d) is described using the tools of Noncommutative Geometry. Associated with (C, d) is a weighted rooted tree, its Michon tree. This tree allows to define a family of…

We use two variational techniques to prove upper bounds for sums of the lowest several eigenvalues of matrices associated with finite, simple, combinatorial graphs. These include estimates for the adjacency matrix of a graph and for both…

In this note we elaborate on some notions of surface area for discrete graphs which are closely related to the inverse degree. These notions then naturally lead to associated connectivity measures of graphs and to the definition of a…

The machinery of noncommutative geometry is applied to a space of connections. A noncommutative function algebra of loops closely related to holonomy loops is investigated. The space of connections is identified as a projective limit of…

The scattering process on multiloop infinite p+1-valent graphs (generalized trees) is studied. These graphs are discrete spaces being quotients of the uniform tree over free acting discrete subgroups of the projective group $PGL(2, {\bf…

Using the Levi-Civita connection on the noncommutative differential one-forms of a spectral triple $(\B,\H,\D)$, we define the full Riemann curvature tensor, the Ricci curvature tensor and scalar curvature. We give a definition of Dirac…

We propose a novel method for constructing wavelet transforms of functions defined on the vertices of an arbitrary finite weighted graph. Our approach is based on defining scaling using the the graph analogue of the Fourier domain, namely…

This work studies the spectral convergence of graph Laplacian to the Laplace-Beltrami operator when the graph affinity matrix is constructed from $N$ random samples on a $d$-dimensional manifold embedded in a possibly high dimensional…

We consider rectangular graph superlattices of sides l1, l2 with the wavefunction coupling at the junctions either of the delta type, when they are continuous and the sum of their derivatives is proportional to the common value at the…

Gramsch and Lay [10] gave spectral mapping theorems for the Dunford-Taylor calculus of a closed linear operator $T$, $$\widetilde{\sigma}_i(f(T)) = f(\widetilde{\sigma}_i(T)), $$ for several extended essential spectra…

We introduce a new class of partial actions of free groups on totally disconnected compact Hausdorff spaces, which we call convex subshifts. These serve as an abstract framework for the partial actions associated with finite separated…

We review the recent construction of semifinite spectral triples for graph C^*-algebras. These examples have inspired many other developments and we review some of these such as the relation between the semifinite index and the Kasparov…

In the framework of differential Galois theory we treat the classical spectral problem $\Psi"-u(x)\Psi=\lambda\Psi$ and its finite-gap potentials as exactly solvable in quadratures by Picard--Vessiot without involving special functions; the…

Graph matching aims at finding the vertex correspondence between two unlabeled graphs that maximizes the total edge weight correlation. This amounts to solving a computationally intractable quadratic assignment problem. In this paper we…

Kolla and Tulsiani [KT07,Kolla11} and Arora, Barak and Steurer [ABS10] introduced the technique of subspace enumeration, which gives approximation algorithms for graph problems such as unique games and small set expansion; the running time…

We prove a unified trace-average formula for the $k$-th higher trace $\lambda_k(A)=\operatorname{tr}(\Lambda^k A)$ of a linear operator $A$ on a finite-dimensional normed space. The formula averages the matrix coefficient…

In this work we introduce a concept of complexity for undirected graphs in terms of the spectral analysis of the Laplacian operator defined by the incidence matrix of the graph. Precisely, we compute the norm of the vector of eigenvalues of…