Related papers: Constructing Cospectral Vertices Through Orbits of…
We present enumeration results on the number of connected graphs up to 10 vertices for which there is at least one other graph with the same spectrum (a cospectral mate), or at least one other graph with the same Smith normal form…
We introduce an unsupervised graph embedding that trades off local node similarity and connectivity, and global structure. The embedding is based on a generalized graph Laplacian, whose eigenvectors compactly capture both network structure…
In this paper, we investigate spectral properties of the adjacency tensor, Laplacian tensor and signless Laplacian tensor of general hypergraphs (including uniform and non-uniform hypergraphs). We obtain some bounds for the spectral radius…
We present a new construction for obtaining pairs of higher-step isospectral Riemannian nilmanifolds and compare several resulting new examples. In particular, we present new examples of manifolds that are isospectral on functions, but not…
We consider spectral methods that uncover hidden structures in directed networks. We establish and exploit connections between node reordering via (a) minimizing an objective function and (b) maximizing the likelihood of a random graph…
We analyze single particle coherence and interference in the presence of particle loss and derive an inequality that relates the preservation of coherence, the creation of superposition with the vacuum, and the degree of particle loss. We…
In this paper, we investigate various algebraic and graph theoretic properties of the distance matrix of a graph. Two graphs are $D$-cospectral if their distance matrices have the same spectrum. We construct infinite pairs of $D$-cospectral…
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…
In this note we present some abstract ideas how one can construct spaces from building blocks according to a graph. The coupling is expressed via boundary pairs, and can be applied to very different spaces such as discrete graphs, quantum…
We study the problem of generating graphs with prescribed degree sequences for bipartite, directed, and undirected networks. We first propose a sequential method for bipartite graph generation and establish a necessary and sufficient…
Using vertex algebra techniques, we determine a set of generators for the cohomology ring of the Hilbert schemes of points on an arbitrary smooth projective surface over the field of complex numbers.
We construct spectral triples on C*-algebraic extensions of unital C*-algebras by stable ideals satisfying a certain Toeplitz type property using given spectral triples on the quotient and ideal. Our construction behaves well with respect…
By using a combination of algebraic, geometric, and dynamical techniques, together with input from higher dimensional Diophantine approximation, we give a complete characterization of all linearly repetitive cut and project sets with…
We study the symmetry properties of the spectra of normalized Laplacians on signed graphs. We find a new machinery that generates symmetric spectra for signed graphs, which includes bipartiteness of unsigned graphs as a special case.…
A line multigraph is obtained from a hypergraph as follows: the vertices of the multigraph correspond to the hyperedges of the hypergraph, and the number of edges between two vertices is given by the number of vertices shared by the…
In this paper, we present GGSD, a novel graph generative model based on 1) the spectral decomposition of the graph Laplacian matrix and 2) a diffusion process. Specifically, we propose to use a denoising model to sample eigenvectors and…
We investigate spectral properties of the Laplace operator on a class of non-compact Riemannian manifolds. For a given number $N$ we construct periodic (i.e. covering) manifolds such that the essential spectrum of the corresponding…
Random graphs with a given degree sequence are often constructed using the configuration model, which yields a random multigraph. We may adjust this multigraph by a sequence of switchings, eventually yielding a simple graph. We show that,…
In this article we describe an algorithm that can be applied for the generation of various classes of maps on orientable surfaces. It uses existing generators for abstract graphs and combines them with an efficient embedding and isomorphism…
We present a method of creation of photonic structures whose optical spectrum of the reflection coefficient has an arbitrary shape and has predetermined features. We develop an algorithm for the construction of a photonic crystal structure,…