Return probabilities on nonunimodular transitive graphs

preprint2022arXivOpen access

Abstract

Consider simple random walk (Xn)n≥0(X_n)_{n\geq0} on a transitive graph with spectral radius ρρ. Let un=P[Xn=X0]u_n=\mathbb{P}[X_n=X_0] be the nn-step return probability and fnf_n be the first return probability at time nn. It is a folklore conjecture that on transient, transitive graphs un/ρnu_n/ρ^n is at most of the order n−3/2n^{-3/2}. 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 fnf_n and unu_n are of the same order and the ratio fn/unf_n/u_n even tends to an explicit constant. We give some examples for which this conjecture holds. For a graph GG 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 cc such that fn≥uncncf_n\geq \frac{u_n}{cn^c}.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.