Linear AlgebraMediumMarkov Chains & Long-Run Behavior
Markov Chains & Long-Run Behavior · Medium problem
A queue holds , , or customers. At each step it grows by one with probability (if it has fewer than ), shrinks by one with probability (if it has at least ), and otherwise stays the same. In the steady state, what is the probability that the queue is full (holds customers)? Express your answer as a common fraction.