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].
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have