Computing sandpile configurations using integer linear programming

Sandpile group or Abelian sandpile model was the first example of a self-organized critical system studied by Bak, Tang and Wiesenfeld. It is well known that these recurrent configurations can be characterized as the optimal solution of certain non-linear optimization problems. We show that recurren...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Chaos, solitons and fractals Ročník 170; s. 113356
Hlavní autoři: Alfaro, Carlos A., Valencia, Carlos E., Vargas, Marcos C.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Ltd 01.05.2023
Témata:
Integer linear programming
Recurrent configurations
Sandpile group
Integer linear programming
90C90
Sandpile group
Recurrent configurations
90C27
ISSN:0960-0779, 1873-2887
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Sandpile group or Abelian sandpile model was the first example of a self-organized critical system studied by Bak, Tang and Wiesenfeld. It is well known that these recurrent configurations can be characterized as the optimal solution of certain non-linear optimization problems. We show that recurrent configurations of the Abelian sandpile model of a graph correspond to optimal solutions of some integer linear programs. More precisely, we present two new integer linear programming models, one that computes recurrent configurations and other one that computes the order of the configuration. As an application, we calculate the identity configuration for the cone of a regular graph and the cycle with n+1 vertices using the Weak Duality Theorem in linear programming.
ISSN:0960-0779
1873-2887
DOI:10.1016/j.chaos.2023.113356