Related papers: On the Eigenvalues of Graphs with Mixed Algebraic …
The hierarchical product of two graphs represents a natural way to build a larger graph out of two smaller graphs with less regular and therefore more heterogeneous structure than the Cartesian product. Here we study the eigenvalue spectrum…
Two graphs are co-spectral if their respective adjacency matrices have the same multi-set of eigenvalues. A graph is said to be determined by its spectrum if all graphs that are co-spectral with it are isomorphic to it. We consider these…
We study the sets of inertias achieved by Laplacian matrices of weighted signed graphs. First we characterize signed graphs with a unique Laplacian inertia. Then we show that there is a sufficiently small perturbation of the nonzero weights…
Persistent homology is constrained to purely topological persistence while multiscale graphs account only for geometric information. This work introduces persistent spectral theory to create a unified low-dimensional multiscale paradigm for…
Several researchers have recently explored various graph parameters that can or cannot be characterized by the spectrum of a matrix associated with a graph. In this paper we show that several NP-hard zero forcing numbers are not…
We present a spectral theory of hypergraphs that closely parallels Spectral Graph Theory. A number of recent developments building upon classical work has led to a rich understanding of "hyperdeterminants" of hypermatrices, a.k.a.…
The largest eigenvalue of a network's adjacency matrix and its associated principal eigenvector are key elements for determining the topological structure and the properties of dynamical processes mediated by it. We present a physically…
We introduce the set $\mathcal{G}^{\rm SSP}$ of all simple graphs $G$ with the property that each symmetric matrix corresponding to a graph $G \in \mathcal{G}^{\rm SSP}$ has the strong spectral property. We find several families of graphs…
Recently normalized Laplacian matrices of graphs are studied as density matrices in quantum mechanics. Separability and entanglement of density matrices are important properties as they determine the nonclassical behavior in quantum…
How the architecture of gene regulatory networks ultimately shapes gene expression patterns is an open question, which has been approached from a multitude of angles. The dominant strategy has been to identify non-random features in these…
We review the properties of eigenvectors for the graph Laplacian matrix, aiming at predicting a specific eigenvalue/vector from the geometry of the graph. After considering classical graphs for which the spectrum is known, we focus on…
We investigate the spectrum of the non-backtracking matrix of a graph. In particular, we show how to obtain eigenvectors of the non-backtracking matrix in terms of eigenvectors of a smaller matrix. Furthermore, we find an expression for the…
Statistical inference on graphs often proceeds via spectral methods involving low-dimensional embeddings of matrix-valued graph representations, such as the graph Laplacian or adjacency matrix. In this paper, we analyze the asymptotic…
For a simple graph $G$, the generalized adjacency matrix $A_{\alpha}(G)$ is defined as $A_{\alpha}(G)=\alpha D(G)+(1-\alpha)A(G), \alpha\in [0,1]$, where $A(G)$ is the adjacency matrix and $D(G)$ is the diagonal matrix of vertex degrees of…
The spectra of signed matrices have played a fundamental role in social sciences, graph theory, and control theory. In this work, we investigate the computational problems of identifying symmetric signings of matrices with natural spectral…
In this paper, we introduce the Laplacian and the signless Laplacian for the eccentricity matrix of a connected graph, referred to as the eccentricity Laplacian and the eccentricity signless Laplacian, respectively. We establish the…
The eigenvalues of the Laplacian matrix for a class of directed graphs with both positive and negative weights are studied. First, a class of directed signed graphs is investigated in which one pair of nodes (either connected or not) is…
Given a regular (connected) graph $\Gamma=(X,E)$ with adjacency matrix $A$, $d+1$ distinct eigenvalues, and diameter $D$, we give a characterization of when its distance matrix $A_D$ is a polynomial in $A$, in terms of the adjacency…
Exploring the relationship between geometry and the resonant frequencies of a shape is of interest to pure and applied mathematicians. These resonant frequencies are related to the spectrum of the Laplacian, a partial differential operator.…
Spectral properties of Coupled Map Lattices are described. Conditions for the stability of spatially homogeneous chaotic solutions are derived using linear stability analysis. Global stability analysis results are also presented. The…