+ Reply to Thread
Results 1 to 4 of 4

Thread: Hypergeometric distribution - expected value derivation

  1. #1
    Points: 863, Level: 15
    Level completed: 63%, Points required for next Level: 37

    Posts
    19
    Thanks
    3
    Thanked 0 Times in 0 Posts

    Hypergeometric distribution - expected value derivation



    Hello,

    I just had a question regarding deriving the expected value of the Hypergeometric(N,M,n) distribution. I know that the expected value is nM/N. So, I used the standard definition for determining expected value for discrete distribution (ie. \sum_{x} x P(X=x))

    So far, I have been able to extract the nM/N from the main term as shown below, but this would mean that the remaining sum would need to equal 1. How would I be able to prove this?

    Thanks.

    E(X) = \frac{nM}{N}\sum_{x=max(1,n-N+M)}^{min(n,m)} 
\frac{\frac{(M-1)!}{(x-1)!(M-x)!}
\binom{N-M}{n-x}}{\frac{(N-1)!}{(n-1)!(N-n)!}
}

  2. #2
    Super Moderator
    Points: 8,575, Level: 62
    Level completed: 42%, Points required for next Level: 175
    Dragan's Avatar
    Location
    Illinois, US
    Posts
    1,725
    Thanks
    0
    Thanked 127 Times in 113 Posts

    Re: Hypergeometric distribution - expected value derivation

    You're approaching this in the wrong way. In short, change variables where k = x - 1. Further, let M = N1 where N1 + N2 = N as follows:

    \frac{\sum_{k=0}^{n-1}\binom{N_{1}-1}{k}\binom{N_{2}}{n-1-k}}{\binom{N-1}{n-1}}=1

  3. #3
    Points: 92, Level: 1
    Level completed: 84%, Points required for next Level: 8

    Posts
    1
    Thanks
    0
    Thanked 0 Times in 0 Posts

    Re: Hypergeometric distribution - expected value derivation

    Right. The straightforward way to derive this value is to set up the weighted sum as you've done, fiddle with the binomial coefficients a bit to absorb the summation variable into one of them and then realize that you're staring at an instance of Vandermonde's identity.

    A slicker way that doesn't involve this nasty-looking sum is to use indicator random variables and take advantage of symmetry. Hint: consider the r.v.s I_k which indicate that the kth draw was one of the M possible "successes."

  4. #4
    Super Moderator
    Points: 8,575, Level: 62
    Level completed: 42%, Points required for next Level: 175
    Dragan's Avatar
    Location
    Illinois, US
    Posts
    1,725
    Thanks
    0
    Thanked 127 Times in 113 Posts

    Re: Hypergeometric distribution - expected value derivation


    Quote Originally Posted by amd View Post
    Right. The straightforward way to derive this value is to set up the weighted sum as you've done,...
    Well, no, it is not easier. Rather, it is easier to derive the expectation by using the following fact:

    \binom{N}{n}=\sum_{x=0}^{n}\binom{N_{1}}{x}\binom{N_{2}}{n-x}

    where

    N = N_{1}+N_{2}

    and it is understood that \binom{k}{j}=0 if j>k.

+ Reply to Thread

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts








Advertise on Talk Stats