English

Return probabilities on nonunimodular transitive graphs

Probability 2022-06-29 v2

Abstract

Consider simple random walk (Xn)n0(X_n)_{n\geq0} on a transitive graph with spectral radius ρ\rho. 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/\rho^n is at most of the order n3/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 fnuncncf_n\geq \frac{u_n}{cn^c}.

Keywords

Cite

@article{arxiv.2106.03174,
  title  = {Return probabilities on nonunimodular transitive graphs},
  author = {Pengfei Tang},
  journal= {arXiv preprint arXiv:2106.03174},
  year   = {2022}
}

Comments

Comments are welcome. Major revision

R2 v1 2026-06-24T02:53:08.925Z