A coin flip by any other name (2023)
A Coin Flip by Any Other Name… Consider the following graph. If we remove each edge with independent probability 1 / 2 , 1/2, 1/2, what's the probability that there is still a path from the top to the bottom vertex? Since each subset of edges is equally likely to be removed, this is the same as asking how many ways there are to cut this graph in two—that is, how many sets of removed edges would disconnect the top and bottom vertices. In general, getting through a combinatorics problem like th