Poisson Process Conditional Distribution

jiml
Messages
3
Reaction score
0

Homework Statement


X_t and Y_t are poisson processes with rates a and b

n = 1,2,3...Find the CDF F_X{}_t{}_|{}_X{}_t{}_+{}_Y{}_t{}_={}_n(x)

Homework Equations


The Attempt at a Solution


F_X{}_t{}_|{}_X{}_t{}_+{}_Y{}_t{}_={}_n(x)

=P(X_t<x|X_t+Y_t=n)

=\frac{P(X_t<x,X_t+Y_t=n)}{P(X_t+Y_t=n)}

Not sure from here, but here goes:

=\frac{P(Y_t>n-x)}{P(X_t+Y_t=n)}

=1-\frac{P(Y_t<=n-x)}{P(X_t+Y_t=n)}
Not sure if doing correctly.
 
Physics news on Phys.org
jiml said:

Homework Statement


X_t and Y_t are poisson processes with rates a and b

n = 1,2,3...


Find the CDF F_X{}_t{}_|{}_X{}_t{}_+{}_Y{}_t{}_={}_n(x)


Homework Equations





The Attempt at a Solution


F_X{}_t{}_|{}_X{}_t{}_+{}_Y{}_t{}_={}_n(x)

=P(X_t<x|X_t+Y_t=n)

=\frac{P(X_t<x,X_t+Y_t=n)}{P(X_t+Y_t=n)}

Not sure from here, but here goes:

=\frac{P(Y_t>n-x)}{P(X_t+Y_t=n)}

=1-\frac{P(Y_t<=n-x)}{P(X_t+Y_t=n)}



Not sure if doing correctly.

Since X and Y are counting processes, you should probably avoid using the letter 'x' for values of them, so instead, should use something like ##F_{X_t|X_t + Y_t = n}(m).## Note also that the standard definition of a cdf involves '≤', not '<', so
F_{X_t|X_t + Y_t = n}(m) = P(X_t \leq m|X_t+Y_t = n).
 
Can someone please help me with my solution, whether I am on the right track in my steps to get to a solution. Thanks
 
jiml said:
Can someone please help me with my solution, whether I am on the right track in my steps to get to a solution. Thanks

All you have done is use the definition of conditional probability; you are nowhere near the final solution.
 
ok,thanks
 
Last edited:
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top