Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
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)
Butler S.: Interlacing for weighted graphs using the normalized Laplacian. Electron. J. Linear Algebra 16, 90–98 (2007)
Chen G., Davis D., Hall F., Li Z., Patel K., Stewart M.: An interlacing result on normalized Laplacians. SIAM J. Discrete Math. 18, 353–361 (2004)
Duval A.M., Reiner V.: Shifted simplicial complexes are Laplacian integral. Trans. Amer. Math. Soc. 354(11), 4313–4344 (2002)
Duval Art.M.: A common recursion for laplacians of matroids and shifted simplicial complexes. Doc. Math. 10, 583–618 (2005)
Friedman, J.: Computing betti numbers via combinatorial laplacians. In: Proceedings of the 28th Annual ACM Symposium on Theory of Computing, pp. 386–391, (1996)
Godsil C.D., Royle G.: Algebraic graph theory. Graduate texts in mathematics. Springer, Heidelberg (2001)
Grone R., Merris R., Sunder V.S.: The Laplacian spectrum of a graph. SIAM J. Matrix Anal. Appl. 11, 218–238 (1990)
Gustavson R.: Laplacians of covering complexes. Rose Hulman Undegrad. Math. J., 12(1), 1–18 (2011)
Haemers W.H.: Interlacing eigenvalues and graphs. Linear Algebra Appl. 226-228, 593–616 (1995)
Hatcher A.: Algebraic Topology. Cambridge University Press, Cambridge (2002)
Horak, D., Jost, J.: Spectra of combinatorial Laplace operators on simplicial complexes. arXiv:1105.2712v3 (2011)
Lotker Z.: Note on deleting a vertex and weak interlacing of the Laplacian spectrum. Electron. J. Linear Algebra 16, 62–72 (2007)
Massey W.S.: A basic course in algebraic topology. Graduate texts in mathematics. Springer, New York (1991)
Merris R.: Laplacian matrices of graphs: a survey. Linear Algebra Appl. 197-198, 143–176 (1994)
Rotman J.J.: Covering complexes with application to algebra. Rocky Mountain J. Math. 3, 641–674 (1973)
So W.: Rank one perturbation and its application to the Laplacian spectrum of a graph. Linear Multilinear Algebra 46, 193–198 (1999)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Horak, D., Jost, J. Interlacing inequalities for eigenvalues of discrete Laplace operators. Ann Glob Anal Geom 43, 177–207 (2013). https://doi.org/10.1007/s10455-012-9341-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10455-012-9341-1