Abstract
Consider simple random walk on a transitive graph with spectral radius . Let be the -step return probability and be the first return probability at time . It is a folklore conjecture that on transient, transitive graphs is at most of the order . We prove this conjecture for graphs with a closed, transitive, amenable and nonunimodular subgroup of automorphisms. We also conjecture that for any transient, transitive graph and are of the same order and the ratio even tends to an explicit constant. We give some examples for which this conjecture holds. For a graph with a closed, transitive, nonunimodular subgroup of automorphisms, we prove a weaker asymptotic behavior regarding to this conjecture, i.e., there is a positive constant such that .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.