My Math Forum Markov chain

 February 12th, 2012, 04:31 AM #1 Member   Joined: Sep 2010 Posts: 60 Thanks: 0 Markov chain A boy and a girl move to the same two-bar-town on the same day. Each night, boy visits one bar, starting the first night with bar 1 and continues by selecting a bar for the next night according to a Markov chain with transition matrix P below. Similarly, girl visits one bar a night,starting with bar 2 and selecting the next bar according to Q below: $P= \left[ \begin{array}{cc} 0.7 & 0.3 \\ 0.3 & 0.7 \end{array} \right] \; Q= \left[ \begin{array}{cc} 0.4 & 0.6 \\ 0.6 & 0.4 \end{array} \right]$ Hint: The progress of boy and girl finding each other can be modelled as a single Markov chain where only one (!) state is absorbing. a) Find the probability that boy visits bar 1 and girl visits bar 2 on the nth night. b) Let N denote the number of the night when girl meets boy. Compute the expected number of nights E[N] it takes for boy and girl to meet. Hint: Either compute the distributionof N, or develop an invariance equation for E[N]. c) Find the probability that they meet in bar 1. d) Find the distribution of the time of their meeting (distribution of N). Thank you very much for your help in advance!
 February 12th, 2012, 03:20 PM #2 Senior Member   Joined: Oct 2011 From: Belgium Posts: 522 Thanks: 0 Re: Markov chain Do first a eigensystemdecomposition for P and Q, then it is easier to calculate P^n and Q^n.

 Tags chain, markov

 Thread Tools Display Modes Linear Mode

 Similar Threads Thread Thread Starter Forum Replies Last Post dr_romix Advanced Statistics 2 October 16th, 2012 06:36 PM legendoulis Advanced Statistics 4 April 4th, 2012 11:28 AM 450081592 Advanced Statistics 1 March 6th, 2012 04:17 PM CraigSager Advanced Statistics 5 March 23rd, 2011 10:10 AM Turloughmack Linear Algebra 0 February 7th, 2011 05:15 AM

 Contact - Home - Forums - Cryptocurrency Forum - Top