Math Is Fun Forum
You are not logged in.
- Topics: Active | Unanswered
#1 2006-12-31 05:05:03
- distributedrealtime
- Member
- Registered: 2006-12-30
- Posts: 2
Vysochanskiï-Petunin inequality (probability problem)
Is there a one-tailed version of the Vysochanskiï-Petunin inequality?
Offline
#2 2006-12-31 06:36:28
- krassi_holmz
- Real Member
- Registered: 2005-12-02
- Posts: 1,905
Re: Vysochanskiï-Petunin inequality (probability problem)
Couldn't you give some information about this inequality.
I have't heard it before.
IPBLE: Increasing Performance By Lowering Expectations.
Offline
#3 2006-12-31 06:39:58
- krassi_holmz
- Real Member
- Registered: 2005-12-02
- Posts: 1,905
Re: Vysochanskiï-Petunin inequality (probability problem)
http://en.wikipedia.org/wiki/Vysochansk … inequality
Probability theory. Sorry, I can't help you. Don't have enough background in the adranced probability theory.
IPBLE: Increasing Performance By Lowering Expectations.
Offline
#4 2006-12-31 21:21:00
- distributedrealtime
- Member
- Registered: 2006-12-30
- Posts: 2
Re: Vysochanskiï-Petunin inequality (probability problem)
Thanks for your effort. I have already seen that wikipedia page (I spent several days googling before posting here). For those who want to know, the Vysochanskiï-Petunin inequality is an inequality that bounds the probability that the value of a random variable with a unimodal distribution will be more than k standard deviations away from the mean i.e. (Pr( |x-a|>= kb) <= some bound), what I am interested in is a version that is one-tailed i.e.( Pr( (x-a)>= kb) <= some bound) without the modulus sign.
Last edited by distributedrealtime (2007-01-01 00:45:56)
Offline