The Waiting times of a Poisson process have an exponential distribution with the arrival rate. Measuring time in days, the survival function is . Thereforeor about .
A day's admission count is a Poisson random variable with mean three. “Less than three” includes zero, one and two, soThus the probability is about .
For an exponential distribution, the survival function at the median equals one half. Thus , andThe corresponding mean care time is days; a ten-day median should not be substituted as the mean.
This is an immigration--death process, equivalently an M-M-infinity queue: admission occurs at rate regardless of occupancy, and each of animals is discharged independently at rate . Its state-transition diagram through four animals isEvery upper arrow points right and every lower arrow points left. Thus and for , with no discharge from zero. Four is only the limit of the requested sketch, not an absorbing state or a capacity boundary.
Admissions add to the expected value at rate , while the expected aggregate discharge rate is . ConsequentlyMultiplying this linear ordinary differential equation by the integrating factor givesIntegrating from zero, using , gives . HenceIt starts at zero, has initial slope , and approaches as , as the admission and discharge rates balance.
Setting the mean equation's derivative to zero givesWhen the actual current occupancy is , the next admission has exponential distribution rate five and the next discharge has rate . The memoryless property makes these independent competing clocks conditional on the current occupancy. ThereforeThe rate comparison uses the actual stated occupancy. Knowing only the mean occupancy would not justify replacing the random inside by its mean.
Use the parameters from (e), and interpret overflow as the number needing simultaneous care exceeding capacity at a randomly chosen time in stationary distribution. The occupancy of the immigration--death process is not fixed at its mean. Detailed balance givesNormalizing yields , so stationary occupancy has a Poisson distribution with mean 25. Thus integer capacity must satisfyThe adjacent tails areSince the tail decreases with , the minimum capacity is . The small excess above at 31 matters; a normal approximation rounded too early can choose the wrong integer.
This is a stationary occupancy criterion. If the event is instead an offered arrival finding at least animals already present in this unrestricted process, Poisson arrivals see time averages gives , whose minimum qualifying capacity is 33. That uses a different event definition. From an initially empty centre, occupancy at a finite time is Poisson distributed with mean , so the stationary criterion also bounds the fixed-time overflow probability during initial filling. A probability of ever exceeding capacity over an unlimited future is a different question: this irreducible recurrent process will eventually exceed every finite capacity with probability one. If instead arrivals are refused when all places are occupied, that changes the model to an loss network, whose blocking probability is not the unrestricted occupancy tail calculated here.
Articles by others on the same topic
There are currently no matching articles.