2 variable binomial distribution?

Master J
Messages
219
Reaction score
0
I'm having a bit of trouble understanding a probability distribution of 2 variables.

Take for example taking n cards from a deck, and seeing what is the probability of getting X queens and say Y aces (with replacement). This involves the binomial distribution. The probabilities for the individual events are straight forward, but I'm having trouble getting the binomial coefficients.

Normally, for one variable, the coefficient is just n C X ( n choose X) where n is the total number of trials. This is n! / X! (n-X)! ... but how do you get this now for an X and a Y?
 
Last edited:
Physics news on Phys.org
I think you want a "multinomial distribution" and "multinomial coefficients" rather than a binomial distribution.

The binomial distribution can be understood from an analysis of the algebra used in computing the coefficients of terms in the expression (p + q)^n.

The multinomial distribution can be understood from analysing the algebra used in computing the coefficients of terms in expressions like (p_a + p_q + p_s)^n.
 
I don't know how searching for "multinomial" escaped me!

I know that the coefficient for my stated problem is as follows:

\frac{n!}{X! Y! (n - X - Y)!}

Does that seem correct? I haven't seen that particular form anywhere I've looked.
 
That's correct for the coefficient. To get the probability, the coefficient is multiplied by a term of the form p^X q^Y (1 - p - q)^{(n-X-Y)}
 
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.
Back
Top