Directed percolation and random walk

From MaRDI portal





The authors extend `dynamic renormalization' techniques, developed earlier for undirected percolation and the contact model, to the setting of directed percolation on \(\mathbb{Z}^d\) for \(d\geq 2\). The authors show that the percolation probability at the critical level vanishes. Another new result is a type of uniqueness theorem: for every pair \(x\) and \(y\) of vertices which lie in infinite open paths, there exists almost surely a third vertex \(z\) which is joined to infinity and which is attainable from \(x\) and \(y\) along directed open paths. The authors also prove in the supercritical case that a random walk on an infinite directed cluster is transient, almost surely, when \(d\geq 3\). It is shown how to adapt the block arguments to systems with infinite range, subject to certain conditions on the edge probabilities. For the entire collection see [Zbl 0996.00040].




Cited in
(29)








This page was built for publication: Directed percolation and random walk

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