= Directed percolation
In <bond percolation> on a <directed graph>, independently open each <directed edge> with <probability> $p$. The out-cluster of $x$ consists of vertices reachable by open <directed paths>. In <site percolation>, independently open vertices and require every vertex of the <directed path>, including $x$, to be open. The same definitions allow a <multigraph>. The orientation matters: an infinite underlying <connected graph> need not contain an infinite out-cluster from a specified root.
Back to article page
