Hello. I am interested in a discussion some of the members had in http://mathoverflow.net/questions/59244/what-is-the-cover-time-of-a-random-walk-on-a-cube. I have managed to write a code for mister Roberts formula, but it works only for Marcov Chains with small number of states (I get the correct result for this example). I have a problem already if we have just about 25 states (my code is to slow). How can we write a faster algorithm? Cay you share yours?
Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)
|
0
|
|
|
|
