Related papers: Spectral gap for quantum graphs and their connecti…
For vertex and edge connectivity we construct infinitely many pairs of regular graphs with the same spectrum, but with different connectivity.
We prove spectral localization for infinite metric graphs with a self-adjoint Laplace operator and a random potential. To do so we adapt the multiscale analysis (MSA) from the R^d-case to metric graphs. In the MSA a covering of the graph is…
Measuring the topological overlap of two graphs becomes important when assessing the changes between temporally adjacent graphs in a time-evolving network. Current methods depend on the fraction of nodes that have persisting edges. This…
A graph is trivial if it contains one vertex and no edges. The essential connectivity $\kappa^{\prime}$ of $G$ is defined to be the minimum number of vertices of $G$ whose removal produces a disconnected graph with at least two non-trivial…
Spectral graph convolutional networks are generalizations of standard convolutional networks for graph-structured data using the Laplacian operator. A common misconception is the instability of spectral filters, i.e. the impossibility to…
Metric graphs are often introduced based on combinatorics, upon "associating" each edge of a graph with an interval; or else, casually "gluing" a collection of intervals at their endpoints in a network-like fashion. Here we propose an…
We introduce a new notion of graph sparsificaiton based on spectral similarity of graph Laplacians: spectral sparsification requires that the Laplacian quadratic form of the sparsifier approximate that of the original. This is equivalent to…
We derive exact equations that determine the spectra of undirected and directed sparsely connected regular graphs containing loops of arbitrary length. The implications of our results to the structural and dynamical properties of networks…
Spectral graph theory is a captivating area of graph theory that employs the eigenvalues and eigenvectors of matrices associated with graphs to study them. In this paper, we present a collection of $20$ topics in spectral graph theory,…
The spectrum of a graph is closely related to many graph parameters. In particular, the spectral gap of a regular graph which is the difference between its valency and second eigenvalue, is widely seen an algebraic measure of connectivity…
We establish convergence of spectra of Neumann Laplacian in a thin neighborhood of a branching 2D structure in 3D to the spectrum of an appropriately defined operator on the structure itself. This operator is a 2D analog of the well known…
The spectral dimension is an indicator of geometry and topology of spacetime and a tool to compare the description of quantum geometry in various approaches to quantum gravity. This is possible because it can be defined not only on smooth…
We examine the band-gap structure of the spectrum of the Neumann problem for the Laplace operator in a strip with periodic dense transversal perforation by identical holes of a small diameter $\varepsilon>0$. The periodicity cell itself…
The term interlacing refers to systematic inequalities between the sequences of eigenvalues of two operators defined on objects related by a specific oper- ation. In particular, knowledge of the spectrum of one of the objects then implies…
We present a number of relations involving the number of cliques in a graph and its spectral radius.
For the almost Mathieu operator with a small coupling constant, for a series of spectral gaps, we describe the asymptotic locations of the gaps and get lower bounds for their lengths. The results are obtained by analysing a monodromy…
We compute spectra of symmetric random matrices defined on graphs exhibiting a modular structure. Modules are initially introduced as fully connected sub-units of a graph. By contrast, inter-module connectivity is taken to be incomplete.…
For a connected graph, the distance spectral radius is the largest eigenvalue of its distance matrix, and the distance energy is defined as the sum of the absolute values of the eigenvalues of its distance matrix. We establish lower and…
We consider discrete Schr\"odinger operators with periodic potentials on periodic graphs. Their spectra consist of a finite number of bands. We perturb a periodic graph by adding edges in a periodic way (without changing the vertex set) and…
Aldous and Fill conjectured that the maximum relaxation time for the random walk on a connected regular graph with $n$ vertices is $(1+o(1)) \frac{3n^2}{2\pi^2}$. This conjecture can be rephrased in terms of the spectral gap as follows: the…