摘要

We consider a version of directed bond percolation on the honeycomb lattice as a brick lattice such that vertical edges are directed upward with probability y, and horizontal edges are directed rightward with probabilities x and one in alternate rows. Let tau(M, N) be the probability that there is at least one connected-directed path of occupied edges from (0, 0) to (M, N).

  • 出版日期2015-10-15