Return Probabilities of Random Walks
Max Zhou

TL;DR
This paper investigates whether the set of return probabilities uniquely identifies a random walk on integers, establishing conditions under which this is true and exploring implications in representation theory.
Contribution
It proves that, except for trivial cases, return probabilities uniquely determine the random walk on , and connects this to 's representation theory.
Findings
Return probabilities generally determine the random walk uniquely.
Trivial cases where different walks share the same return probabilities are characterized.
Application to representation theory of .
Abstract
Associated to a random walk on and a positive integer , there is a return probability of the random walk returning to the origin after steps. An interesting question is when the set of return probabilities uniquely determines the random walk. There are trivial situations where two different random walks have the same return probabilities. However, among random walks in which these situations do not occur, our main result states that the return probabilities do determine the random walk. As a corollary, we will obtain a result dealing with the representation theory of .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Algorithms and Data Compression · semigroups and automata theory
