## Abstract 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
Symmetrization Inequalities for Difference Equations on Graphs
β Scribed by Alexander R. Pruss
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 213 KB
- Volume
- 22
- Category
- Article
- ISSN
- 0196-8858
No coin nor oath required. For personal study only.
β¦ Synopsis
We prove symmetrization inequalities for positive solutions of not necessarily . linear difference equations of the form
where β¬ is a discrete Laplacian, is a convex decreasing function, c is a positive function and is a real function, on subsets of X = Y, where X is a graph and Y Ε½ . is the line β«,ήβ¬ the circle graph β«ήβ¬ , the m-regular tree T , the line graph L T of m m m T , or the edge graph of the octahedron. Instead of β¬, we may also have some m other operators, including the heat operator. The typical result says that we use a discrete version of Steiner symmetrization to symmetrize the domain on which the equation is defined, and if all the functions and boundary values involved are Ε½ . appropriately symmetrized as well, then the increasing convex means of u x, ΠΈ are increased for each fixed x g X.
π SIMILAR VOLUMES
has presented some invariants for difference equations and systems of difference equations of rational Ε½ . form with constant and periodic coefficients of certain period . We report that the presented invariants as well as their difference equations can be generalized.