Probability question with a definite outcome

  • Thread starter Thread starter jodave614
  • Start date Start date
  • Tags Tags
    Probability
jodave614
Messages
1
Reaction score
0
So I'm having trouble calculating the probability of the following scenario:

I have 4 possible locations for 4 boxes. Each of these boxes may exist with a probability, β. There is also a circle, this circle definitely exists.There can only be one connection between the circle and the the group of boxes (i.e. the circle can only be connected to one boxes). What is the probability that the circle is connected to a spot with a box which does not exist?

Attempt at solution:

So I figure that i would need to multiply the probability that there is only one connection by the probability that that box doesn't exist. The only problem is that I couldn't figure out which probability I am supposed to put in the binomial equation, because I can't put in (1-β) as p because then q would be β, but it doesn't matter to me that all the other boxes exist, all I care about is the box with the connection exists. And then I thought to put in the probability that there is one connection in for p, but then I got 1 and q is 0. So I am really not sure what to do...
 
Last edited:
Physics news on Phys.org
Are you saying the circle can be connected to any number of spots, but to at most one that contains a box? If so, there's missing information: what controls the tendency for the connections to exist?
E.g. suppose the circle connects to each spot independently with probability p, except that you happen to know it has connected to at most one box. A priori, the probability of connecting to no boxes was P0 = Ʃpi(1-p)4-i 4Ci (1-β)i (i=0..4). The a priori probability of connecting to exactly one box was P1 = Ʃpi(1-p)4-i 4Ci iβ(1-β)i-1 (i=1..4). Now, armed with the knowledge that only one of these two possibilities occurred, the probability of not connecting to a box is P0/(P0+P1).
If there is always exactly one connection then it's easy: 1-β.
 
Namaste & G'day Postulate: A strongly-knit team wins on average over a less knit one Fundamentals: - Two teams face off with 4 players each - A polo team consists of players that each have assigned to them a measure of their ability (called a "Handicap" - 10 is highest, -2 lowest) I attempted to measure close-knitness of a team in terms of standard deviation (SD) of handicaps of the players. Failure: It turns out that, more often than, a team with a higher SD wins. In my language, that...
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...
Back
Top