Extreme values of the Fiedler vector on trees
DOI10.1016/J.LAA.2024.09.014MaRDI QIDQ6635268
Stefan Steinerberger, R. R. Lederman
Publication date: 9 November 2024
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
potential theoryhitting timestreesrandom walklongest pathFiedler vectorspectral graph theoryhot spots conjecture
Trees (05C05) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph minors (05C83) Distance in graphs (05C12) Potential theory on fractals and metric spaces (31E05) Comparison principles in context of PDEs (35B51)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Wavelets on graphs via spectral graph theory
- Laplace eigenvalues of graphs---a survey
- On the Fiedler vectors of graphs that arise from trees by Schur complementation of the Laplacian
- The hot spots problem in planar domains with on hole
- Eigenvalues, diameter, and mean distance in graphs
- A counterexample to the ``hot spots conjecture
- Laplacian matrices of graphs: A survey
- Partial differential equations. 2: Qualitative studies of linear equations
- A spectral approach to the shortest path problem
- On the diffusion geometry of graph Laplacians and applications
- Schur reduction of trees and extremal entries of the Fiedler vector
- The number of caterpillars
- The perturbed laplacian matrix of a graph
- A Fiedler-like theory for the perturbed Laplacian
- The nodal count {0,1,2,3,…} implies the graph is a tree
- Hierarchical graph Laplacian eigen transforms
- Characteristic vertices of weighted trees via perron values
- Hot spots in convex domains are in the tips (up to an inradius)
- Perron components and algebraic connectivity for weighted graphs
- Algebraic connectivity of weighted trees under perturbation
- Extremizing algebraic connectivity subject to graph theoretic constraints
- A Multiscale Pyramid Transform for Graph Signals
- Stationary Signal Processing on Graphs
- Foundations of Data Science
- Characteristic vertices of trees*
- Discrete nodal domain theorems
This page was built for publication: Extreme values of the Fiedler vector on trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635268)
