Support of closed walks and second eigenvalue multiplicity of graphs
From MaRDI portal
Abstract: We show that the multiplicity of the second normalized adjacency matrix eigenvalue of any connected graph of maximum degree is bounded by for any , and by for simple -regular graphs when . In fact, the same bounds hold for the number of eigenvalues in any interval of width containing the second eigenvalue . The main ingredient in the proof is a polynomial (in ) lower bound on the typical support of a closed random walk of length in any connected graph, which in turn relies on new lower bounds for the entries of the Perron eigenvector of submatrices of the normalized adjacency matrix.
Recommendations
- Closed walks and eigenvalues of abelian Cayley graphs
- On the second eigenvalue and random walks in random d-regular graphs
- The Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphs
- Multiplicity of the second‐largest eigenvalue of a planar graph
- Walks and eigenvalues of signed graphs
- Bounds on the number of closed walks in a graph and its applications
- The second largest eigenvalue and vertex-connectivity of regular multigraphs
- On the second eigenvalue of hypergraphs
- Graphs with high second eigenvalue multiplicity
- Walks and the spectral radius of graphs
Cited in
(6)- Graphs with high second eigenvalue multiplicity
- Maximal multiplicity of Laplacian eigenvalues in negatively curved surfaces
- Equiangular lines via matrix projection
- Graph theory. Abstracts from the workshop held January 5--10, 2025
- Limit vectors of the top k eigenvalues of d-regular graphs
- Sparsest cut and eigenvalue multiplicities on low degree abelian Cayley graphs
This page was built for publication: Support of closed walks and second eigenvalue multiplicity of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6087011)