Recurrence and Pólya number of general one-dimensional random walks
From MaRDI portal
Publication:2913343
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 .
Recommendations
Cited in
(10)- Recurrence of inhomogeneous random walks
- Reciprocal logarithmic time-dependence for a simple one-dimensional random walk
- How likely is Polya's drunkard to stay in \(x\geq y\geq z\)?
- scientific article; zbMATH DE number 2203975 (Why is no real title available?)
- Creative telescoping for holonomic functions
- The enumeration of restricted random walks by Sheffer polynomials with applications to statistics
- Recurrence of Simple Random Walk in the Plane
- Recurrence of random walks with long-range steps generated by fractional Laplacian matrices on regular networks and simple cubic lattices
- Random walk polynomials and random walk measures
- On Pólya's random walk constants
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)