The model investigated in this work, a particular cellular automaton with stochastic evolution, was introduced as the simplest case of self-organized-criticality, that is, a dynamical system which shows algebraic long-range correlations without any tuning of parameters. The author derives exact results which are potentially also interesting outside the area of critical phenomena. Exact means also site-by-site and not only ensemble average or coarse graining. Very complex and amazingly beautiful periodic patterns are often generated by the dynamics involved, especially in deterministic protocols in which the sand is added at chosen sites. For example, the author studies the appearance of allometric structures, that is, patterns which grow in the same way in their whole body, and not only near their boundaries, as commonly occurs. The local conservation laws which govern the evolution of these patterns are also presented. This work has already attracted interest, not only in non-equilibrium statistical mechanics, but also in mathematics, both in probability and in combinatorics. There are also interesting connections with number theory. Lastly, it also poses new questions about an old subject. As such, it will be of interest to computer practitioners, demonstrating the simplicity with which charming patterns can be obtained, as well as to researchers working in many other areas.

The Mathematics of Chip-firing is a solid introduction and overview of the growing field of chip-firing. It offers an appreciation for the richness and diversity of the subject. Chip-firing refers to a discrete dynamical system — a commodity is exchanged between sites of a network according to very simple local rules. Although governed by local rules, the long-term global behavior of the system reveals fascinating properties. The Fundamental properties of chip-firing are covered from a variety of perspectives. This gives the reader both a broad context of the field and concrete entry points from different backgrounds. Broken into two sections, the first examines the fundamentals of chip-firing, while the second half presents more general frameworks for chip-firing. Instructors and students will discover that this book provides a comprehensive background to approaching original sources. Features: Provides a broad introduction for researchers interested in the subject of chip-firing The text includes historical and current perspectives Exercises included at the end of each chapter About the Author: Caroline J. Klivans received a BA degree in mathematics from Cornell University and a PhD in applied mathematics from MIT. Currently, she is an Associate Professor in the Division of Applied Mathematics at Brown University. She is also an Associate Director of ICERM (Institute for Computational and Experimental Research in Mathematics). Before coming to Brown she held positions at MSRI, Cornell and the University of Chicago. Her research is in algebraic, geometric and topological combinatorics.

This book offers an in-depth study of two well-known models of “avalanche” dynamics, modified minimally by the inclusion of relaxation. Many complex systems respond to continuous inputs of energy by accumulation of stress over time, interrupted by sudden energy releases called avalanches. The first model studied is the viscoelastic interface driven over disorder, which is shown to display the fundamental features of friction. In the mean-field limit, the friction force derived semi-analytically is compatible with laboratory experiments (displaying both velocity weakening and contact aging). In two dimensions, large-scale numerical simulations are in good agreement with the basic features of real earthquakes (Gutenberg-Richter Law, aftershock migration). The second model is a non-Markovian variant of Directed Percolation, in which we observe that the universality class is only partly modified by relaxation, a promising finding with respect to our first model.

Combinatorics plays a prominent role in contemporary mathematics, due to the vibrant development it has experienced in the last two decades and its many interactions with other subjects. This book arises from the INdAM conference "CoMeTA 2013 - Combinatorial Methods in Topology and Algebra,'' which was held in Cortona in September 2013. The event brought together emerging and leading researchers at the crossroads of Combinatorics, Topology and Algebra, with a particular focus on new trends in subjects such as: hyperplane arrangements; discrete geometry and combinatorial topology; polytope theory and triangulations of manifolds; combinatorial algebraic geometry and commutative algebra; algebraic combinatorics; and combinatorial representation theory. The book is divided into two parts. The first expands on the topics discussed at the conference by providing additional background and explanations, while the second presents original contributions on new trends in the topics addressed by the conference.

This two-volume set constitutes the refereed proceedings of the 17th CCF Conference on Computer Supported Cooperative Work and Social Computing, ChineseCSCW 2022 held in Datong, China, during September 23–25, 2022. The 60 full papers and 30 short papers included in this two-volume set were carefully reviewed and selected from 211 submissions. They were organized in topical sections as follows: answer set programming; Social Media and Online Communities, Collaborative Mechanisms, Models, Approaches, Algorithms and Systems; Crowd Intelligence and Crowd Cooperative Computing; Cooperative Evolutionary Computation and Human-like Intelligent Collaboration; Domain-Specific Collaborative Applications.