Abstract
The simplest random walk may be described as follows. A particle moves along a line by steps; each step takes it one unit to the right or to the left with probabilities p and q = 1 − p, respectively, where 0 < p < 1. For verbal convenience we suppose that each step is taken in a unit of time so that the nth step is made instantaneously at time n; furthermore we suppose that the possible positions of the particle are the set of all integers on the coordinate axis. This set is often referred to as the “integer lattice” on Rl = (−∞, ∞) and will be denoted by I. Thus the particle executes a walk on the lattice, back and forth, and continues ad infinitum. If we plot its position X n as a function of the time n, its path is a zigzag line of which some samples are shown below in Figure 30.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer Science+Business Media New York
About this chapter
Cite this chapter
Chung, K.L., AitSahlia, F. (2003). From Random Walks to Markov Chains. In: Elementary Probability Theory. Undergraduate Texts in Mathematics. Springer, New York, NY. https://doi.org/10.1007/978-0-387-21548-8_8
Download citation
DOI: https://doi.org/10.1007/978-0-387-21548-8_8
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-3062-0
Online ISBN: 978-0-387-21548-8
eBook Packages: Springer Book Archive