SearcharxivSearch

arXiv · 2606.22092

Effect of rewiring for a sandpile model on a directed network

Abstract

Several studies have considered sandpile dynamics not over regular grids, but over networks. In this case, avalanches redistribute grains not between neighboring sites in a geometrical sense, but between connected sites, in a topological sense. However, depending on how nodes are connected, grains may never leave the system, preventing energy release. In this work, we study the simplest case, the BTW model in one and two dimensions, rewiring the nodes so that at every rewiring step, the energy release is always possible, and study avalanche statistics as a function of rewiring. In the 1D case, a transition is observed in the Gini coefficient of the load distribution per node at about 85% the number of possible rewirings, a transition which is not evident with other measures, such as the size distribution of avalanches or the mean distance between nodes in the network. In the 2D case, energy release follows a power law even when the grid is fully rewired, while the Gini coefficient, unlike the 1D case, decreases at a steady rate, with a smoother transition. The effect of network size N is studied, finding that there is a transition for the Gini coefficient at the thermodynamic limit N \to \infty for both the 1D and 2D cases, transition which is also observed in the betweenness centrality, but not in other topological measures. Finally, the dependence of the results with the load per rewiring iteration, and the avalanche threshold is studied.

Explore related subjects

Keep this discovery

BibTeXRIS

Alejandro Zamorano, Víctor Muñoz. 2026-06-20. Effect of rewiring for a sandpile model on a directed network. https://doi.org/10.1016/j.chaos.2026.118629

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Optical free space extreme learning machine for the implementation of emergent complex systems

Cellular automata conform a set of computational models which evolve with a reduced set of simple rules, yet still are able to show extremely complex emergent phenomena such as fractals and universal computation. Despite their apparent simplicity, they have shown great potential in simulating natural systems and solving challenging computational tasks such as classification and image generation. Instead of implementing cellular automata purely at the software level, it is desirable to design novel analog computing platforms that physically evolve following the automata's underlying rules, thereby reducing power requirements and latency. Here, we introduce an optical extreme learning machine for the simulation of a wide range of cellular automata. Our system operates in free space, and uses a spatial light modulator to encode the evolution rules of the system, while coherent wave propagation performs the corresponding computations. Our results demonstrate a simple, fully-programmable, cost and power efficient, and easy to build and align platform for the implementation of a wide range of complex computational systems such as elementary cellular automata, Conway's Game of Life, and two-dimensional Turing machines.

nlin.CG

The istr-graph: Interactive Visualisation of any Classic-Graph in DDLab

Any type of attractor basin (classic-graph) created in DDLab can now be visualised, manipulated, and deconstructed as a drag/drop ``interactive state transition graph'' (istr-graph). The new istr-graph applies to subtrees, single basins, the basin of attraction field, compression, and all other classic-graph parameters. This is an important update on the pre-existing ``interactive basin of attraction field graph'' (ibaf-graph) specific to just the complete uncompressed field, but the ibaf-graph is nevertheless retained for some of its unique attributes. These issues are discussed with a focus on the scope and implementation of the new istr-graph.

nlin.CG

Game of Life on Archimedean Lattices: Glider Guns and Phase Dynamics

I explore Conway's Game of Life (GoL) on six composite Archimedean lattices. On the Kagome lattice, on which small gliders and puffers appear particularly frequently across inputs, I use the output of a symmetry-constrained evolutionary search algorithm to construct a novel glider gun. The glider gun comprises four interacting bouncers and stably emits a small glider every 276th generation. Serving as an extension of classical GoL, I also propose cells with a phase degree of freedom and an associated local phase rule, which on the Kagome lattice is demonstrated to host phase-periodic gliders. This enables the possibility of phase-sensitive and interference-based computations.

nlin.CG