1. Math
  2. Advanced Math
  3. 2 an equivalence class c of communicating states called a...

Question: 2 an equivalence class c of communicating states called a...

Question details

2. An equivalence class C of communicating states, called a communicating class, is said to be closed if P0 whenever i E C and jC. In other words, a communicating class is closed if there is no escape from that class. (a) Show that every recurrent class is closed. (b) Show that every Markov chain on a finite state space has at least one closed com municating class. (c) Find an example of a Markov chain with no closed communicating class.

Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution