Markovchain | PHP Library that made TEXT

I am currently doing a markov chain simulation with the markovchain package, and an inner- and an outer-loop. In total 175,2 million values should be inserted into a dataframe, the reproducible example code is below. This has been running for 40+ hours now, and I was wondering how I could speed this up? And I am curious whether someone could give me an indication on how long it might take to finish the calculation.

I've already improved the code by using the profvis package.

I have a transition matrix "T" and would like to produce 20 different sequences of 25 states each.

I have the markovchain package and have tried the following:

I have a problem with making a Markov model using the library 'markovchain'. To make a markovchain plot you need to have a transistion matrix. As you see the rows sums up to 1.

I would like to define a matrix of transition probabilities from edges with probabilities using define_transition from heemod. I am building a decision-tree where each edge represents a conditional probability of a decision. The end nodes in this tree are the edges that end with the .ts or .nts suffix.

In addition, this post provides information on using markovchain's createSequenceMatrix to address a slightly similar problem, but I couldn't figure out how to use this function to address my the edge to matrix issue. I am not sure if igraph could help in this scenario, but I used it to show what I think define transition should have to run.

Any help you can provide will be greatly appreciated!

I unsuccessfully attempted to build the transition matrix element by element.

Here is what the data looks like, what I've attempted, and what I want define_transition to output:

Other questions
There is another question asking how to build a second order transition matrix, however the answer does not seem to produce a second order transition matrix.

Second order transition matrix & scoring a sequence
Let's use this dataset:

Let's use the dataset from this question:

I had a sequence of states organized as a data frame that looks like this:

I am working on a Markov Chain simulation for a Cloud Computing server which has 4 Servers and each server has 4 VMs.

Server in my case is the array

{4,1,0}

And busy VMs are the first variable of this array, so it is 4. Now when we have an arrival we check if all servers have 4 VMs busy, if so, we drop the packets so loss variable in my case will be increased, otherwise I will check if the first server has 4 VMs busy, if so the arrival will come to the second server if its VMs are not all busy. Now in the second iteration, I can have a departure and if this is the case the departure may happen to each of the servers which have at least one VMs. I check it using a probability formula but I do not want to enter in detail for that here.

Now I have a problem to solve for the system described above, as below:

At the beginning of simulation, I have a 2D-array

[{4,1,0},{3,1,0},{0,1,0},{0,1,0}]

// First Iteration

Now I want to check that if for all arrays the first element is 4, then I will increase a variable named to my code as

loss

Otherwise I will check if the first element of the array is 4, if it is 4 then I will go on and check the second element of the array, if the second element of the array as in my case above is not 4 then I will increase it by 1 and I want to get the result

[{4,1,0},{4,1,0},{0,1,0},{0,1,0}]

Now in the next 4 iterations "If I always will have arrival packets and no departure" I would like to get the output as below

[{4,1,0},{4,1,0},{1,1,0},{0,1,0}] [{4,1,0},{4,1,0},{2,1,0},{0,1,0}] [{4,1,0},{4,1,0},{3,1,0},{0,1,0}] [{4,1,0},{4,1,0},{4,1,0},{0,1,0}]

But meanwhile, I still have to check the first variable of the first array and second array since these values due to some other part of my code could be decreased if departure happens.

//Second Iteration (departure)

So let's say I have in second Iteration a departure, the status of my 2D-array after the first Iteration is

[{4,1,0},{4,1,0},{0,1,0},{0,1,0}]

Now a departure happens, and let say it happens to the second server and my status will be again as the beginning

[{4,1,0},{3,1,0},{0,1,0},{0,1,0}]

// Third iteration (Arrival)

Now I have to check the first element of the first array, since it is 4, I can not increment this element and so I have to check the first element of the second array, since it is not 4, I have to increment it by 1.

Now In my java code below, I am running into a java.lang.ArrayIndexOutOfBoundsException (which I know what it is), when I check if the first of each element of the arrays is 4, and if it is 4, I have to check it for the second array and so on

Now the second problem is that I have more departure than arrivals when I run my implementation for 100 000 replications (iterations)

I really need some help with that.

I'm trying to simulate a homogeneous finite state Markov chain in R. I want to get an output of some specific length given initial probability and transition probability matrix. This is what I have so far