English
Related papers

Related papers: Changing gears: Isospectrality via eigenderivative…

200 papers

The Fast Fourier Transform is extended to functions on finite graphs whose edges are identified with intervals of finite length. Spectral and pseudospectral methods are developed to solve a wide variety of time dependent partial…

Numerical Analysis · Mathematics 2025-07-11 Robert Carlson

We compute the equivariant zeta function for bundles over infinite graphs and for infinite covers. In particular, we give a ``transfer formula'' for the zeta function of infinite graph covers. Also, when the infinite cover is given as a…

Combinatorics · Mathematics 2007-05-23 Samuel Cooper , Stratos Prassidis

We put forward the concept of measure graphs. These are (possibly uncountable) graphs equipped with an action of a groupoid and a measure invariant under this action. Examples include finite graphs, periodic graphs, graphings and…

Metric Geometry · Mathematics 2018-01-10 Daniel Lenz , Felix Pogorzelski , Marcel Schmidt

We introduce AutoGraph, a scalable autoregressive model for attributed graph generation using decoder-only transformers. By flattening graphs into random sequences of tokens through a reversible process, AutoGraph enables modeling graphs as…

Machine Learning · Computer Science 2025-12-09 Dexiong Chen , Markus Krimmel , Karsten Borgwardt

We construct spectral zeta functions for the Dirac operator on metric graphs. We start with the case of a rose graph, a graph with a single vertex where every edge is a loop. The technique is then developed to cover any finite graph with…

Mathematical Physics · Physics 2016-10-13 J. M. Harrison , T. Weyand , K. Kirsten

Construction of graphs with equal eigenvalues (co-spectral graphs) is an interesting problem in spectral graph theory. Seidel switching is a well-known method for generating co-spectral graphs. From a matrix theoretic point of view, Seidel…

Combinatorics · Mathematics 2016-08-30 Supriyo Dutta , Bibhas Adhikari , Subhashish Banerjee

We propose the Interferometric Graph Transform (IGT), which is a new class of deep unsupervised graph convolutional neural network for building graph representations. Our first contribution is to propose a generic, complex-valued spectral…

Machine Learning · Computer Science 2020-06-11 Edouard Oyallon

A method for estimating the spectral gap along with higher eigenvalues of nonequilateral quantum graphs has been introduced by Amini and Cohen-Steiner recently: it is based on a new transference principle between discrete and continuous…

Functional Analysis · Mathematics 2020-12-11 Delio Mugnolo , Marvin Plümer

Construction of non-isomorphic cospectral graphs is a nontrivial problem in spectral graph theory specially for large graphs. In this paper, we establish that graph theoretical partial transpose of a graph is a potential tool to create…

Combinatorics · Mathematics 2018-08-13 Supriyo Dutta , Bibhas Adhikari

Quantum graphs can be extended to scattering systems when they are connected by leads to infinity. It is shown that for certain extensions, the scattering matrices of isospectral graphs are conjugate to each other and their poles…

Mathematical Physics · Physics 2016-01-19 Ram Band , Adam Sawicki , Uzy Smilansky

In this paper we consider the problem of defining transforms for signals on directed graphs, with a specific focus on defective graphs where the corresponding graph operator cannot be diagonalized. Our proposed method is based on the Schur…

Signal Processing · Electrical Eng. & Systems 2021-10-19 Julia Barrufet , Antonio Ortega

Along the recently trodden path of studying certain number theoretic properties of gauge theories, especially supersymmetric theories whose vacuum manifolds are non-trivial, we investigate Ihara's Graph Zeta Function for large classes of…

Mathematical Physics · Physics 2011-03-21 Yang-Hui He

Babel has shown that for an extended class of chordal (6, 3) graphs the coarsest regular simplicial partition is equivalent to the graph's automorphism partition. We give a reversible transformation for any graph to one of these graph by…

Computational Complexity · Computer Science 2018-10-03 M. Delacorte

Spectral hypergraph theory studies the structural properties of a hypergraph that can be inferred from the eigenvalues and the eigenvectors of either matrices or tensors associated with it. In this paper we study the spectral…

Combinatorics · Mathematics 2026-04-08 Aida Abiad , Joshua Cooper , Utku Okur

We investigate spectral quantities of quantum graphs by expanding them as sums over pseudo orbits, sets of periodic orbits. Only a finite collection of pseudo orbits which are irreducible and where the total number of bonds is less than or…

Mathematical Physics · Physics 2015-06-05 Ram Band , Jonathan M. Harrison , Christopher H. Joyner

L.A. Bunimovich and B.Z. Webb developed a theory for isospectral graph reduction. We make a simple observation regarding the relation between eigenvectors of the original graph and its reduction, that sheds new light on this theory. As an…

Dynamical Systems · Mathematics 2015-01-30 Pedro Duarte , Maria Joana Torres

To a finite, connected, unoriented graph of Betti-number g>=2 and valencies >=3 we associate a finitely summable, commutative spectral triple (in the sense of Connes), whose induced zeta functions encode the graph. This gives another…

Operator Algebras · Mathematics 2009-04-09 Jan Willem de Jong

We construct a new class of directed and bipartite random graphs whose topology is governed by the analytic properties of L-functions. The bipartite L-graphs and the multiplicative zeta graphs are relevant examples of the proposed…

Mathematical Physics · Physics 2022-01-04 Piergiulio Tempesta

The appearance of multiple zeta values in anomalous dimensions and $\beta$-functions of renormalizable quantum field theories has given evidence towards a motivic interpretation of these renormalization group functions. In this paper we…

Algebraic Geometry · Mathematics 2009-11-11 Spencer Bloch , Hélène Esnault , Dirk Kreimer

Conjecturally, almost all graphs are determined by their spectra. This problem has also been studied for variants such as the spectra of the Laplacian and signless Laplacian. Here we consider the problem of determining graphs with Ihara and…

Combinatorics · Mathematics 2015-09-02 Christina Durfee , Kimball Martin