We consider the nearest neighbour random walk on infinite graphs. We discuss the connection between the two smallest eigenvalues of the Laplacian of the graph and the diffusion speed of the random walk.
Recommendations
Cites work
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- Eigenvalues and expanders
- scientific article; zbMATH DE number 3163289 (Why is no real title available?)
- scientific article; zbMATH DE number 3934150 (Why is no real title available?)
- scientific article; zbMATH DE number 3240812 (Why is no real title available?)
- scientific article; zbMATH DE number 3337135 (Why is no real title available?)
- scientific article; zbMATH DE number 3417498 (Why is no real title available?)
- Random walks on graphs, electric networks and fractals
Cited in
(13)- Random walk and chaos of the spectrum. Solvable model
- Resistance dimension, random walk dimension and fractal dimension
- Spectra of graphs and fractal dimensions. II
- A note on recurrent random walks on graphs.
- Random walks and dimensions of random trees
- Heat kernels on infinite graph networks and deformed Sierpinski gaskets
- Gauge and conditional gauge on negatively curved graphs
- scientific article; zbMATH DE number 139914 (Why is no real title available?)
- Growth of Self‐Similar Graphs
- Uniform asymptotic estimates of transition probabilities on combs
- Volume and time doubling of graphs and random walks: The strongly recurrent case
- Positive expansiveness versus network dimension in symbolic dynamical systems
- Relations between scaling exponents in unimodular random graphs
This page was built for publication: Spectra of graphs and fractal dimensions. I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1123218)