We give several bounds on the second smallest eigenvalue of the weighted Laplacian matrix of a finite graph and on the second largest eigenvalue of its weighted adjacency matrix. We establish relations between the given Cheeger-type bounds here and the known bounds in the literature. We show that one of our bounds is the best Cheeger-type bound available.

Recently developed numerical methods make possible the highaccuracy computation of eigenmodes of the Laplacian for a variety of “drums” in two dimensions. A number of computed examples are presented together with a discussion of their implications concerning bound and continuum states, isospectrality, symmetry and degeneracy, eigenvalue avoidance, resonance, localization, eigenvalue optimizatio...

We investigate the stability of the multiplicity of the lowest non-zero eigenvalue of the Neumann Laplacian on convex domains in IR under small perturbations.

This paper studies a generalization of the standard continuous-time consensus protocol, obtained by replacing the Laplacian matrix of the communication graph with the so-called deformed Laplacian. The deformed Laplacian is a second-degree matrix polynomial in the real variable s which reduces to the standard Laplacian for s equal to unity. The stability properties of the ensuing deformed consen...

This paper studies a generalization of the standard continuous-time consensus protocol, obtained by replacing the Laplacian matrix of the communication graph with the so-called deformed Laplacian. The deformed Laplacian is a second-degree matrix polynomial in the real variable s which reduces to the standard Laplacian for s equal to unity. The stability properties of the ensuing deformed consen...