6:05 AM
@Tapi on that note, i came up with a percolation problem without really intending to
suppose we have a function $f(x,y)$ on pairs of nonnegative integers with the following properties. first, the easy ones: $f(0,y)=f(x,0)=0$ for all $x,y$, whereas $f(1,1)=1$
now a more tedious (but momentarily trivial) construction. if f(x-1,y), f(x,y-1) are both equal to 0, then let f(x,y)=0. but if either is 1, then f(x,y)=1.
it doesn't take a lot of thinking to see what will happen: we have for instance f(1,2)=f(2,1)=1 since f(1,1)=1, and iterating from here we get f(x,y)=1 for all positive x,y. like i said, trivial
but now we introduce an element of randomness: if either f(x,y-1), f(x-1,y) is equal to 1, then set f(x,y)=1 with probability p. otherwise, set f(x,y)=0.
this is all a bit tedious to say but it's simple enough to generate random tables of f(x,y) in Mathematica. (dunno if it's as efficient as possible but w/e)
if you convert one of these tables into a binary array plot (i.e., black dots wherever a 1 shows up) you definitely see percolation phenomena. for instance, here's a 100-by-100 example generated for $p=0.75$:
(another approach is to set $f(x,0)=f(0,y)=1$ on the boundary. then you get a lot more 'shoots' but also a lot of noise)
oops, that was with p=0.72
might put that up as a question in some form but i dunno what to ask about it beyond "hey this looks cool, what kind of percolation problem is it"