Percolation and first-passage percolation on oriented graphs

From MaRDI portal



Abstract: We give the first properties of independent Bernoulli percolation, for oriented graphs on the set of vertices that are translation-invariant and may contain loops. We exhibit some examples showing that the critical probability for the existence of an infinite cluster may be direction-dependent. Then, we prove that the phase transition in a given direction is sharp, and study the links between percolation and first-passage percolation on these oriented graphs.












This page was built for publication: Percolation and first-passage percolation on oriented graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2064863)