Related papers: Changing gears: Isospectrality via eigenderivative…
We show recent results of the application of spectral analysis in the setting of the Monte Carlo approach to Quantum Gravity known as Causal Dynamical Triangulations (CDT), discussing the behavior of the lowest lying eigenvalues of the…
We present a simple construction that maps quantum circuits to graphs and vice-versa. Inspired by the results of D.A. Lidar linking the Ising partition function with quadratically signed weight enumerators (QWGTs), we also present a…
This paper explores the domain of meromorphic extension for the dynamical zeta function associated to a class of one-dimensional differentiable parabolic maps featuring an indifferent fixed point. We establish the connection between this…
The graph Fourier transform (GFT) is an important tool for graph signal processing, with applications ranging from graph-based image processing to spectral clustering. However, unlike the discrete Fourier transform, the GFT typically does…
Conduction graphs are defined here in order to elucidate at a glance the often complicated conduction behaviour of molecular graphs as ballistic molecular conductors. The graph $G^{\mathrm C}$ describes all possible conducting devices…
We introduce a theoretical framework for differentiable surface evolution that allows discrete topology changes through the use of topological derivatives for variational optimization of image functionals. While prior methods for inverse…
We propose a simple method for resolution of co-spectrality of Schr\"odinger operators on metric graphs. Our approach consists of attaching a lead to them and comparing the $S$-functions of the corresponding scattering problems on these…
The analysis of signals defined over a graph is relevant in many applications, such as social and economic networks, big data or biological networks, and so on. A key tool for analyzing these signals is the so called Graph Fourier Transform…
We consider the normalized Laplace operator for directed graphs with positive and negative edge weights. This generalization of the normalized Laplace operator for undirected graphs is used to characterize directed acyclic graphs. Moreover,…
We completely determine the spectrum of an $I$-graph, that is, the eigenvalues of its adjacency matrix. We apply our result to prove known characterizations of connectedness and bipartiteness in $I$-graphs by using an spectral approach.…
This paper is concerned with the inverse scattering and the transmission eigenvalues for anisotropic periodic layers. For the inverse scattering problem, we study the Factorization method for shape reconstruction of the periodic layers from…
The observed output of an interferometer is the result of interference among the parts of the input light beam traveling along each possible optical path. In complex systems, writing down all these possible optical paths and computing their…
The off-diagonal Bethe Ansatz method [1] is used to revisit the periodic XXX Heisenberg spin-1/2 chain. It is found that the spectrum of the transfer matrix can be characterized by an inhomogeneous T-Q relation, a natural but nontrivial…
Godsil (1985) defined a graph to be invertible if it has a non-singular adjacency matrix whose inverse is diagonally similar to a nonnegative integral matrix; the graph defined by the last matrix is then the inverse of the original graph.…
Transformer models have recently gained popularity in graph representation learning as they have the potential to learn complex relationships beyond the ones captured by regular graph neural networks. The main research question is how to…
This paper deals with the partition function of the Ising model from statistical mechanics, which is used to study phase transitions in physical systems. A special case of interest is that of the Ising model with constant energies and…
We introduce a generalized Grover matrix of a graph and present an explicit formula for its characteristic polynomial. As a corollary, we give the spectra for the generalized Grover matrix of a regular graph. Next, we define a zeta function…
This note introduces a result on the location of eigenvalues, i.e., the spectrum, of the Laplacian for a family of undirected graphs with self-loops. We extend on the known results for the spectrum of undirected graphs without self-loops or…
Spectral graph signal processing is traditionally built on self-adjoint Laplacians, where orthogonal eigenbases yield an energy-preserving Fourier transform and a variational frequency ordering via a real Dirichlet form. Directed networks…
The pathway is a biological term that refers to a series of interactions between molecules in a cell that causes a certain product or a change in the cell. Pathway analysis is a powerful method for gene expression analysis. Through pathway…