Extreme Values of the Fiedler Vector on Trees
arXiv:1912.08327
Abstract
Let be a connected tree on vertices and let denote the Laplacian matrix on . The second-smallest eigenvalue , also known as the algebraic connectivity, as well as the associated eigenvector have been of substantial interest. We investigate the question of when the maxima and minima of are assumed at the endpoints of the longest path in . Our results also apply to more general graphs that `behave globally' like a tree but can exhibit more complicated local structure. The crucial new ingredient is a reproducing formula for the eigenvector .
References in corpus (6)
- The Emerging Field of Signal Processing on Graphs: Extending High-Dimensional Data Analysis to Networks and Other Irregular Domains
- Stationary signal processing on graphs
- On the Diffusion Geometry of Graph Laplacians and Applications
- The Fiedler Rose: On the extreme points of the Fiedler vector
- How can we naturally order and organize graph Laplacian eigenvectors?
- Fiedler Vectors and Elongation of Graphs: A Threshold Phenomenon on a Particular Class of Trees