Description
Consider the random motion of 200 particles in a 50 by 50 square with vertices (0,0), (0,50), (50,50), (0,50) in a plane. At each iteration, n = 0, 1, 2,. . . each particle moves 1 unit in one direction only, due north, due east, due south, or due west, and it must move.
Particles are initially randomly distributed on points with integer coordinates, but not on the boundaries and at each iteration each particle moves. The number of condensed particles is tallied at each iteration.
If a particle comes in contact with the west, east, or north wall it bounces off by returning to the position just before the bump. If the particle comes in contact with the south or bottom wall it condenses and stays exactly at the position of contact, thus depleting the number of particles which are still randomly moving in the square.
We show a snapshot of several iterations of the particles and the plot of the number of condensed particles at each iteration.
We provide several animations for different runs of the simulation and we offer several data sets from such simulations.
Comments
Comments
There are no comments on this resource.