LINEAR ALGEBRA AND ITS APPLICATIONS, vol.586, pp.111-129, 2020 (SCI-Expanded)
A generalized Fourier analysis on arbitrary graphs calls for a detailed knowledge of the eigenvectors of the graph Laplacian. Using the symmetries of the Cayley tree, we recursively construct the family of eigenvectors with exponentially growing eigenspaces, associated with eigenvalues in the lower part of the spectrum. The spectral gap decays exponentially with the tree size, for large trees. The eigenvalues and eigenvectors obey recursion relations which arise from the nested geometry of the tree. (C) 2019 Elsevier Inc. All rights reserved.