Directed percolation and random walk
Abstract
Techniques of `dynamic renormalization', developed earlier for undirected percolation and the contact model, are adapted to the setting of directed percolation, thereby obtaining solutions of several problems for directed percolation on Zd where d 2. The first 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. Secondly, it is proved that a random walk on an infinite directed cluster is transient, almost surely, when d 3. And finally, the block arguments of the paper may be adapted to systems with infinite range, subject to certain conditions on the edge probabilities.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.