Discrete-Time Markov Chains
[7/100%]Prove that in the definition of a Markov chain it suffices to check the condition only for consecutive time points. Namely, prove that a sufficient condition for the Markov property of a process with values in an at most countable set is the equality
(the equality must hold whenever the conditioning probabilities are positive).
Let be independent identically distributed random variables with values in , with probability function , positive for all . State whether the following random sequences (random processes) are necessarily Markov chains:
;
, where ;
;
.
If the process is not necessarily a Markov chain, give a counterexample proving this. If it is, state the one-step transition probabilities.
Let be a Markov chain with phase space , initial state a.s. and transition probability matrix
Set . Prove that is also a Markov chain, and find its transition matrix.
The Markov chain has initial state and transition probabilities
.
Find the distribution of ;
Prove that the sequence is also a Markov chain and find its transition probabilities.
The Markov chain has initial state and transition probabilities
where . Find .
Give an example of a homogeneous discrete-time Markov chain that has several stationary distributions but no limiting one;
Give an example of a homogeneous discrete-time Markov chain that has no stationary distribution, but does have limits of the transition probabilities as ;
Prove that if a homogeneous discrete-time Markov chain has several stationary distributions, then in fact it has infinitely many.
Let be independent identically distributed random variables with values in and the following distribution:
Consider the processes
. Prove that and are homogeneous Markov chains, and find their limiting distributions.