Poincaré's Recurrence Theorem for Two States

Roughly speaking, the Poincaré recurrence theorem states that, given infinite time, at some point an almost exact replica of a previous state of a system will be reached. This Demonstration has only two possible states in order to reduce computation time. You can cycle through the iterations to see the transition of elements (represented as disks) between the two states.
There is a maximum of 100,000 iterations and 15 elements to ensure that the calculations do not take more than a few seconds.
  • Contributed by: Ravi Sinha
  • (Mathematica Summer Camp 2014)


  • [Snapshot]
  • [Snapshot]
  • [Snapshot]


For more information, see [1].
[1] Wikipedia. "Poincaré Recurrence Theorem." (Jul 28, 2014) en.wikipedia.org/wiki/Poincar%C3%A9_recurrence_theorem.
    • Share:

Embed Interactive Demonstration New!

Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details »

Files require Wolfram CDF Player or Mathematica.