Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Memorylessness
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== Characterization of geometric distribution == If a discrete probability distribution is memoryless, then it must be the geometric distribution. From the memorylessness property,<math display="block">\Pr(X>t+s \mid X\geq s)=\Pr(X>t)</math>The definition of [[conditional probability]] reveals that<math display="block">\frac{\Pr(X > t + s)}{\Pr(X \geq s)} = \Pr(X > t)</math>From this it can be proven by induction that <math display="block">\Pr(X > kt) = \Pr(X > 1)^k</math>Then it follows that<math display="block">f_X(x)=Pr(X\leq x)=1-Pr(X>x)=1-Pr(X>1)^x</math> and if we let <math display="block">Pr(X>1)=1-p</math>for some <math>0\leq p \leq 1</math>. we can easily see that X is geometrically distributed with some parameter p. in other words <math display="block">X\sim Geo(p)</math>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)