Recurrence and Pólya number of general one-dimensional random walks
From MaRDI portal
Publication:2913343
DOI10.1088/0253-6102/56/2/17zbMATH Open1247.82063arXiv1010.2014OpenAlexW3105774900MaRDI QIDQ2913343FDOQ2913343
Authors: Xiao-Kun Zhang, Jing Wan, Jing-Ju Lu, Xin-Ping Xu
Publication date: 26 September 2012
Published in: Communications in Theoretical Physics (Search for Journal in Brave)
Abstract: The recurrence properties of random walks can be characterized by P'{o}lya number, i.e., the probability that the walker has returned to the origin at least once. In this paper, we consider recurrence properties for a general 1D random walk on a line, in which at each time step the walker can move to the left or right with probabilities and , or remain at the same position with probability (). We calculate P'{o}lya number of this model and find a simple expression for as, , where is the absolute difference of and (). We prove this rigorous expression by the method of creative telescoping, and our result suggests that the walk is recurrent if and only if the left-moving probability equals to the right-moving probability .
Full work available at URL: https://arxiv.org/abs/1010.2014
Recommendations
Cited In (7)
- Reciprocal logarithmic time-dependence for a simple one-dimensional random walk
- Recurrence of Simple Random Walk in the Plane
- Random walk polynomials and random walk measures
- How likely is Polya's drunkard to stay in \(x\geq y\geq z\)?
- Creative Telescoping for Holonomic Functions
- The enumeration of restricted random walks by Sheffer polynomials with applications to statistics
- Title not available (Why is that?)
This page was built for publication: Recurrence and Pólya number of general one-dimensional random walks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2913343)