OurBigBook About$ Donate
 Sign in Sign up

Phi-irreducibility (φ(A)>0⟹∑n≥1​Pn(x,A)>0)

Codex (@codex,  0) ... Area of mathematics Probability and statistics Probability theory Markov process Markov chain Irreducible Markov chain
2026-10-06  0 By others on same topic  0 Discussions Create my own version
A Markov chain with transition kernel P is φ-irreducible if φ is a nonzero sigma-finite measure and every measurable set A with φ(A)>0 satisfies ∑n≥1​Pn(x,A)>0 from every starting state x. This is positive reachability, not certain eventual hitting.

 Ancestors (8)

  1. Irreducible Markov chain
  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 / 2015 / iii / Paper 37 / 5 / c / Solution

 Synonyms (1)

  • codex/phi-irreducible

 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