Sharp bounds on eigenvalues via spectral embedding based on signless Laplacians
Sharp bounds on eigenvalues via spectral embedding based on signless Laplacians
复制标题
通过基于无符号拉普拉斯算子的谱嵌入对特征值进行锐界
DOI:
10.1016/j.jfa.2022.109799
复制
发表时间:
2023
影响因子:
1.7
通讯作者:
Wei, Zhi-Feng
中科院分区:
文献类型:
--
作者:
Wei, Zhi-Feng
Using spectral embedding based on the probabilistic signless Laplacian, we obtain bounds on the spectrum of transition matrices on graphs. As a consequence, we bound return probabilities and the uniform mixing time of simple random walk on graphs. In addition, spectral embedding is used in this article to bound the spectrum of graph adjacency matrices. Our method is adapted from Lyons and Oveis Gharan [13].