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

DOI10.1145/2933057.2933107zbMath1375.68193arXiv1603.07991OpenAlexW3106481070MaRDI 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 chainscompressionself-organizing particles

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Distributed algorithms (68W15)

Related Items (11)

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

This page was built for publication: A Markov Chain Algorithm for Compression in Self-Organizing Particle Systems