a)
transition matrix is constructed on the basis of the probabilities for state i to j, placed at i^th row and j^th column of the matrix......
as jump process at the time of jump is itself a markov chain, we calculate the probability as jump to state j, given than it jumped i.e. like \(\frac {\lambda}{\lambda + \mu} \)...........
\(\frac{\mu_{ij}}{\lambda_i}\) is also correct as you know \( \lambda_i = \lambda + \mu \)...........( \( \lambda_i \) is force out of state i ).
b)
they ask,probability of currently there are no passenger has arrived and then all desk will be full before anyone can complete. i.e. go to state N from 0 without rollback.....
Edit: I just see, they mixed lambda and mu mistakenly.
Last edited: Aug 31, 2015