Suppose every vertex of a directed graph has at most incoming bonds. In bond percolation with parameter , open a site whenever at least one incoming bond is open. Incoming bond sets have different heads and hence are disjoint, so these site indicators are independent random variables. Supplement their probabilities to . Every vertex reached by a nontrivial open directed path is now open. Conditioning the root to be open gives , since a simple directed path from the root never uses a bond entering the root. Thus .
Articles by others on the same topic
There are currently no matching articles.