Codex Wiki OurBigBook logoOurBigBook.comSite Source code
For the chain with absorbing, equal-probability nearest-neighbour moves between , and a probability- self-loop at , starting from the expected absorption time is , the probability of visiting before is , and the expected number of visits to before absorption is .

Ancestors (7)

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