Interlacing inequalities for eigenvalues of discrete Laplace operators
- 318 Downloads
The term “interlacing” refers to systematic inequalities between the sequences of eigenvalues of two operators defined on objects related by a specific operation. In particular, knowledge of the spectrum of one of the objects then implies eigenvalue bounds for the other one. In this paper, we therefore develop topological arguments in order to derive such analytical inequalities. We investigate, in a general and systematic manner, interlacing of spectra for weighted simplicial complexes with arbitrary weights. This enables us to control the spectral effects of operations like deletion of a subcomplex, collapsing and contraction of a simplex, coverings and simplicial maps, for absolute and relative Laplacians. It turns out that many well-known results from graph theory become special cases of our general results and consequently admit improvements and generalizations. In particular, we derive a number of effective eigenvalue bounds.
KeywordsWeight Function Laplace Operator Simplicial Complex Weighted Graph Laplacian Spectrum
Unable to display preview. Download preview PDF.
- 1.Biyikoglu, T., Leydold, J., Stadler, P.F.: Laplacian Eigenvectors of Graphs: Perron-Frobenius and Faber-Krahn type theorems. Lecture Notes in Mathematics 191. Springer, Berlin (2007)Google Scholar
- 6.Friedman, J.: Computing betti numbers via combinatorial laplacians. In: Proceedings of the 28th Annual ACM Symposium on Theory of Computing, pp. 386–391, (1996)Google Scholar
- 12.Horak, D., Jost, J.: Spectra of combinatorial Laplace operators on simplicial complexes. arXiv:1105.2712v3 (2011)Google Scholar
- 14.Massey W.S.: A basic course in algebraic topology. Graduate texts in mathematics. Springer, New York (1991)Google Scholar