The totality of the eigenvalues of the Laplacian of a compact Riemannian manifold is called the spectrum. We describe how the spectrum determines a Riemannian manifold. The continuity of the eigenvalue of the Laplacian, Cheeger and Yau's estimate of the first eigenvalue, the Lic…
"The totality of the eigenvalues of the Laplacian of a compact Riemannian manifold is called the spectrum. We describe how the spectrum determines a Riemannian manifold. The continuity of the eigenvalue of the Laplacian, Cheeger and Yau's estimate of the first eigenvalue, the Li…
The totality of the eigenvalues of the Laplacian of a compact Riemannian manifold is called the spectrum. We describe how the spectrum determines a Riemannian manifold. The continuity of the eigenvalue of the Laplacian, Cheeger and Yau's estimate of the first eigenvalue, the Lic…
Tensors, or hypermatrices, are multi-arrays with more than two indices. In the last decade or so, many concepts and results in matrix theory--some of which are nontrivial--have been extended to tensors and have a wide range of applications (for example, spectral hypergraph theor…
Tensors, or hypermatrices, are multi-arrays with more than two indices. In the last decade or so, many concepts and results in matrix theory--some of which are nontrivial--have been extended to tensors and have a wide range of applications (for example, spectral hypergraph theor…
Spectral graph theory starts by associating matrices to graphs - notably, the adjacency matrix and the Laplacian matrix. The general theme is then, firstly, to compute or estimate the eigenvalues of such matrices, and secondly, to relate the eigenvalues to structural properties …
A brief introduction to spectral graph theory
by Nica, Bogdan
fromEMS textbooks in mathematics
"Spectral graph theory starts by associating matrices to graphs - notably, the adjacency matrix and the Laplacian matrix. The general theme is then, firstly, to compute or estimate the eigenvalues of such matrices, and secondly, to relate the eigenvalues to structural properties…
A brief introduction to spectral graph theory
by Nica, Bogdan
fromEMS textbooks in mathematics
Spectral graph theory starts by associating matrices to graphs - notably, the adjacency matrix and the Laplacian matrix. The general theme is then, firstly, to compute or estimate the eigenvalues of such matrices, and secondly, to relate the eigenvalues to structural properties …
This book provides an introduction to the inverse eigenvalue problem for graphs (IEP-G) and the related area of zero forcing, propagation, and throttling. The IEP-G grew from the intersection of linear algebra and combinatorics and has given rise to both a rich set of deep probl…
