Conditional expectation of Exp(theta)

ghostyc
Messages
25
Reaction score
0
Given X follows an exponential distribution \theta

how could i show something like

\operatorname{E}(X|X \geq \tau)=\tau+\frac 1 \theta

?

i have get the idea of using Memorylessness property here,
but how can i combine the probabilty with the expectation?

thanks.

casper
 
Physics news on Phys.org
ghostyc said:
i have get the idea of using Memorylessness property here,
but how can i combine the probabilty with the expectation?

If you write down mathematically the Memorynessless property then it might become obvious. Otherwise it's fine to express the conditional expectation as a ratio of integrals and evaluate it directly.
 
bpet said:
If you write down mathematically the Memorynessless property then it might become obvious. Otherwise it's fine to express the conditional expectation as a ratio of integrals and evaluate it directly.

\Pr(T > s + t\; |\; T > s) = \Pr(T > t) \;\; \hbox{for all}\ s, t \ge 0.

i just can't convert from expectation to the probability...

damn
 
That's what I did so far.

But I just can't use the memoryless property to do it ...

http://img138.imageshack.us/img138/5945/tempz.jpg
 

Attachments

  • temp.jpg
    temp.jpg
    26.2 KB · Views: 529
Last edited by a moderator:
ghostyc said:
That's what I did so far.

But I just can't use the memoryless property to do it ...

Hint: rewrite the memoryless property into a form suitable to use on line 1 of your proof. Conditional probabilities -> conditional cdf -> conditional pdf.
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.

Similar threads

Back
Top