Assuming a Markov Chain of $M$ states, and assuming starting from state $X_0$, I was wondering if there is a method to calculate the probability of visiting state $X_k$ at least once during first n steps.
Any help would be greatly appreciated!
I don’t think there is a closed form expression for this, but I hope I am wrong. So far I was trying to estimate it using simulations.
New contributor
user25510587 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.