This program draws the trajectories of two diffusively
coupled logistic maps on the square [0,1]x[0,1].
Point, click and see what you can find in the square
just below!
Point the mouse and click to start a new trajectory going.
You can vary r and epsilon, but note that you need
0
The mapping that is iterated is
(x,y) maps to (f(x)+epsilon(y-x),f(y)+epsilon(x-y))
where f(x)=rx(1-x). The square [0,1] by [0,1] is shown in this simulation.