How to Generate a 100 State Sequence Using a Markov Chain Model?

Click For Summary

Discussion Overview

The discussion revolves around generating a sequence of states using a Markov Chain model, specifically focusing on how to create a 100-state sequence based on a given state transition probability matrix and state probability vector. The conversation includes aspects of simulation and theoretical derivation related to Markov chains.

Discussion Character

  • Exploratory
  • Technical explanation
  • Homework-related
  • Mathematical reasoning

Main Points Raised

  • One participant presents a state transition probability matrix and a state probability vector, seeking assistance in generating a sequence of states.
  • Another participant inquires if the original poster wants the probability of the states at the 100th step, suggesting a mathematical approach to find this.
  • The original poster clarifies the goal is to generate a sequence of states (1s and 0s) rather than calculate probabilities.
  • A different participant suggests that any sequence of 0s and 1s is possible with the given transition matrix and proposes a Monte-Carlo simulation method to generate the sequence.
  • One participant outlines a detailed process for deriving parameters for a first-order Markov chain and implementing a state sequence generator, indicating a more complex analysis involving state duration statistics.
  • Another participant confirms that the proposed method aligns with the Monte-Carlo simulation approach previously mentioned.

Areas of Agreement / Disagreement

Participants express different aspects of the problem, with some focusing on theoretical derivation and others on practical simulation. There is no consensus on a single method or approach, as multiple viewpoints and methods are presented.

Contextual Notes

The discussion includes various assumptions about the Markov chain model and the generation process, but these assumptions are not fully explored or defined. The scope of the simulation and theoretical aspects remains broad and open to interpretation.

Who May Find This Useful

This discussion may be useful for individuals interested in Markov chains, simulation techniques, and statistical analysis in the context of state generation and transition modeling.

lemontree45
Messages
4
Reaction score
0
I have a state transition probability matrix and a state probability vector

[0.9 0.1; 0.1 0.9] & [0.4 0.6] respectively.

Now, I want to generate the states of 1 and 0 according to this. say 100 state sequence.

Any sort of help would be appreciated.

Thanks.
 
Physics news on Phys.org
Hi lemontree45! :smile:

What exactly do you want?? Do you want to know the probability of the states in the 100th step? That would be

[tex]\left(\begin{array}{cc}0.9 & 0.1\\ 0.1 & 0.9\end{array} \right)^{100}\left(\begin{array}{cc}0.4\\ 0.6\end{array} \right)[/tex]
 
Hi,
Thanks for the response.

Actually, I want to generate a sequence of states either 1 or 0. like 1011111000010000...(100 states) using this state transition probability matrix.

Any idea?
 
You're going to have to give some more information about why you need this kind of thing.
Any sequence of 0's and 1's is possible from these transistion matrix, even 1111111...
or 0000000...

Or do you want to make a (Monte-Carlo) simulation of this Markov chain?? To do this:
  • Take a number at random from 1-10, if you chose 1-4 you start in state 0 otherwise you start in state 1.
  • Take a number at random from 1-10. If you chose 1 then you change your state, if you chose otherwise then you keep your state.
  • Do the previous a 100 times.


More information from you would be very helpful! :smile:
 
This is what I wanted to find out.

given a state sequence with states '1' and '2'. and the #2 is what I am trying to solve.

1. Derive from this sequence the parameters for a first order markov chain: the state transition probability matrix and the state probability vector. The state frame length should be 1m.

2. Implement a state sequence generator based on the first order markov chain, using the parameters from 1. (it is a realization of a 1st order markov chain using the state transition probability matrix)

3. Use the generator and realize a markov chain with 1000000 states.

4. Generate the state duration statistic of the measured state sequence and the resimulated state sequence for the "good" and "bad" state. (x-axis: state duration in meter; y-axis: probability of the state duration)

5. Generate the theoretical state duration probability function of the 1st-order Markov chain for comparison.
 
That's exactly the Monte-Carlo simulation I described above. Use a computer program to simulate it.
 
Thanks :)
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 4 ·
Replies
4
Views
5K
  • · Replies 2 ·
Replies
2
Views
2K
Replies
24
Views
4K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 14 ·
Replies
14
Views
2K