Laplacian Eigenvectors of Graphs : Perron-Frobenius and Faber-Krahn Type Theorems
Eigenvectors of graph Laplacians have not, to date, been the subject of expository articles and thus they may seem a surprising topic for a book. The authors propose two motivations for this new LNM volume: (1) There are fascinating subtle differences between the properties of solutions of Schröding...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Livre numérique |
| Sprache: | Anglais |
| Veröffentlicht: |
Berlin, Heidelberg :
Springer Berlin Heidelberg
[20..].
Cham : Springer Nature |
| Ausgabe: | 1st ed. 2007. |
| Schriftenreihe: | Lecture Notes in Mathematics
1915 |
| Schlagworte: | |
| Online Zugang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Anmerkung: |
L'impression du document génère 120 p. Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Laplacian eigenvectors of graphs, Perron-Frobenius and Faber-Krahn type theorems, Türker Biyikožlu, Josef Leydold, Peter F. Stadler, 2007, Berlin, Springer, 1 volume (viii-115 pages), Lecture notes in mathematics, 978-3-540-73509-0 • Laplacian Eigenvectors of Graphs, Texte imprimé, 9783540840664 • Laplacian eigenvectors of graphs, Perron-Frobenius and Faber-Krahn type theorems, Türker Biyikožlu, Josef Leydold, Peter F. Stadler, 2007, Berlin, Springer, 1 volume (viii-115 pages), Lecture notes in mathematics, 978-3-540-73509-0 |
| Zusammenfassung: | Eigenvectors of graph Laplacians have not, to date, been the subject of expository articles and thus they may seem a surprising topic for a book. The authors propose two motivations for this new LNM volume: (1) There are fascinating subtle differences between the properties of solutions of Schrödinger equations on manifolds on the one hand, and their discrete analogs on graphs. (2) "Geometric" properties of (cost) functions defined on the vertex sets of graphs are of practical interest for heuristic optimization algorithms. The observation that the cost functions of quite a few of the well-studied combinatorial optimization problems are eigenvectors of associated graph Laplacians has prompted the investigation of such eigenvectors. The volume investigates the structure of eigenvectors and looks at the number of their sign graphs ("nodal domains"), Perron components, graphs with extremal properties with respect to eigenvectors. The Rayleigh quotient and rearrangement of graphs form the main methodology |
|---|---|
| Beschreibung: | L'impression du document génère 120 p. Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Bibliographie: | Bibliogr. Index |
| ISBN: | 9783540735106 |
| ISSN: | 1617-9692 |
| Zugangseinschränkungen: | Accès en ligne pour les établissements français bénéficiaires des licences nationales Accès soumis à abonnement pour tout autre établissement Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 |