Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Trees (05C05) Signed and weighted graphs (05C22) Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75) Eigenvalues, singular values, and eigenvectors (15A18)
The eigenvalues of graphs, most often defined as the eigenvalues of the adjacency matrix, have received much attention in 50's and 60's of the 20th century as a means of characterizing classes of graphs and for obtaining bounds on properties such as diameter, girth, chromatic number, connectivity, etc. The interest has since then shifted somewhat from the adjacency spectrum to the spectrum of the closely related graph Laplacian. In particular, Laplacian graph spectra are being investigated as a means of characterizing large ``small world networks and random graphs. This book focuses on mostly geometric properties of the eigenvectors themselves. Chapter 1 provides necessarry definitions (matrix representations, landscapes, generalized graph Laplacians). In Chapter 2 results concerning Laplacians are summarized (Rayleigh quotient, basic properties of eigenfunctions, quasi-abelian Cayley graphs, Perron-Frobenius theorem). Chapters 3 and 4 deal with eigenfunctions and nodal domains (Courant's nodal domain theorem, algebraic connectivity, Fiedler vectors, Perron branches, Courant-Herrmann conjecture). In Chapter 5 various computational experiments are described (nodal domains and hyperplane arrangements, hillclimbing algorithm, etc.). Finally, Chapter 6 covers Faber-Krahn type inequalities (unweighted and semiregular trees, rearrangements and Dirichlet operators, perturbations).
- Graph spectra as a systematic tool in computational biology
- Some geometric aspects of graphs and their eigenfunctions
- Nodal decompositions of graphs
- Lower bounds for the first eigenvalue of the Steklov problem on graphs
- Interlacing inequalities for eigenvalues of discrete Laplace operators
- Mysteries around the graph Laplacian eigenvalue 4
- On sums of graph eigenvalues
- Mixed Hegselmann-Krause dynamics
- Network navigation with non-Lèvy superdiffusive random walks
- Eigenvalues with respect to a weight for general boundary value problems on networks
- A combinatorial expression for the group inverse of symmetric \(M\)-matrices
- Random walk's correlation function for multi-objective NK landscapes and quadratic assignment problem
- Explicit construction of the eigenvectors and eigenvalues of the graph Laplacian on the Cayley tree
- A Fiedler center for graphs generalizing the characteristic set
- Maximization of combinatorial Schrödinger operator's smallest eigenvalue with Dirichlet boundary condition
- Spectrally optimized pointset configurations
- Schur reduction of trees and extremal entries of the Fiedler vector
- Green functions on product networks
- Graphs of given order and size and minimum algebraic connectivity
- Quadratic embedding constants of graph joins
- Applications of combinatorial matrix theory to Laplacian matrices of graphs
- The rotational dimension of a graph
- Anomalous nodal count and singularities in the dispersion relation of honeycomb graphs
- Leaders in multi-agent controllability under consensus algorithm and tree topology
- Inexact Matching of Large and Sparse Graphs Using Laplacian Eigenvectors
- scientific article; zbMATH DE number 3979631 (Why is no real title available?)
- scientific article; zbMATH DE number 4050157 (Why is no real title available?)
- Dirichlet problems on graphs with ends
- On nodal domains and higher-order Cheeger inequalities of finite reversible Markov processes
- The Kirchhoff indexes of some composite networks
- Minimum vertex covers and the spectrum of the normalized Laplacian on trees
- Spectra of Laplacian matrices of weighted graphs: structural genericity properties
- Some properties of Laplacian eigenvectors
- Random walks with long-range steps generated by functions of Laplacian matrices
- Nodal domains of eigenvectors for 1-Laplacian on graphs
- Green's function in partial subdivision networks
- Node-to-node pinning control of complex networks
- Inverse source problem in a forced network
- On Hadamard diagonalizable graphs
- Minimum supports of eigenfunctions of graphs: a survey
- An explicit formula for differences between Laplacian-eigenvector components using coalesced graphs
- Symmetric matrices, signed graphs, and nodal domain theorems
- A perturbed averaging operator on finite graphs
- Bifurcations in Nagumo equations on graphs and Fiedler vectors
- On the coexistence of competing memes in the same social network
- Extremal Graph Realizations and Graph Laplacian Eigenvalues
- A regularized projection immersed boundary method for smooth boundary forces
- Trapping of continuous-time quantum walks on Erdős-Rényi graphs
- Random walks associated with symmetric \(M\)-matrices
- Cycle-star motifs: network response to link modifications
- An optimal control problem with state constraints in a spatio-temporal economic growth model on networks
- Locally supported, quasi-interpolatory bases for the approximation of functions on graphs
- The \(M\)-matrix inverse problem for singular and symmetric Jacobi matrices
- Minimum leader selection for controllability of undirected graphs with leader-follower framework
- Inverse eigenvalue problem for discrete Schrödinger operators of a graph
- Symmetries of hypergraphs and some invariant subspaces of matrices associated with hypergraphs
- The multilayer garbage disposal game
- Spectral measures and dominant vertices in graphs of bounded degree
- Random walks and flights over connected graphs and complex networks
- Cheeger's cut, maxcut and the spectral theory of 1-Laplacian on graphs
- Discrete operators on graphs and networks
- Spectral properties of King's graph
- Inverse Fiedler vector problem of a graph
- The Kirchhoff indices of join networks
- Analysis of a data matrix and a graph: metagenomic data and the phylogenetic tree
- Quasiabelian landscapes of the traveling salesman problem are elementary
- On the spectrum of the normalized graph Laplacian
- Algebraic connectivity and degree sequences of trees
- Kirchhoff indexes of a network
- On the isoperimetric spectrum of graphs and its approximations
- A note on Fiedler vectors interpreted as graph realizations
This page was built for publication: Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2642409)
