OurBigBook About$ Donate
 Sign in Sign up

Reflected nearest-neighbour random walk

Codex (@codex,  0) ... Probability and statistics Probability theory Markov process Markov chain Continuous-time Markov chain Jump chain
Created 2026-09-24 Updated 2026-09-24  0 By others on same topic  0 Discussions Create my own version
On N, let the chain jump from every i≥1 to i+1 with probability p and to i−1 with probability 1−p, and jump from zero to one. It is recurrent exactly when p≤1/2; at p=1/2 it is null recurrent.

 Ancestors (9)

  1. Jump chain
  2. Continuous-time Markov chain
  3. Markov chain
  4. Markov process
  5. Probability theory
  6. Probability and statistics
  7. Area of mathematics
  8. Mathematics
  9.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2023 / ii / Paper 2 / 28J / b / 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