Hello there,(adsbygoogle = window.adsbygoogle || []).push({});

I'm stuck at a problem on markov chains... Could anyone help?

Here it is:

There are two machines that operate or don't during a day. Let $$X(n)$$ be the number of machines operating during the n-th day. Every machine is independently operating during the n-th day with probability $$\frac{1+X(n-1)}{4}$$. Show that the process $$\{ X(n):n=1,2,...\}$$ is markovian and find its transition matrix.

**Physics Forums - The Fusion of Science and Community**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# A problem on Markov Chains

Loading...

Similar Threads - problem Markov Chains | Date |
---|---|

B Problem in Counting - Number of Passwords | Feb 23, 2018 |

I A seemingly simple problem about probability | Jan 29, 2018 |

I Problem in hidden markov model | Feb 13, 2017 |

Gamblers Ruin - Markov Chain problem | Oct 19, 2011 |

Markov chain problem | May 9, 2007 |

**Physics Forums - The Fusion of Science and Community**