We consider the length of the longest significance run in a (two-dimensional) Bernoulli net and derive its asymptotic limit distribution. Our results can be considered as generalizations of known ...

Place an obstacle with probability 1 − p independently at each vertex of ℤd, and consider a simple symmetric random walk that is killed upon hitting one of the obstacles. For d ≥ 2 and p strictly ...