On the range of random walk on graphs satisfying a uniform condition
Abstract
We consider the range of random walks up to time n, Rn, on graphs satisfying a uniform condition. This condition is characterized by potential theory. Not only all vertex transitive graphs but also many non-regular graphs satisfy the condition. We show certain weak laws of Rn from above and below. We also show that there is a graph such that it satisfies the condition and a sequence of the mean of Rn/n fluctuates. By noting the construction of the graph, we see that under the condition, the weak laws are best in a sense.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.