Random walk on discrete point processes
classification
🧮 math.PR
keywords
randomcoordinatenearestpointswalksprovealmostcentral
read the original abstract
We consider a model for random walks on random environments (RWRE) with random subset of the d-dimensional Euclidean lattice as the vertices, and uniform transition probabilities on 2d points (two "coordinate nearest points" in each of the d coordinate directions). We prove that the velocity of such random walks is almost surely 0, and give partial characterization of transience and recurrence for the different dimensions. Finally we prove Central Limit Theorem for such random walks, under a condition on the distance between nearest coordinate nearest points.
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.