Related papers: Distinguishing co-spectral quantum graphs by scatt…
We prove that if the number of edges does not exceed 7 then the asymptotics of eigenvalues of the Dirichlet problem uniquely determine the shape of the graph.
Spectral Clustering is one of the most traditional methods to solve segmentation problems. Based on Normalized Cuts, it aims at partitioning an image using an objective function defined by a graph. Despite their mathematical attractiveness,…
The effective action includes all quantum corrections arising in a given quantum field theory. Thus it serves as a powerful generating functional from which quantum-corrected scattering amplitudes can be constructed via tree-level…
Let $(G_\epsilon)_{\epsilon>0}$ be a family of '$\epsilon$-thin' Riemannian manifolds modeled on a finite metric graph $G$, for example, the $\epsilon$-neighborhood of an embedding of $G$ in some Euclidean space with straight edges. We…
We construct a bosonic quantum field on a general quantum graph. Consistency of the construction leads to the calculation of the total scattering matrix of the graph. This matrix is equivalent to the one already proposed using generalized…
The scattering number of a graph $G$ was defined by Jung in 1978 as $sc(G) = max \{\omega(G - S) - |S|, S \subseteq V, \omega(G - S) \neq1\}$ where $\omega(G - S) $ is the number of connected components of the graph $G-S$. It is a measure…
Because of the significant increase in size and complexity of the networks, the distributed computation of eigenvalues and eigenvectors of graph matrices has become very challenging and yet it remains as important as before. In this paper…
We study the spectrum of some periodic differential operators, in particular the periodic Schr\"{o}dinger operator acting on infinite $n$-cubic graphs. Using Floquet-Bloch theory, we derive and analyze on the dispersion relations of the…
We study the inverse scattering for Schr{\"o}dinger operators on locally perturbed periodic lattices. We show that the associated scattering matrix is equivalent to the Dirichlet-to-Neumann map for a boundary value problem on a finite part…
We define a graph to be $S$-regular if it contains an equitable partition given by a matrix $S$. These graphs are generalizations of both regular and bipartite, biregular graphs. An $S$-regular matrix is defined then as a matrix on an…
We propose the spectral degree exponent as a novel graph metric. Although Hofmeister \cite{HofmeisterThesis} has studied the same metric, we generalise Hofmeister's work to weighted graphs. We provide efficient iterative formulas and bounds…
We discuss the problem of embedding graphs in the plane with restrictions on the vertex mapping. In particular, we introduce a technique for drawing planar graphs with a fixed vertex mapping that bounds the number of times edges bend. An…
A continuous-time quantum walk on a dynamic graph evolves by Schr\"odinger's equation with a sequence of Hamiltonians encoding the edges of the graph. This process is universal for quantum computing, but in general, the dynamic graph that…
We propose an approach to graph sparsification based on the idea of preserving the smallest $k$ eigenvalues and eigenvectors of the Graph Laplacian. This is motivated by the fact that small eigenvalues and their associated eigenvectors tend…
In this paper we study the noncompact star-type graph with perturbed radial Schrodinger equation on each ray and the matching conditions of some special form at the vertex. The results include the uniqueness theorem and constructive…
It is not hard to find many complete bipartite graphs which are not determined by their spectra. We show that the graph obtained by deleting an edge from a complete bipartite graph is determined by its spectrum. We provide some graphs, each…
Let $n$ be any positive integer and let $F_n$ be the friendship (or Dutch windmill) graph with $2n+1$ vertices and $3n$ edges. Here we study graphs with the same adjacency spectrum as the $F_n$. Two graphs are called cospectral if the…
The scattering number $s(G)$ of graph $G=(V,E)$ is defined as $s(G)$=max\big\{$c(G-S)-|S|$\big\}, where the maximum is taken over all proper subsets $S\subseteq V(G)$, and $c(G-S)$ denotes the number of components of $G-S$. In 1988, Enomoto…
Spectral embedding of graphs uses the top k non-trivial eigenvectors of the random walk matrix to embed the graph into R^k. The primary use of this embedding has been for practical spectral clustering algorithms [SM00,NJW02]. Recently,…
The spectral theory of graphs provides a bridge between classical signal processing and the nascent field of graph signal processing. In this paper, a spectral graph analogy to Heisenberg's celebrated uncertainty principle is developed.…