Local Stochastic Algorithms for Alignment in Self-Organizing Particle Systems

Authors Hridesh Kedia, Shunhao Oh, Dana Randall



PDF
Thumbnail PDF

File

LIPIcs.APPROX-RANDOM.2022.14.pdf
  • Filesize: 0.79 MB
  • 20 pages

Document Identifiers

Author Details

Hridesh Kedia
  • Georgia Institute of Technology, Atlanta, GA, USA
Shunhao Oh
  • Georgia Institute of Technology, Atlanta, GA, USA
Dana Randall
  • Georgia Institute of Technology, Atlanta, GA, USA

Cite As Get BibTex

Hridesh Kedia, Shunhao Oh, and Dana Randall. Local Stochastic Algorithms for Alignment in Self-Organizing Particle Systems. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 245, pp. 14:1-14:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022) https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.14

Abstract

We present local distributed, stochastic algorithms for alignment in self-organizing particle systems (SOPS) on two-dimensional lattices, where particles occupy unique sites on the lattice, and particles can make spatial moves to neighboring sites if they are unoccupied. Such models are abstractions of programmable matter, composed of individual computational particles with limited memory, strictly local communication abilities, and modest computational capabilities. We consider oriented particle systems, where particles are assigned a vector pointing in one of q directions, and each particle can compute the angle between its direction and the direction of any neighboring particle, although without knowledge of global orientation with respect to a fixed underlying coordinate system. Particles move stochastically, with each particle able to either modify its direction or make a local spatial move along a lattice edge during a move. We consider two settings: (a) where particle configurations must remain simply connected at all times and (b) where spatial moves are unconstrained and configurations can disconnect.
Our algorithms are inspired by the Potts model and its planar oriented variant known as the planar Potts model or clock model from statistical physics. We prove that for any q ≥ 2, by adjusting a single parameter, these self-organizing particle systems can be made to collectively align along a single dominant direction (analogous to a solid or ordered state) or remain non-aligned, in which case the fraction of particles oriented along any direction is nearly equal (analogous to a gaseous or disordered state). In the connected SOPS setting, we allow for two distinct parameters, one controlling the ferromagnetic attraction between neighboring particles (regardless of orientation) and the other controlling the preference of neighboring particles to align. We show that with appropriate settings of the input parameters, we can achieve compression and expansion, controlling how tightly gathered the particles are, as well as alignment or nonalignment, producing a single dominant orientation or not. While alignment is known for the Potts and clock models at sufficiently low temperatures, our proof in the SOPS setting are significantly more challenging because the particles make spatial moves, not all sites are occupied, and the total number of particles is fixed.

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Stochastic processes
  • Theory of computation → Random walks and Markov chains
  • Theory of computation → Self-organization
