Question on Discrete Parameter Markov Chains

Click For Summary
SUMMARY

The discussion centers on deriving a formula for the probability of returning to a specific state in a Discrete Parameter Markov Chain at time n. The formula relates the probability of returning at time n to the probability of returning at time n-k and the probability of first return at time k. The user initially sought assistance but later found the answer independently, indicating that the derivation involves considering multiple return paths, such as returning at time 1 or time 2 before reaching time n.

PREREQUISITES
  • Understanding of Discrete Parameter Markov Chains
  • Familiarity with probability theory and return probabilities
  • Knowledge of first return probabilities in stochastic processes
  • Ability to derive mathematical formulas related to Markov processes
NEXT STEPS
  • Study the derivation of return probabilities in Discrete Parameter Markov Chains
  • Explore the concept of first return probabilities in stochastic processes
  • Learn about transition matrices and their role in Markov Chains
  • Investigate applications of Markov Chains in real-world scenarios
USEFUL FOR

Students and researchers in mathematics, particularly those focusing on stochastic processes, as well as professionals working with Markov Chains in fields such as statistics, operations research, and computer science.

AD
Messages
70
Reaction score
0
I am required to find a formula expressing the probability of return to some state in a Markov chain at time n in terms of the probability of return to that state at time n - k and the probability of first return at time k. I cannot find this in my notes, and I have tried looking at several online resources. Can anyone help me?
 
Physics news on Phys.org
It is no longer necessary for you to answer this question as I have just discovered the answer elsewhere.
 
You could just derive it. How many ways can you return at time n?

One way is to have time n be the first time you return.
A second way is to return at time 1, and then have n be the next time you return.
Yet another way is to return at time 2, and then have n be the next time you return...
 

Similar threads

  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 12 ·
Replies
12
Views
2K
Replies
9
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
0
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 2 ·
Replies
2
Views
3K