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

Motivated by considerations of euclidean quantum gravity, we investigate a central question of spectral geometry, namely the question of reconstructability of compact Riemannian manifolds from the spectra of their Laplace operators. To this…

We present recent advances in harmonic analysis on infinite graphs. Our approach combines combinatorial tools with new results from the theory of unbounded Hermitian operators in Hilbert space, geometry, boundary constructions, and spectral…

We address the problem of 3D shape registration and we propose a novel technique based on spectral graph theory and probabilistic matching. The task of 3D shape analysis involves tracking, recognition, registration, etc. Analyzing 3D data…

We examine the index data associated to twisted spectral triples and higher order spectral triples. In particular, we show that a Lipschitz regular twisted spectral triple can always be `logarithmically dampened' through functional…

We prove a formula for the spectrum of the Laplace-Beltrami operator on functions for compact naturally reductive homogeneous spaces in terms of eigenvalues of a generalized Casimir operator and spherical representations. We apply this…

Given an expansive matrix $R\in M_d({\mathbb Z})$ and a finite set of digit $B$ taken from $ {\mathbb Z}^d/R({\mathbb Z}^d)$. It was shown previously that if we can find an $L$ such that $(R,B,L)$ forms a Hadamard triple, then the…

The inducibility of a graph represents its maximum density as an induced subgraph over all possible sequences of graphs of size growing to infinity. This invariant of graphs has been extensively studied since its introduction in $1975$ by…

In this article we study higher homological properties of $n$-levelled algebras and connect them to properties of the underlying graphs. Notably, to each $2$-representation-finite quadratic monomial algebra $\Lambda$ we associate a…

We analyze the convergence of the spectrum of large random graphs to the spectrum of a limit infinite graph. We apply these results to graphs converging locally to trees and derive a new formula for the Stieljes transform of the spectral…

We consider the conjecture proposed in Matsumoto, Zhang and Schiebinger (2022) suggesting that optimal transport with quadratic regularisation can be used to construct a graph whose discrete Laplace operator converges to the…

In this paper we develop a systematic calculus for the Duistermaat index, a symplectic invariant defined for triples of Lagrangian subspaces. Introduced nearly half a century ago, this index has lately been the subject of renewed attention,…

Using a Cayley complex (generalizing the Cayley graph) and Clifford algebras, we are able to give, for a large class of finitely presented groups, a uniform construction of spectral triples with $D_{+}$ of index 1.

Uniform spanning trees on finite graphs and their analogues on infinite graphs are a well-studied area. On a Cayley graph of a group, we show that they are related to the first $\ell^2$-Betti number of the group. Our main aim, however, is…

We prove analogues for hypergraphs of Szemer\'edi's regularity lemma and the associated counting lemma for graphs. As an application, we give the first combinatorial proof of the multidimensional Szemer\'edi theorem of Furstenberg and…

Hierarchical graphs often exhibit tree-like branching patterns, a structural property that challenges the design of traditional graph filters. We introduce a boundary-weighted operator that rescales each edge according to how far its…

In this paper we give a method to associate a graph with an arbitrary density matrix referred to a standard orthonormal basis in the Hilbert space of a finite dimensional quantum system. We study the related issues like classification of…

Spectral embedding of graphs uses the top k non-trivial eigenvectors of the random walk matrix to embed the graph into R^k. The primary use of this embedding has been for practical spectral clustering algorithms [SM00,NJW02]. Recently,…

We give a construction of an odd spectral triple on the Cuntz algebra $O_{N}$, whose $K$-homology class generates the odd $K$-homology group $K^1(O_{N})$. Using a metric measure space structure on the Cuntz-Renault groupoid, we introduce a…

The spectral gap of the graph Laplacian with Dirichlet boundary conditions is computed for the graphs of several communication networks at the IP-layer, which are subgraphs of the much larger global IP-layer network. We show that the…

We introduce a new optimization problem regarding embeddings of a graph into a Euclidean space and discuss its relation to the two, mutually dual, optimizations problems introduced by Goering-Helmberg-Wappler. We prove that the Laplace…