Related papers: Discrete trace formulas and holomorphic functional…
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…
An invariant for cospectral graphs is a property shared by all cospectral graphs. In this paper, we establish three novel arithmetic invariants for cospectral graphs, revealing deep connections between spectral properties and combinatorial…
The walk distances in graphs are defined as the result of appropriate transformations of the $\sum_{k=0}^\infty(tA)^k$ proximity measures, where $A$ is the weighted adjacency matrix of a connected weighted graph and $t$ is a sufficiently…
We describe an efficient construction of a canonical non-commutative deformation of the algebraic functions on the moduli spaces of flat connections on a Riemann surface. We show that this algebra, which is a variant of the quantum moduli…
When re-structuring patient cohorts into so-called population graphs, initially independent data points can be incorporated into one interconnected graph structure. This population graph can then be used for medical downstream tasks using…
We define a (pseudo-)distance between graphs based on the spectrum of the normalized Laplacian, which is easy to compute or to estimate numerically. It can therefore serve as a rough classification of large empirical graphs into families…
Cut-based directed graph (digraph) clustering often focuses on finding dense within-cluster or sparse between-cluster connections, similar to cut-based undirected graph clustering methods. In contrast, for flow-based clusterings the edges…
Diagrammatic techniques to compute perturbatively the spectral properties of Euclidean Random Matrices in the high-density regime are introduced and discussed in detail. Such techniques are developed in two alternative and very different…
We present a systematic technique to find explicit solutions of birational maps, provided that these solutions are given in terms of elliptic functions. The two main ingredients are: (i) application of classical addition theorems for…
In this paper we study the complementarity spectrum of digraphs, with special attention to the problem of digraph characterization through this complementarity spectrum. That is, whether two non-isomorphic digraphs with the same number of…
In an era of unprecedented deluge of (mostly unstructured) data, graphs are proving more and more useful, across the sciences, as a flexible abstraction to capture complex relationships between complex objects. One of the main challenges…
In this article, we relate the spectrum of the discrete magnetic Laplacian (DML) on a finite simple graph with two structural properties of the graph: the existence of a perfect matching and the existence of a Hamiltonian cycle of the…
In this article we introduce a definition of k-uniform thresholds hypergraphs through a binary sequence, a natural extension of the classical definition for thresholds graphs. We characterize some of its eigenvalues and multiplicities by…
Convolutional layers within graph neural networks operate by aggregating information about local neighbourhood structures; one common way to encode such substructures is through random walks. The distribution of these random walks evolves…
We quantize graphs (networks) which consist of a finite number of bonds and vertices. We show that the spectral statistics of fully connected graphs is well reproduced by random matrix theory. We also define a classical phase space for the…
The length spectra of flat three-dimensional dielectric resonators of circular shape were determined from a microwave experiment. They were compared to a semiclassical trace formula obtained within a two-dimensional model based on the…
In 2003, van Dam and Haemers posed a fundamental question in spectral graph theory: does there exist a ``sensible'' matrix whose spectrum determines a random graph up to isomorphism? This paper introduces the class of {\em natural graph…
Statistical field theory methods have been very successful with a number of random graph and random matrix problems, but it is challenging to apply these methods to graphs with prescribed degree sequences due to the extensive number of…
Let G be a reductive algebraic group over Q, and suppose that Gamma is an arithmetic subgroup of G(R) defined by congruence conditions. A basic problem in arithmetic is to determine the multiplicities of discrete series representations in…
We present multiscale graph-based reduction algorithms for upscaling heterogeneous and anisotropic diffusion problems. The proposed coarsening approaches begin by constructing a partitioning of the computational domain into a set of…