Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

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?

share|improve this question
Do you know the relationship between Poisson distribution and exponential distribution? –  André Nicolas Oct 10 '12 at 6:05
I know that the expected value of the waiting time is $1/{\lambda}$. Is that what you're getting at? –  jrad Oct 10 '12 at 6:06
More. That the waiting time is exponentially distributed. –  André Nicolas Oct 10 '12 at 6:07
Sorry, but I'm not really seeing where this is going. Care to elaborate a bit? –  jrad Oct 10 '12 at 6:13
Should I give an answer? –  André Nicolas Oct 10 '12 at 6:17

1 Answer 1

up vote 1 down vote accepted

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.

share|improve this answer
It's no question why you have so much reputation. Thank you. –  jrad Oct 10 '12 at 6:23

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.