Excited Random Walks with Non-nearest Neighbor Steps
Burgess Davis () and
Jonathon Peterson ()
Additional contact information
Burgess Davis: Purdue University
Jonathon Peterson: Purdue University
Journal of Theoretical Probability, 2017, vol. 30, issue 4, 1255-1284
Abstract:
Abstract Let W be an integer-valued random variable satisfying $$E[W] =: \delta \ge 0$$ E [ W ] = : δ ≥ 0 and $$P(W 0$$ P ( W 0 , and consider a self-interacting random walk that behaves like a simple symmetric random walk with the exception that on the first visit to any integer $$x\in \mathbb Z$$ x ∈ Z , the size of the next step is an independent random variable with the same distribution as W. We show that this self-interacting random walk is recurrent if $$\delta \le 1$$ δ ≤ 1 and transient if $$\delta >1$$ δ > 1 . This is a special case of our main result which concerns the recurrence and transience of excited random walks (or cookie random walks) with non-nearest neighbor jumps.
Keywords: Excited random walk; Cookie random walk; Recurrence; Transience; Primary 60K35; Secondary 60K37; 60J15 (search for similar items in EconPapers)
Date: 2017
References: View complete reference list from CitEc
Citations:
Downloads: (external link)
http://link.springer.com/10.1007/s10959-016-0697-1 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:jotpro:v:30:y:2017:i:4:d:10.1007_s10959-016-0697-1
Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10959
DOI: 10.1007/s10959-016-0697-1
Access Statistics for this article
Journal of Theoretical Probability is currently edited by Andrea Monica
More articles in Journal of Theoretical Probability from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().