Consider random sequential adsorption on a red/blue chequerboard lattice with arrivals at rate 1 on the red squares and rate λ on the blue squares. We prove that the critical value of λ, above which we get an infinite blue component, is finite and strictly greater than 1.

We consider the question of when a random walk on a finite abelian group with a given step distribution can be used to reconstruct a binary labeling of the elements of the group, up to a shift. Matzinger and Lember (2006) give a sufficient condition for reconstructability on cycles. While, as we...