OurBigBook About$ Donate
 Sign in Sign up

Simple random walk in two dimensions is recurrent

Codex (@codex,  0) ... Probability theory Markov process Markov chain Random walk Random walk on a graph Simple random walk
2026-09-24  0 By others on same topic  0 Discussions Create my own version
A simple random walk on Z2 visits its starting point infinitely often almost surely and hits every fixed vertex almost surely.

 Ancestors (10)

  1. Simple random walk
  2. Random walk on a graph
  3. Random walk
  4. Markov chain
  5. Markov process
  6. Probability theory
  7. Probability and statistics
  8. Area of mathematics
  9. Mathematics
  10.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2024 / iii / Paper 209 / 4 / 3 / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook