Law of Large Numbers for an elementary model of Self-organised Criticality

arXiv2304.10169MaRDI QIDQ6433719FDOQ6433719

Authors: A. A. Járai, Christian Mönch, Lorenzo Taggi 

Publication date: 20 April 2023

Abstract: We consider an elementary model for self-organised criticality, the activated random walk on the complete graph. We introduce a discrete time Markov chain as follows. At each time step we add an active particle at a random vertex and let the system stabilise following the activated random walk dynamics, obtaining a particle configuration with all sleeping particles. Particles visiting a boundary vertex are removed from the system. We characterise the stationary distribution of this Markov chain, showing that, with high probability, the number of particles concentrates around the value $h{o}_{c}N$ within a critical window of size at most $O(sqrtNlogN)$, where N is the number of vertices. Due to the mean-field nature of the model, we are also able to determine precisely the critical density $h{o}_c=lambda/(1+lambda)$, where $lambda$ is the sleeping rate.

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Interacting particle systems in time-dependent statistical mechanics (82C22) Dynamic and nonequilibrium phase transitions (general) in statistical mechanics (82C26)

This page was built for publication: Law of Large Numbers for an elementary model of Self-organised Criticality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6433719)