Take the 2-minute tour ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

Are there efficient approaches to compute p-values of samples drawn from a multivariate hypergeometric distribution? Specifically, how does the complexity grow as a function of the "urn size" and the number of different "colors" of balls within the "urn"?

share|improve this question
    
This seems to me to be borderline for MO. But I can't dismiss it right away. You may not get many answers though. –  David Roberts Jan 21 '11 at 4:28
    
Perhaps your local friendly computation/statistical Q&A forum? –  David Roberts Jan 21 '11 at 4:29
    
@david Thanks, I'll move on if there are no takers but MO seemed like it might be suitable. –  Bob bobson Jan 21 '11 at 4:32
    
Since a lot of people here aren't au fait with p-value computation algorithms, would you provide some examples? That may help to anchor the question a bit. –  David Roberts Jan 21 '11 at 4:53
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.