Keywords
  • Self-organizing particle systems
  • alignment
  • Markov chains
  • active matter

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. Logan E. Beaver and Andreas A. Malikopoulos. An overview on optimal flocking. Annual Reviews in Control, 51:88-99, January 2021. URL: https://doi.org/10.1016/j.arcontrol.2021.03.004.
  2. T. Bodineau, D. Ioffe, and Y. Velenik. Rigorous Probabilistic Analysis of Equilibrium Crystal Shapes. Journal of Mathematical Physics, 41(3):1033-1098, March 2000. https://arxiv.org/abs/math/9911106. URL: https://doi.org/10.1063/1.533180.
  3. Christian Borgs, Jennifer Chayes, Tyler Helmuth, Will Perkins, and Prasad Tetali. Efficient sampling and counting algorithms for the Potts model on ℤ^d at all temperatures. In Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, pages 738-751, New York, NY, USA, June 2020. ACM. URL: https://doi.org/10.1145/3357713.3384271.
  4. Christian Borgs, Jennifer Chayes, Jeff Kahn, and László Lovász. Left and right convergence of graphs with bounded degree. arXiv, January 2010. URL: http://arxiv.org/abs/1002.0115.
  5. Sarah Cannon, Joshua J. Daymude, Cem Gökmen, Dana Randall, and Andréa W. Richa. A Local Stochastic Algorithm for Separation in Heterogeneous Self-Organizing Particle Systems. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019), volume 145 of Leibniz International Proceedings in Informatics (LIPIcs), pages 54:1-54:22, Dagstuhl, Germany, 2019. ISSN: 1868-8969. URL: https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.54.
  6. Sarah Cannon, Joshua J. Daymude, Cem Gokmen, Dana Randall, and Andréa W. Richa. A Local Stochastic Algorithm for Separation in Heterogeneous Self-Organizing Particle Systems. arXiv, June 2019. URL: http://arxiv.org/abs/1805.04599,
  7. Sarah Cannon, Joshua J. Daymude, Dana Randall, and Andréa W. Richa. A Markov Chain Algorithm for Compression in Self-Organizing Particle Systems. In Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, PODC '16, pages 279-288, New York, NY, USA, July 2016. Association for Computing Machinery. URL: https://doi.org/10.1145/2933057.2933107.
  8. Sarah Cannon, Joshua J. Daymude, Dana Randall, and Andréa W. Richa. A Markov Chain Algorithm for Compression in Self-Organizing Particle Systems. Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing - PODC '16, pages 279-288, 2016. URL: http://arxiv.org/abs/1603.07991.
  9. L. Chayes, R. Kotecký, and S. B. Shlosman. Aggregation and intermediate phases in dilute spin systems. Commun.Math. Phys., 171(1):203-232, July 1995. URL: https://doi.org/10.1007/BF02103776.
  10. Joshua J. Daymude, Kristian Hinnenthal, Andréa W. Richa, and Christian Scheideler. Computing by Programmable Particles. In Paola Flocchini, Giuseppe Prencipe, and Nicola Santoro, editors, Distributed Computing by Mobile Entities: Current Research in Moving and Computing, Lecture Notes in Computer Science, pages 615-681. Springer International Publishing, Cham, 2019. URL: https://doi.org/10.1007/978-3-030-11072-7_22.
  11. Zahra Derakhshandeh, Shlomi Dolev, Robert Gmyr, Andréa W. Richa, Christian Scheideler, and Thim Strothmann. Amoebot - a new model for programmable matter. In Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures, SPAA '14, pages 220-222, New York, NY, USA, June 2014. Association for Computing Machinery. URL: https://doi.org/10.1145/2612669.2612712.
  12. Hugo Duminil-Copin and Stanislav Smirnov. The connective constant of the honeycomb lattice equals √2+√2. Annals of Mathematics, 175(3):1653-1665, 2012. Publisher: Annals of Mathematics. URL: https://www.jstor.org/stable/23234646.
  13. J. W. Essam and C. Tsallis. The Potts model and flows. I. The pair correlation function. J. Phys. A: Math. Gen., 19(3):409-422, February 1986. Publisher: IOP Publishing. URL: https://doi.org/10.1088/0305-4470/19/3/022.
  14. Sacha Friedli and Yvan Velenik. Cluster Expansion. In Statistical Mechanics of Lattice Systems: A Concrete Mathematical Introduction, pages 232-261. Cambridge University Press, Cambridge, 2017. URL: https://doi.org/10.1017/9781316882603.006.
  15. W. K. Hastings. Monte Carlo Sampling Methods Using Markov Chains and Their Applications. Biometrika, 57(1):97-109, 1970. Publisher: [Oxford University Press, Biometrika Trust]. URL: https://doi.org/10.2307/2334940.
  16. Tyler Helmuth, Will Perkins, and Guus Regts. Algorithmic Pirogov-Sinai theory. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, pages 1009-1020, New York, NY, USA, June 2019. Association for Computing Machinery. URL: https://doi.org/10.1145/3313276.3316305.
  17. Dmitry Ioffe and Roberto H. Schonmann. Dobrushin-kotecký-Shlosman Theorem up to the Critical Temperature. Comm Math Phys, 199(1):117-167, December 1998. URL: https://doi.org/10.1007/s002200050497.
  18. A. Jadbabaie, Jie Lin, and A.S. Morse. Coordination of groups of mobile autonomous agents using nearest neighbor rules. IEEE Transactions on Automatic Control, 48(6):988-1001, June 2003. Conference Name: IEEE Transactions on Automatic Control. URL: https://doi.org/10.1109/TAC.2003.812781.
  19. Matthew Jenssen and Will Perkins. Independent sets in the hypercube revisited. Journal of the London Mathematical Society, 102(2):645-669, 2020. URL: https://doi.org/10.1112/jlms.12331.
  20. R. Kotecký and D. Preiss. Cluster expansion for abstract polymer models. Comm. Math. Phys., 103(3):491-498, 1986. Publisher: Springer-Verlag. URL: http://projecteuclid.org/euclid.cmp/1104114796.
  21. Shengkai Li, Bahnisikha Dutta, Sarah Cannon, Joshua J. Daymude, Ram Avinery, Enes Aydin, Andréa W. Richa, Daniel I. Goldman, and Dana Randall. Programming active cohesive granular matter with mechanically induced phase changes. Science Advances, 7(17):eabe8494, April 2021. Publisher: American Association for the Advancement of Science Section: Research Article. URL: https://doi.org/10.1126/sciadv.abe8494.
  22. Nancy A. Lynch. Distributed Algorithms. Elsevier, April 1996. Google Scholar
  23. Joseph E. Mayer. The Statistical Mechanics of Condensing Systems. I. J. Chem. Phys., 5(1):67-73, January 1937. Publisher: American Institute of Physics. URL: https://doi.org/10.1063/1.1749933.
  24. Joseph E. Mayer. The Theory of Ionic Solutions. J. Chem. Phys., 18(11):1426-1436, November 1950. Publisher: American Institute of Physics. URL: https://doi.org/10.1063/1.1747506.
  25. Nicholas Metropolis, Arianna W. Rosenbluth, Marshall N. Rosenbluth, Augusta H. Teller, and Edward Teller. Equation of State Calculations by Fast Computing Machines. J. Chem. Phys., 21(6):1087-1092, June 1953. Publisher: American Institute of Physics. URL: https://doi.org/10.1063/1.1699114.
  26. R. A. Minlos and Ja G. Sinaĭ. The phenomenon of phase separation at low temperatures in some lattice models of a gas. I. Math. USSR Sb., 2(3):335, April 1967. Publisher: IOP Publishing. URL: https://doi.org/10.1070/SM1967v002n03ABEH002345.
  27. Sarah Miracle, Dana Randall, and Amanda Pascoe Streib. Clustering in Interfering Binary Mixtures. In Leslie Ann Goldberg, Klaus Jansen, R. Ravi, and José D. P. Rolim, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, Lecture Notes in Computer Science, pages 652-663, Berlin, Heidelberg, 2011. Springer. URL: https://doi.org/10.1007/978-3-642-22935-0_55.
  28. R. Olfati-Saber. Flocking for multi-agent dynamic systems: algorithms and theory. IEEE Transactions on Automatic Control, 51(3):401-420, March 2006. Conference Name: IEEE Transactions on Automatic Control. URL: https://doi.org/10.1109/TAC.2005.864190.
  29. G. Ortiz, E. Cobanera, and Z. Nussinov. Dualities and the phase diagram of the p-clock model. Nuclear Physics B, 854(3):780-814, January 2012. URL: https://doi.org/10.1016/j.nuclphysb.2011.09.012.
  30. C.-E. Pfister. Interface free energy or surface tensrion: definition and basic properties. arXiv, 2009. URL: http://arxiv.org/abs/0911.5232.
  31. S. A. Pirogov and Ya. G. Sinai. Phase diagrams of classical lattice systems. Theor Math Phys, 25(3):1185-1192, December 1975. URL: https://doi.org/10.1007/BF01040127.
  32. S. A. Pirogov and Ya. G. Sinai. Phase diagrams of classical lattice systems continuation. Theor Math Phys, 26(1):39-49, January 1976. URL: https://doi.org/10.1007/BF01038255.
  33. Wenquan Qin, Shucong Lin, Xuan Chen, Jian Chen, Lei Wang, Hongpeng Xiong, Qinxi Xie, Zhaohui Sun, Xiujun Wen, and Cai Wang. Food Transport of Red Imported Fire Ants (Hymenoptera: Formicidae) on Vertical Surfaces. Scientific Reports, 9(1):3283, March 2019. Number: 1 Publisher: Nature Publishing Group. URL: https://doi.org/10.1038/s41598-019-39756-4.
  34. Craig W. Reynolds. Flocks, herds and schools: A distributed behavioral model. In Proceedings of the 14th annual conference on Computer graphics and interactive techniques, SIGGRAPH '87, pages 25-34, New York, NY, USA, August 1987. Association for Computing Machinery. URL: https://doi.org/10.1145/37401.37406.
  35. Herbert Robbins. A Remark on Stirling’s Formula. The American Mathematical Monthly, 62(1):26-29, 1955. Publisher: Mathematical Association of America. URL: https://doi.org/10.2307/2308012.
  36. Herbert G. Tanner, Ali Jadbabaie, and George J. Pappas. Flocking in Fixed and Switching Networks. IEEE Transactions on Automatic Control, 52(5):863-868, May 2007. Conference Name: IEEE Transactions on Automatic Control. URL: https://doi.org/10.1109/TAC.2007.895948.
  37. Tamás Vicsek, András Czirók, Eshel Ben-Jacob, Inon Cohen, and Ofer Shochet. Novel Type of Phase Transition in a System of Self-Driven Particles. Phys. Rev. Lett., 75(6):1226-1229, August 1995. Publisher: American Physical Society. URL: https://doi.org/10.1103/PhysRevLett.75.1226.
  38. Tamás Vicsek and Anna Zafeiris. Collective motion. Physics Reports, 517(3):71-140, August 2012. URL: https://doi.org/10.1016/j.physrep.2012.03.004.
  39. José D. Villa. Swarming Behavior of Honey Bees (Hymenoptera: Apidae) in Southeastern Louisiana. Ann Entomol Soc Am, 97(1):111-116, January 2004. Publisher: Oxford Academic. URL: https://doi.org/10.1603/0013-8746(2004)097[0111:SBOHBH]2.0.CO;2.
  40. F. Y. Wu. The Potts model. Rev. Mod. Phys., 54(1):235-268, January 1982. Publisher: American Physical Society. URL: https://doi.org/10.1103/RevModPhys.54.235.
  41. Hai-Tao Zhang, Chao Zhai, and Zhiyong Chen. A General Alignment Repulsion Algorithm for Flocking of Multi-Agent Systems. IEEE Transactions on Automatic Control, 56(2):430-435, February 2011. Conference Name: IEEE Transactions on Automatic Control. URL: https://doi.org/10.1109/TAC.2010.2089652.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail