Interlacing inequalities for eigenvalues of discrete Laplace operators

Details Interlacing inequalities for eigenvalues of discrete Laplace operators Interlacing inequalities for eigenvalues of discrete Laplace operators

2011-11-08

arxiv.org/abs/1111.1836v2

Mathematics

Spectral Theory

41 page

Scientific paper

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 eigenvalue bounds for the other one. In this paper, we therefore develop topological arguments in order to de- rive such analytical inequalities. We investigate, in a general and systematic manner, interlacing of spectra for weighted simplicial complexes with arbi- trary weights. This enables us to control the spectral effects of operations like deletion of a subcomplex, collapsing and contraction of a simplex, cover- ings 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.

Affiliated with

Also associated with

No associations

Rating

Interlacing inequalities for eigenvalues of discrete Laplace operators does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Interlacing inequalities for eigenvalues of discrete Laplace operators, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Interlacing inequalities for eigenvalues of discrete Laplace operators will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-53274