= Uniform random orientation out-cluster comparison
{title2=$C^{\to}(o)\overset{d}=C_{1/2}(o)$}
If independent <edges> of a <locally finite graph> receive fair orientations, exploring outward from a root tests each fresh reached-to-unreached boundary <edge> with success <probability> $1/2$. Deferred decisions give exactly the exploration law of the root cluster in <bond percolation> of density $1/2$. Thus the two reachable <graph vertex> sets have the same distribution. An infinite out-cluster contains an infinite simple directed ray by the <König infinity lemma>. Geometrically biased orientations do not generally give the same uniform edge-success law.
Back to article page
