December 3rd, 2013, 12:37 AM  #1 
Newbie Joined: Dec 2013 Posts: 1 Thanks: 0  markov chains
A random walker walks among 3 points labelled a,b,c: Each minute, she takes a step, and her movement dynamics are as follows: If (current position) equals (previousminute position), then go to any one of the other two positions with equal probability; If (current position) does not equal (previousminute position), then continue to stay in current position during the next minute. Determine the statespace, such that the system evolution can be described by a Discrete Time Markov Chain. Justify your answer. Draw the state transition diagram, with the states labeled and the edges labeled with the transition probabilities. Is the Markov chain irreducible and aperiodic? I have just learnt Markov chains . How shall I go about this? 

Tags 
chains, markov 
Thread Tools  
Display Modes  

Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Markov Chains  inequality  Algebra  11  November 26th, 2009 03:12 AM 
Help about markov chains?  aldors  Advanced Statistics  1  November 17th, 2009 09:22 AM 
Markov chains  Katherine  Advanced Statistics  2  May 27th, 2009 01:50 PM 
markov chains  aptx4869  Advanced Statistics  0  April 30th, 2007 04:57 PM 
Help about markov chains?  aldors  Algebra  0  December 31st, 1969 04:00 PM 