15.1 Some random selection problems (Page 2/6)

Applied probability Page 2 / 6

Message routing

A junction point in a network has two incoming lines and two outgoing lines. The number of incoming messages N ₁ on line one in one hour is Poisson (50); on line 2 the number is $N_{2} \sim$ Poisson (45). On incoming line 1 the messages have probability $p_{1 a} = 0.33$ of leaving on outgoing line a and $1 - p_{1 a}$ of leaving on line b. The messages coming in on line 2 have probability $p_{2 a} = 0.47$ of leaving on line a. Under the usual independence assumptions, what is the distribution of outgoing messages on line a?What are the probabilities of at least 30, 35, 40 outgoing messages on line a?

SOLUTION

By the Poisson decomposition, $N_{a} \sim$ Poisson $(50 \cdot 0.33 + 45 \cdot 0.47 = 37.65)$ .

ma = 50*0.33 + 45*0.47
ma =  37.6500Pa = cpoisson(ma,30:5:40)
Pa =   0.9119    0.6890    0.3722

Got questions? Get instant answers now!

VERIFICATION of the Poisson decomposition

$N_{k} = \sum_{i = 1}^{N} I_{E_{k i}}$ .
This is composite demand with $Y_{k} = I_{E_{k i}}$ , so that $g_{Y_{k}} (s) = q_{k} + s p_{k} = 1 + p_{k} (s - 1)$ . Therefore,
$g_{N_{k}} (s) = g_{N} [g_{Y_{k}} (s)] = e^{μ (1 + p_{k} (s - 1) - 1)} = e^{μ p_{k} (s - 1)}$
which is the generating function for $N_{k} \sim$ Poisson $(μ p_{k})$ .
For any $n_{1}, n_{2}, \dots, n_{m}$ , let $n = n_{1} + n_{2} + \dots + n_{m}$ , and consider
$A = {N_{1} = n_{1}, N_{2} = n_{2}, \dots, N_{m} = n_{m}} = {N = n} \cap {N_{1 n} = n_{1}, N_{2 n} = n_{2}, \dots, N_{m n} = n_{m}}$
Since N is independent of the class of $I_{E_{k i}}$ , the class
${{N = n}, {N_{1 n} = n_{1}, N_{2 n} = n_{2}, \dots, N_{m n} = n_{m}}}$
is independent. By the product rule and the multinomial distribution
$P (A) = e^{- μ} \frac{μ^{n}}{n!} \cdot n! \prod_{k = 1}^{m} \frac{p_{k}^{n_{k}}}{(n_{k})!} = \prod_{k = 1}^{m} e^{- μ p_{k}} \frac{p_{k}^{n_{k}}}{n_{k}!} = \prod_{k = 1}^{m} P (N_{k} = n_{k})$
The second product uses the fact that
$e^{μ} = e^{μ (p_{1} + p_{2} + \dots + p_{m})} = \prod_{k = 1}^{m} e^{μ p_{k}}$
Thus, the product rule holds for the class ${N_{k} : 1 \leq k \leq m}$ , so that it is independent.

Extreme values

Consider an iid class ${Y_{i} : 1 \leq i}$ of nonnegative random variables. For any positive integer n we let

V_{n} = min {Y_{1}, Y_{2}, \dots, Y_{n}} and W_{n} = max {Y_{1}, Y_{2}, \dots, Y_{n}}

Then

P (V_{n} > t) = P^{n} (Y > t) and P (W_{n} \leq t) = P^{n} (Y \leq t)

Now consider a random number N of the Y _i . The minimum and maximum random variables are

V_{N} = \sum_{n = 0}^{\infty} I_{{N = n}} V_{n} and W_{N} = \sum_{n = 0}^{\infty} I_{{N = n}} W_{n}

— $□$

Computational formulas

If we set $V_{0} = W_{0} = 0$ , then

$F_{V} (t) = P (V \leq t) = 1 + P (N = 0) - g_{N} [P (Y > t)]$
$F_{W} (t) = g_{N} [P (Y \leq t)]$

These results are easily established as follows. ${V_{N} > t} = ⋁_{n = 0}^{\infty} {N = n} {V_{n} > t}$ . By additivity and independence of ${N, V_{n}}$ for each n

P (V_{N} > t) = \sum_{n = 0}^{\infty} P (N = n) P (V_{n} > t) = \sum_{n = 1}^{\infty} P (N = n) P^{n} (Y > t), since P (V_{0} > t) = 0

If we add into the last sum the term $P (N = 0) P^{0} (Y > t) = P (N = 0)$ then subtract it, we have

P (V_{N} > t) = \sum_{n = 0}^{\infty} P (N = n) P^{n} (Y > t) - P (N = 0) = g_{N} [P (Y > t)] - P (N = 0)

A similar argument holds for proposition (b). In this case, we do not have the extra term for ${N = 0}$ , since $P (W_{0} \leq t) = 1$ .

Special case . In some cases, $N = 0$ does not correspond to an admissible outcome (see [link] , below, on lowest bidder and [link] ). In that case

F_{V} (t) = \sum_{n = 1}^{\infty} P (V_{n} \leq t) P (N = n) = \sum_{n = 1}^{\infty} [1 - P^{n} (Y > t)] P (N = n) = \sum_{n = 1}^{\infty} P (N = n) - \sum_{n = 1}^{\infty} P^{n} (Y > t) P (N = n)

Add $P (N = 0) = P^{0} (Y > t) P (N = 0)$ to each of the sums to get

F_{V} (t) = 1 - \sum_{n = 0}^{\infty} P^{n} (Y > t) P (N = n) = 1 - g_{N} [P (Y > t)]

— $□$

Maximum service time

The number N of jobs coming into a service center in a week is a random quantity having a Poisson (20) distribution. Suppose the service times (in hours) for individualunits are iid, with common distribution exponential (1/3). What is the probability the maximum service time for the units is no greater than 6, 9, 12, 15, 18 hours?SOLUTION

Solution

P (W_{N} \leq t) = g_{N} [P (Y \leq t)] = e^{20 [F_{Y} (t) - 1]} = exp (- 20 e^{- t / 3})

t = 6:3:18;
PW = exp(-20*exp(-t/3));disp([t;PW]')6.0000    0.0668
    9.0000    0.369412.0000    0.6933
   15.0000    0.873918.0000    0.9516

Got questions? Get instant answers now!

<< Chapter < Page Page > Chapter >>

Read also:

Get Jobilize Job Search Mobile App in your pocket Now!

100% Free Mobile Applications
Receive real-time job alerts and never miss the right job again

Source: OpenStax, Applied probability. OpenStax CNX. Aug 31, 2009 Download for free at http://cnx.org/content/col10708/1.6

Google Play and the Google Play logo are trademarks of Google Inc.

Notification Switch

Would you like to follow the 'Applied probability' conversation and receive update notifications?

Ask

	5 Microbiology Final Practice By Madison Christian Start Assignment
	Macroeconomics By OpenStax Read Online Course
	Renaissance Baroque Arts By Marion Cabalfin Start Quiz
	Fluid Mechanics MCQ By Stephanie Redfern Start Quiz
	Introduction to sociology By OpenStax Read Online Course
	25 AP 25 Urinary System MCQ By OpenStax Start Quiz
	Microeconomics By OpenStax Read Online Course
	Measurement Experimentation Lab MCQ By Steve Gibbs Start Quiz
	20 AP 20 Blood Vessels Circulation MCQ By OpenStax Start Quiz
	Clinical Psychology MCQ By Saylor Foundation Start Quiz