A Markov Chain Algorithm for Compression in Self-Organizing Particle Systems

DOI10.1145/2933057.2933107zbMath1375.68193arXiv1603.07991MaRDI QIDQ5361946

Dana Randall, Sarah M. Cannon, Joshua J. Daymude, Andréa W. Richa

Publication date: 29 September 2017

Published in: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1603.07991

zbMATH Keywords

Markov chains; compression; self-organizing particles

Mathematics Subject Classification ID

68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

60J20: Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.)

68W15: Distributed algorithms

Related Items

Unnamed Item, Improved Leader Election for Self-organizing Programmable Matter, The Synergy of Finite State Machines, Deterministic Leader Election in Programmable Matter, Unnamed Item, The canonical amoebot model: algorithms and concurrency control, Existence of a phase transition in harmonic activation and transport, Irreducibility of recombination Markov chains in the triangular lattice, A stochastic approach to shortcut bridging in programmable matter, Shape formation by programmable particles, Shape formation by programmable particles