A Local Stochastic Algorithm for Separation in Heterogeneous Self-Organizing Particle Systems


In this talk, I present our stochastic algorithm for separation and integration in heterogeneous particle systems. Achieving separation or integration depends only on a single global parameter determining whether particles prefer to be next to other particles of the same color or not. The algorithm is a generalization of a previous distributed, stochastic algorithm for compression that can be viewed as a special case of separation where all particles have the same color. However, it is significantly more challenging to prove that the desired behavior is achieved in the heterogeneous setting, necessitating the use of new tools like the cluster expansion from statistical physics.

September 21, 2019 9:00 AM
Massachusetts Institute of Technology (MIT)
Cambridge, MA, USA
Joshua J. Daymude
Joshua J. Daymude
Assistant Professor, Computer Science

I am a Christian and assistant professor in computer science studying collective emergent behavior and programmable matter through the lens of distributed computing, stochastic processes, and bio-inspired algorithms. I also love gaming and playing music.