Abstract
In this talk, I present the stochastic approach to self-organizing particle systems. I begin with the seminal algorithm for compression as an example of Markov chain-based algorithm design and its translation to distributed algorithms. I then give a sampling of proof techniques, including Peierls arguments. Finally, I overview the stochastic algorithms for shortcut bridging and separation as generalizations of compression.
Date
April 3, 2019 1:00 PM
Event
Location
Arizona State University
Tempe, AZ, USA
Joshua J. Daymude
Assistant Professor, SCAI & CBSS
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.