Kakashi
- 10
- 0
Mod note: Moved from technical math section, so no homework template in post.
Is it correct that the success of one link is independent of thte success of other links. For example is P(C->E|A->C)=P(C->E) true?
Node A can connect to node B through 3 possible paths:
ACEB
ACFB
ADB
If A is connected to B through one of these paths, does this imply that the other paths have failed, or can multiple paths be operational at the same time?
Meaning of a single path
The probability that the event ACEB works means that all links are up and since links are independent
P(A∩C∩E∩B)=0.9*0.8*0.9=0.648=P(E->B | C->E ∩ A->C)*P(C->E ∩ A->C)=P(E->B)*P(C->E|A->C)*P(A->C)=P(E->B)*P*(C->E)*P(A->C)
Is this probability the probability that only ACEB occurs? Since I am conditioning on predecessor links being up, does this make the probability of ACFB and ADB equal to 0?
Intuitively, since the link A→C is already known to be up, it seems that ACFB should still be possible.
P(A->B)=P(ACEB U ACFB U ADB)=P(ACEB)+P(ACFB)+P(ADB)-P(ACEB∩ACFB)-P(ACEB ∩ ADB)-P(ACFB ∩ ADB)-P(ACEB ∩ ACFB ∩ ADB)
Are the intersection terms P(ACEB ∩ ADB), P(ACFB ∩ ADB),and P(ACEB ∩ ACFB ∩ ADB) equal to 0 because the paths use disjoint links?
Is it correct that the success of one link is independent of thte success of other links. For example is P(C->E|A->C)=P(C->E) true?
Node A can connect to node B through 3 possible paths:
ACEB
ACFB
ADB
If A is connected to B through one of these paths, does this imply that the other paths have failed, or can multiple paths be operational at the same time?
Meaning of a single path
The probability that the event ACEB works means that all links are up and since links are independent
P(A∩C∩E∩B)=0.9*0.8*0.9=0.648=P(E->B | C->E ∩ A->C)*P(C->E ∩ A->C)=P(E->B)*P(C->E|A->C)*P(A->C)=P(E->B)*P*(C->E)*P(A->C)
Is this probability the probability that only ACEB occurs? Since I am conditioning on predecessor links being up, does this make the probability of ACFB and ADB equal to 0?
Intuitively, since the link A→C is already known to be up, it seems that ACFB should still be possible.
P(A->B)=P(ACEB U ACFB U ADB)=P(ACEB)+P(ACFB)+P(ADB)-P(ACEB∩ACFB)-P(ACEB ∩ ADB)-P(ACFB ∩ ADB)-P(ACEB ∩ ACFB ∩ ADB)
Are the intersection terms P(ACEB ∩ ADB), P(ACFB ∩ ADB),and P(ACEB ∩ ACFB ∩ ADB) equal to 0 because the paths use disjoint links?
Last edited by a moderator: