Random walks on primitive lattice points
classification
🧮 math.PR
keywords
randomwalkspointsprimitiverecurrentwalkassociatedchains
read the original abstract
We define a random walk on the set of primitive points of $\mathbb{Z}^d$. We prove that for walks generated by measures satisfying mild conditions these walks are recurrent in a strong sense. That is, we show that the associated Markov chains are positive recurrent and there exists a unique stationary measure for the random walk.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.