This chapter introduces the idea of random walk and studies a number of simple cases to illustrate the concepts, mostly in one dimension. The symmetric Pearson walk, the biased walk, and the persistent walk are treated for lattice walks in discrete time, and the results generalized to continuum walks. Asymptotic results for large number of steps or long times are emphasized. The problems of random walk with boundaries and first passage times are introduced. Remarks on further generalizations and problems are briefly made.
Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.
If you think you should have access to this title, please contact your librarian.