Skip to main content
. 2011 Mar 2;27(8):1135–1142. doi: 10.1093/bioinformatics/btr099

Fig. 2.

Fig. 2.

A potential cut in a complete graph on four vertices, corresponding to the partition {{a}, {b, c, d}}. The probability of this partition is (1 − w1)(1 − w2)(1 − w3). Conversely, the probability that at least one edge crosses the cut is 1 − (1 − w1)(1 − w2)(1 − w3). Since we are considering at least two components, the probabilities w4, w5, w6 are not required for the calculation.