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 Delta is bounded by O(nDelta7/5/log1/5−o(1)n) for any Delta, and by O(nlog1/2d/log1/4−o(1)n) for simple d-regular graphs when dgelog1/4n. In fact, the same bounds hold for the number of eigenvalues in any interval of width lambda2/logDelta1−o(1)n containing the second eigenvalue lambda2. The main ingredient in the proof is a polynomial (in k) lower bound on the typical support of a closed random walk of length 2k 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.












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)