in this paper, the ambiguity of nite state irreducible markov chain trajectories is reminded and is obtained for two state markov chain. i give an applicable example of this concept in president election

A graphs G is clique irreducible if every clique in G of size at least two, has an edge which does not lie in any other clique of G and is clique reducible if it is not clique irreducible. A graph G is clique vertex irreducible if every clique in G has a vertex which does not lie in any other clique of G and clique vertex reducible if it is not clique vertex irreducible. The clique vertex irred...