Sharp Bounds on Random Walk Eigenvalues via Spectral Embedding

DOI10.1093/imrn/rnx082zbMath1419.05132arXiv1211.0589OpenAlexW2962742362MaRDI QIDQ5233822

No author found.

Publication date: 9 September 2019

Published in: International Mathematics Research Notices (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1211.0589

zbMATH Keywords

random walksmatrix-tree theoremuniform spanning forests

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Random walks on graphs (05C81)

Related Items (15)

Three conjectures of Ostrander on digraph Laplacian eigenvectors ⋮ On Coalescence Time in Graphs: When Is Coalescing as Fast as Meeting? ⋮ Multiple random walks on graphs: mixing few to cover many ⋮ The social network model on infinite graphs ⋮ Sparse expanders have negative curvature ⋮ Sensitivity of Mixing Times in Eulerian Digraphs ⋮ A comparison principle for random walk on dynamical percolation ⋮ The exclusion process mixes (almost) faster than independent particles ⋮ Upper bounds for the spectral function on homogeneous spaces via volume growth ⋮ Rotor Walks on Transient Graphs and the Wired Spanning Forest ⋮ Conformal growth rates and spectral geometry on distributional limits of graphs ⋮ Estimating graph parameters with random walks ⋮ Occupation measure of random walks and wired spanning forests in balls of Cayley graphs ⋮ Explicit universal minimal constants for polynomial growth of groups ⋮ Sharp bounds on eigenvalues via spectral embedding based on signless Laplacians

This page was built for publication: Sharp Bounds on Random Walk Eigenvalues via Spectral Embedding