Mathematical aspects of the abelian sandpile model
Mathematical aspects of the abelian sandpile model
复制标题
阿贝尔沙堆模型的数学方面
DOI:
--
复制
发表时间:
2005
期刊:
影响因子:
--
通讯作者:
F. Redig
中科院分区:
文献类型:
--
作者:
F. Redig
In 1988, Bak, Tang and Wiesenfeld (BTW) introduced a lattice model of what they called “self-organized criticality”. Since its appearance, this model has been studied intensively, both in the physics and in the mathematics literature. It shows how a simple dynamics can lead to the emergence of very complex structures and drive the system towards a stationary state which shares several properties of equilibrium systems at the critical point, e.g. power-law decay of cluster sizes and of correlations of the height-variables. Some years later, Deepak Dhar generalized the model, discovered the “abelian group structure of addition operators” in it and called it “the abelian sandpile model”( abbreviated from now on ASM). He studied the self-organized critical nature of the stationary measure and gave an algorithmic characterization of recurrent configurations, the so-called “burning algorithm”. This algorithm gives a one-to one correspondence between the recurrent configurations of the ASM and rooted spanning trees. The correspondence with spanning trees allowed Priezzhev to compute the height probabilities in dimension 2 in the infinite-volume limit. Probabilities of certain special events -so-called “weakly allowed clusters”- can be computed exactly in the infinite-volume limit using the “Bombay-trick”. In the physics literature people studied critical exponents with scaling arguments, renormalization group method and conformal field theory (in d = 2), and it is argued that the upper critical dimension of the model is d = 4 [35]. Dhar and Majumdar studied the model on the Bethe lattice where they computed various correlation functions and avalanche cluster-size distributions exactly in the thermodynamic limit, using a transfer matrix approach. Since the discovery of the abelian group structure of the set of of recurrent configurations, in the mathematics literature (especially combinatorics and algebraic combinatorics) one (re)introduces the model under the names “chip-firing game, Dirichlet