• Corpus ID: 209405299

Extreme Values of the Fiedler Vector on Trees

  title={Extreme Values of the Fiedler Vector on Trees},
  author={Roy R. Lederman and Stefan Steinerberger},
Let $G$ be a connected tree on $n$ vertices and let $L = D-A$ denote the Laplacian matrix on $G$. The second-smallest eigenvalue $\lambda_{2}(G) > 0$, also known as the algebraic connectivity, as well as the associated eigenvector $\phi_2$ have been of substantial interest. We investigate the question of when the maxima and minima of $\phi_2$ are assumed at the endpoints of the longest path in $G$. Our results also apply to more general graphs that `behave globally' like a tree but can exhibit… 
A Spectral Approach to the Shortest Path Problem
Spectral Clustering Revisited: Information Hidden in the Fiedler Vector
It is argued that the vertices for which the eigenvector has the largest and the smallest entries, respectively, are unusually strongly connected to their own cluster and more reliably classified than the rest and should be useful in applications.
Hot spots in convex domains are in the tips (up to an inradius)
Abstract Let be a bounded, convex domain and let be the first nontrivial Laplacian eigenfunction with Neumann boundary conditions. The hot spots conjecture claims that the maximum and minimum are
The hot spots conjecture can be false: Some numerical examples
  • A. Kleefeld
  • Mathematics
    Advances in Computational Mathematics
  • 2021
It is shown numerically that the hot spots conjecture can fail to be true for easy to construct bounded domains with one hole and the ratio between the maximal/minimal value inside the domain and its maximal/Minimal value on the boundary can be larger than 1 + 10− 3.
On the hot spots of quantum graphs
We undertake a systematic investigation of the maxima and minima of the eigenfunctions associated with the first nontrivial eigenvalue of the Laplacian on a metric graph equipped with standard


On the diffusion geometry of graph Laplacians and applications
A Spectral Approach to the Shortest Path Problem
Fiedler Vectors and Elongation of Graphs: A Threshold Phenomenon on a Particular Class of Trees
This work presents (FED) property for a graph G, i.e. the fact that diameter of a graph can be obtain by Fiedler vectors, and studies in detail a parametric family of trees that gives indeed a counter example for the previous conjecture but reveals a threshold phenomenon for (F ED) property.
On the Fiedler vectors of graphs that arise from trees by Schur complementation of the Laplacian.
A Fiedler-like theory for the perturbed Laplacian
The perturbed Laplacian matrix of a graph G is defined as DL = D−A, where D is any diagonal matrix and A is a weighted adjacency matrix of G. We develop a Fiedler-like theory for this matrix, leading
Characteristic vertices of weighted trees via perron values
We consider a weighted tree T with algebraic connectivity μ, and characteristic vertex v. We show that μ and its associated eigenvectors can be described in terms of the Perron value and vector of a
Schur reduction of trees and extremal entries of the Fiedler vector
Algebraic connectivity of weighted trees under perturbation
This work investigates how the algebraic connectivity of a weighted tree behaves when the tree is perturbed by removing one of its branches and replacing it with another, and produces a lower bound on the algebraIC connectivity of any unweighted graph in terms of the diameter and the number of vertices.
Perron components and algebraic connectivity for weighted graphs
The algebraic connectivity of a connected graph is the second-smallest eigenvalue of its Laplacian matrix, and a remarkable result of Fiedler gives information on the structure of the eigenvectors