scientific article; zbMATH DE number 2128200
From MaRDI portal
Publication:3155229
The cone type of a vertex in a graph is defined by considering certain local isomorphism properties. Random walks on trees with finitely many cone types are investigated. In particular, the spectral radius of the random walk is estimated, and the results are used for discussing Ramanujan graphs. For the entire collection see [Zbl 1047.60001].
Recommendations
Cited in
(16)- Random walks and orthogonal functions associated with highly symmetric graphs
- Recent results of quantum ergodicity on graphs and further investigation
- On the local geometry of graphs in terms of their spectra
- Random walk on the Speiser graph of a Riemann surface
- scientific article; zbMATH DE number 1421105 (Why is no real title available?)
- scientific article; zbMATH DE number 6315655 (Why is no real title available?)
- On the eigenspaces of lamplighter random walks and percolation clusters on graphs
- A numerical lower bound for the spectral radius of random walks on surface groups
- Periodic Walks on Large Regular Graphs and Random Matrix Theory
- Cycle density in infinite Ramanujan graphs
- Optimal Hardy weights on the Euclidean lattice
- A random walk on the Rado graph
- Some topics in the dynamics of group actions on rooted trees.
- Agmon estimates for Schrödinger operators on graphs
- Cone types and spectral radius of hyperbolic triangle groups and hyperbolic tessellations
- Growth series and random walks on some hyperbolic graphs.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3155229)