1
$\begingroup$

Just a quick question regarding two Poisson Processes:

Let $X_t$ and $Y_t$ be two independent Poisson Processes with rate parameters $\lambda_1$ and $\lambda_2$, respectively, measuring the number of customers arriving in stores 1 and 2, respectively. What is the probability that a customer arrives in store 1 before any customers arrive in store 2?

My approach to this problem thus far has been to consider all possible times where store 1 could have a customer arrive, but that gets into dealing with infinity and I'm not so sure that's correct. Mathematically, I'm thinking I should calculate

$$P(X_1 = 1)P(Y_1 = 0) + P(X_2 = 1|X_1 = 0)P(Y_2 = 0) + P(X_3 = 1|X_2 = 0)P(Y_3 = 0) + ...+ P(X_n = 1|X_{n-1} = 0)P(Y_n = 0).$$

Is there an easier approach than the one I am taking? Is the approach I'm taking even correct?

  • 0
    Do you know the relationship between Poisson distribution and exponential distribution?2012-10-10
  • 0
    I know that the expected value of the waiting time is $1/{\lambda}$. Is that what you're getting at?2012-10-10
  • 0
    More. That the waiting time is exponentially distributed.2012-10-10
  • 0
    Sorry, but I'm not really seeing where this is going. Care to elaborate a bit?2012-10-10
  • 0
    Should I give an answer?2012-10-10
  • 0
    Well, the homework's not graded and is solely for our benefit of understanding the material, so it wouldn't hurt. Also, it's 2 am here and I need sleep so I'll go with yes, please give an answer.2012-10-10

1 Answers 1

1

Let the random variables $X$ and $Y$ denote the respective waiting times until the first customer. These two random variables have exponential distribution with parameters say $\lambda$ and $\mu$. We want the probability that $X\lt Y$.

By independence, the joint density is the product of the individual densities, so $$\Pr(X\lt Y)=\int_{y=0}^\infty \mu e^{-\mu y}\left(\int_{x=0}^y \lambda e^{-\lambda x}\,dx\right)\,dy.$$ The integrations are not difficult.

  • 0
    It's no question why you have so much reputation. Thank you.2012-10-10