Sharp bounds on eigenvalues via spectral embedding based on signless Laplacians |
| |
Institution: | Department of Mathematics, Indiana University, 831 E. 3rd St., Bloomington, IN 47405-7106, United States |
| |
Abstract: | 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]. |
| |
Keywords: | Return probability Spectral embedding Signless Laplacian Spectral gap |
本文献已被 ScienceDirect 等数据库收录! |
|