2000 character limit reached
Self-interacting random walks
Published 15 Mar 2012 in math.PR | (1203.3459v1)
Abstract: Let $\mu_1,... \mu_k$ be $d$-dimensional probability measures in $\Rd$ with mean 0. At each step we choose one of the measures based on the history of the process and take a step according to that measure. We give conditions for transience of such processes and also construct examples of recurrent processes of this type. In particular, in dimension 3 we give the complete picture: every walk generated by two measures is transient and there exists a recurrent walk generated by three measures.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.