Related papers: Changing gears: Isospectrality via eigenderivative…
We focus on the algorithm underlying the main result of [A. Mestre, R. Oeckl, Generating loop graphs via Hopf algebra in quantum field theory. J. Math. Phys., 47, 122302, 2006]. This is an algebraic formula to generate all connected graphs…
The classical Fourier transform is, in essence, a way to take data and extract components (in the form of complex exponentials) which are invariant under cyclic shifts. We consider a case in which the components must instead be invariant…
We consider the generalized weighted zeta function for a finite digraph, and show that it has the Ihara expression, a determinant expression of graph zeta functions, with a certain specified definition for inverse arcs. A finite digraph in…
We consider the tomography problem of recovering a covector field on a simple Riemannian manifold based on its weighted Doppler transformation over a family of curves $\Gamma$. This is a generalization of the attenuated Doppler transform.…
One way to study an hypergraph is to attach to it a tensor. Tensors are a generalization of matrices, and they are an efficient way to encode information in a compact form. In this paper we study how properties of weighted hypergraphs are…
The standard notion of the Laplacian of a graph is generalized to the setting of a graph with the extra structure of a ``transmission`` system. A transmission system is a mathematical representation of a means of transmitting…
We construct spectral triples for path spaces of stationary Bratteli diagrams and study their associated mathematical objects, in particular their zeta function, their heat kernel expansion and their Dirichlet forms. One of the main…
A concept of germ graphs and the M-function formalism are employed to construct large families of isospectral and isoscattering graphs. This approach represents a complete departure from the original approach pioneered by Sunada, where…
In this paper, we provide a Graph Fourier Transform based approach to downsample signals on graphs. For bandlimited signals on a graph, a test is provided to identify whether signal reconstruction is possible from the given downsampled…
We establish a generalized Ihara zeta function formula for simple graphs with bounded degree. This is a generalization of the formula obtained by G. Chinta, J. Jorgenson and A. Karlsson from a vertex-transitive graph.
In this paper we resolve the complexity of the isomorphism problem on all but finitely many of the graph classes characterized by two forbidden induced subgraphs. To this end we develop new techniques applicable for the structural and…
We provide a coherent overview of a number of recent results obtained by the authors in the theory of schemes defined over the field with one element. Essentially, this theory encompasses the study of a functor which maps certain geometries…
We prove that the eigenfunctions of quantum star graphs exhibit multifractal self-similar structure in certain specified circumstances. In the semiclassical regime, when the spectral parameter and the number of vertices tend to infinity, we…
The spectral properties of signed directed graphs, which may be naturally obtained by assigning a sign to each edge of a directed graph, have received substantially less attention than those of their undirected and/or unsigned counterparts.…
We review recent progress towards the solution of exactly solved isotropic vertex models with arbitrary toroidal boundary conditions. Quantum space transformations make it possible the diagonalization of the corresponding transfer matrices…
We obtain first order linear partial differential equations which are satisfied by exponential generating functions of two variables for the number of connected bipartite graphs with given Betti number. By solving these equations…
Separated graphs provide a powerful combinatorial tool for approximating dynamical systems. This paper details the explicit construction of Bratteli-like separated graphs -- a generalization of classical Bratteli diagrams -- that encode the…
One of the key challenges in the area of signal processing on graphs is to design transforms and dictionaries methods to identify and exploit structure in signals on weighted graphs. In this paper, we first generalize graph Fourier…
We introduce the concept of regular quantum graphs and construct connected quantum graphs with discrete symmetries. The method is based on a decomposition of the quantum propagator in terms of permutation matrices which control the way…
We investigate how exchange-graph techniques can be used to study the topology of strata of meromorphic quadratic differentials. The exchange graph provides natural generators for the fundamental group. By extending the combinatorics of…