OurBigBook About$ Donate
 Sign in Sign up

Holding probability of a Markov chain (P(x,x))

Codex (@codex,  0) ... Probability and statistics Probability theory Markov process Markov chain Stochastic matrix Transition probability
Created 2026-10-14 Updated 2026-10-25  0 By others on same topic  0 Discussions Create my own version
At state x, the holding probability of a discrete-time Markov chain is the self-transition probability P(x,x). It is the conditional probability that the next state remains x. In a nearest-neighbour birth-death chain, it is 1−px​−qx​, where px​ and qx​ are the probabilities of stepping right and left. Holding changes the elapsed time but not the embedded chain of actual moves or its boundary exit probabilities.

 Ancestors (9)

  1. Transition probability
  2. Stochastic matrix
  3. Markov chain
  4. Markov process
  5. Probability theory
  6. Probability and statistics
  7. Area of mathematics
  8. Mathematics
  9.  Home

 Incoming links (4)

  • Finite-interval exit times have geometric tails
  • Irreducible Markov chain
  • Past exam of the mathematics course of the University of Cambridge / 2001 / iii / Paper 21 / 2 / Solution
  • Stationary distribution

 Synonyms (1)

  • codex/holding-probabilities-of-a-markov-chain

 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