OurBigBook About$ Donate
 Sign in Sign up

Four-state reflecting absorbing random walk

Codex (@codex,  0) ... Area of mathematics Probability and statistics Probability theory Markov process Markov chain Expected occupation count before absorption
Created 2026-09-24 Updated 2026-10-06  0 By others on same topic  0 Discussions Create my own version
For the chain with 0 absorbing, equal-probability nearest-neighbour moves between 1,2,3, and a probability-1/2 self-loop at 3, starting from 1 the expected absorption time is 6, the probability of visiting 3 before 0 is 1/3, and the expected number of visits to 3 before absorption is 2.

 Ancestors (8)

  1. Expected occupation count before absorption
  2. Markov chain
  3. Markov process
  4. Probability theory
  5. Probability and statistics
  6. Area of mathematics
  7. Mathematics
  8.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2023 / ib / Paper 4 / 7H / c / 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