From Random Walks to Markov Chains

  • Kai Lai Chung
Part of the Undergraduate Texts in Mathematics book series (UTM)


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 R 1 = (−∞, ∞) 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.


Markov Chain Brownian Motion Random Walk Transition Matrix Markov Property 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1974

Authors and Affiliations

  • Kai Lai Chung
    • 1
  1. 1.Department of MathematicsStanford UniversityStanfordUSA

Personalised recommendations