Skip to main content

On Sand Automata

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2607))

Abstract

In this paper we introduce sand automata in order to give a common and useful framework for the study of most of the models of sandpiles. Moreover we give the possibility to have sources and sinks of “sand grains”. We prove a result which shows that the class of sand automata is rich enough to simulate any reasonable model of sandpiles based on local interaction rules. We also give an algorithm to find the fixed points of the evolutions of the sandpiles. Finally we prove that reversibility is equivalent to bijectivity.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Anderson, L. Lovász, P. Shor, J. Spencer, E. Tardos, and S. Winograd. Disks, balls and walls: analysis of a combinatorial game. American mathematical monthly, 96:481–493, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  2. P. Bak. How nature works-The science of SOC. Oxford University Press, 1997.

    Google Scholar 

  3. A. Bjorner and L. Lovász. Chip firing games on directed graphs. Journal of algebraic combinatorics, 1:305–328, 1992.

    Article  Google Scholar 

  4. T. Brylawski. The lattice of integer partitions. Discrete mathematics, 6:201–219, 1973.

    Article  MATH  MathSciNet  Google Scholar 

  5. B. Durand. Global properties of cellular automata. In E. Goles and S. Martinez, editors, Cellular Automata and Complex Systems. Kluwer, 1998.

    Google Scholar 

  6. J. Durand-Lose. Automates cellulaires, automates à partition et tas de sable. PhD thesis, Université de Bordeaux-LABRI, 1996.

    Google Scholar 

  7. E. Goles. Sand pile automata. Annales Insitut Henri Poincaré, Physique Théorique, 56(1):75–90, 1992.

    MATH  MathSciNet  Google Scholar 

  8. E. Goles and M. A. Kiwi. Game on line graphs and sandpile automata. Theoretical computer science, 115:321–349, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  9. E. Goles and M. A. Kiwi. Sandpiles dynamics in a one-dimensional bounded lattice. Theoretical computer science, 136(2):527–532, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  10. E. Goles, M. Morvan, and H. D. Phan. Lattice structure and convergence of a game of cards. Annals of Combinatorics, 2002. To appear.

    Google Scholar 

  11. E. Goles, M. Morvan, and H. D. Phan. Sandpiles and order structure of integer partitions. Discrete Applied Mathematics, 117(1–3):51–64, 2002.

    Article  MATH  MathSciNet  Google Scholar 

  12. E. Goles, M. Morvan, and H. D. Phan. The structure of linear chip firing game and related models. Theoretical Computer Science, 270:827–841, 2002.

    Article  MATH  MathSciNet  Google Scholar 

  13. H. J. Jensen. Self-organized criticality. Cambridge University Press, 1998.

    Google Scholar 

  14. H. D. Phan. Structures ordonnées et dynamique de pile de sable. PhD thesis, Université Denis Diderot Paris VII-LIAFA, 1999.

    Google Scholar 

  15. S. Wolfram. Theory and application of cellular automata. Wold Scientific Publishing Co., 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cervelle, J., Formenti, E. (2003). On Sand Automata. In: Alt, H., Habib, M. (eds) STACS 2003. STACS 2003. Lecture Notes in Computer Science, vol 2607. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36494-3_56

Download citation

  • DOI: https://doi.org/10.1007/3-540-36494-3_56

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00623-7

  • Online ISBN: 978-3-540-36494-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics