Skip to main content

The Complexity of Three-Dimensional Critical Avalanches

  • Conference paper
Cellular Automata (ACRI 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6350))

Included in the following conference series:

  • 1702 Accesses

Abstract

In this work we study the complexity of the three-dimensional sandpile avalanches triggered by the addition of two critical configurations. We prove that the algorithmic problem consisting in predicting the evolution of three dimensional critical avalanches is the hardness core of the three-dimensional Abelian Sandpile Model. On the other hand we prove that three-dimensional critical avalanches are superlinear long on average. It suggests that the prediction problem is superlinear-hard on average.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bak, P., Tang, C., Wiesenfeld, K.: Self-organized Criticality. Physical Review A 38, 364–374 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  2. Dhar, D.: Theoretical Studies of Self-organized Criticality. Physica A 369, 29–70 (2006)

    Article  MathSciNet  Google Scholar 

  3. Mejía, C., Montoya, A.: On the Algorithmic Complexity of the Abelian Sandpile Model. In: Proceedings of Automata 2009, pp. 147–162 (2009) (submitted)

    Google Scholar 

  4. Moore, C., Nilsson, M.: The computational complexity of sandpiles. Journal of Statistical Physics 96, 205–224 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  5. Tardos, G.: Polynomial bound for a chip firing game on graphs. SIAM J. Discrete Mathematics 1, 397–398 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  6. Toumpakari, E.: On the abelian sandpile model. Ph.D. Thesis, University of Chicago (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mejía, C., Andrés Montoya, J. (2010). The Complexity of Three-Dimensional Critical Avalanches. In: Bandini, S., Manzoni, S., Umeo, H., Vizzari, G. (eds) Cellular Automata. ACRI 2010. Lecture Notes in Computer Science, vol 6350. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15979-4_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15979-4_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15978-7

  • Online ISBN: 978-3-642-15979-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics