This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Emergence and Complexity in Theoretical Models of Self-Organized Criticality

Tridib Sadhu
(July 2011)

Statutory Declarations

Name of the Candidate : Tridib Sadhu
Title of the Thesis : Emergence and Complexity in
  Theoretical Models of Self-
  Organized Criticality.
Degree : Doctor of Philosophy (Ph.D.)
Subject : Physics
Name of the advisor : Prof. Deepak Dhar
Registration number : PHYS–154
Place of Research : Tata Institute of Fundamental
  Research, Mumbai 400005

Declaration Of Authorship

This thesis is a presentation of my original research work. Wherever contributions of others are involved, every effort is made to indicate this clearly, with due reference to the literature, and acknowledgement of collaborative research and discussions.

The work was done under the guidance of Professor Deepak Dhar, at the Tata Institute of Fundamental Research, Mumbai.

Signed: .        Date:.
Name: Tridib Sadhu

In my capacity as supervisor of the candidate’s thesis, I certify that the above statements are true to the best of my knowledge.

Signed: .        Date:.
Name: Prof. Deepak Dhar

Acknowledgements

I would like to express my gratitude to all those who helped me in the completion of this work. Most importantly, I gratefully acknowledge the guidance and support of my thesis advisor Prof. Deepak Dhar. His emphasis on perfection and strong sense of work ethics have had a deep influence on me.

I also acknowledge the financial support I received from TIFR, Mumbai.

My special thanks to Shaista for proofreading, and for helping me in many technical aspects of preparing the thesis. Finally, I would like to thank my family for their unconditional love and support.

Chapter 1 Synopsis

1.1  Introduction

The concept of self-organized criticality (SOC) was introduced by Bak Tang and Wiesenfeld in 1987 [btw], to explain the abundant fractal structures in nature, e.g. mountain ranges, river networks, power law tails in the distribution of earthquake intensities etc. The SOC refers to the non-equilibrium steady state of slowly driven systems, which show irregular burst like relaxations with a wide distribution of event sizes. The power law correlations of different physical quantities, extending over a wide range of length and time scales is a signature of criticality. Usually, reaching a critical state requires fine tuning of some control parameters e.g. temperature and magnetic field for the Ising model with a given interaction strength. However in SOC the systems reach a critical state under their own dynamics, irrespective of the initial states and without any obvious fine tuning of parameters.

In the last two decades a large amount of study is focused on understanding the mechanism of SOC. The questions regarding the universality classes of the critical states has still not been completely settled. Many theoretical models have been studied to address these issues. Most of these are cellular automata models with discrete or continuous variables, evolving under deterministic or stochastic evolution rules (see [dharphysica06] for a review). Among them the Abelian Sandpile Model (ASM) is studied the most, mainly because of its analytical tractability using the Abelian property[dharprl].

The standard ASM first proposed in [btw] is defined on a lattice with height variables ziz_{i} at each site ii, which is equal to the number of sand grains at that site. There is a threshold value zcz_{c} for each site, and any site with height zizcz_{i}\geq z_{c} is said to be unstable. The system in a stable configuration is driven by adding a single grain at a randomly chosen site. If this addition makes the system unstable, it relaxes by the following toppling rule: All the unstable sites at one time step transfers one grain each to all its nearest neighbors. Grains can move out of the lattice by toppling at the boundary. When the system reaches a stable configuration it is again driven by adding a grain and the process is repeated. The model reaches a steady state, in which the probability distribution of the size of events has power law tail.

The ASM defined on an infinite lattice when driven by adding grains only at a single site and relaxed, produces beautiful and complex patterns in height variables (see figure 1.11.1). They are one of the examples where complexity arises from simple rules. In section 1.2 we analyze some of these patterns and develop a detailed and exact mathematical characterization of them.

There are different variants of the ASM that have been proposed. We study two well known models among them.

First is the Zhang model. This is similar to the ASM, but with continuous non-negative variables, usually referred as energy. At any time step all the unstable sites relax by equally distributing all its energy amongst its nearest neighbors, with their energy reducing to zero. Energy can also move out of the system by toppling at the boundary. The driving is done by adding energy to a randomly chosen site and the amount of the energy is chosen at random from a distribution.

The second is a stochastic variant of the ASM. The first stochastic sandpile model was proposed by Manna and it is known as Manna model[manna]. The model is non-Abelian, but one can construct stochastic relaxation rules with Abelian character. We consider one such stochastic Abelian sandpile model introduced in [dm]. The model is similar to the ASM with non-negative integer height variables ziz_{i} and a threshold value zcz_{c} defined at each site. The driving is also done by adding one sand grain at a randomly chosen site in a stable configuration. The difference is in the relaxation rules: On toppling zcz_{c} number of grains are transfered, each grain moving independent of others to the nearest neighbors with equal probability and the height at the toppling site reduces by zcz_{c}. For the one dimensional model defined on a linear chain, with zc=2z_{c}=2, there are three possible events in a toppling at site ii: Both the neighbors (i1)\left(i-1\right) and (i+1)\left(i+1\right) gets one grain each. Probability of this event is 1/21/2. Other two possibilities are that both the grains move either to the left or to the right neighbor, each event with probability 1/41/4.

1.2  The spatial patterns in theoretical sandpile models

While real sand, poured at one point on a flat substrate, produces a rather simple conical pyramid shape, nontrivial patterns are generated this way in the ASM on an infinite lattice. One such pattern on a square lattice with threshold height zc=4z_{c}=4, produced by adding grains at the origin in an initial uniform distribution of heights z=2z=2, is shown in the figure 1.11.1.

Refer to caption
Refer to caption
Figure 1.1: The stable configurations for the Abelian sandpile model, obtained by adding 10410^{4} and 5×1045\times 10^{4} grains, respectively at one site on a square lattice. Initial configuration is with all heights 2. Color code: blue =0, green = 1, red = 2, yellow = 3. Both patterns are on the same scale. (Details can be seen in the electronic version using zoom in).
Refer to caption
Figure 1.2: F-lattice with checker board distribution of grains. Unfilled circles denote height z=1z=1 and filled ones z=0z=0. The gray area denotes a unit cell of the periodic distribution.
Refer to caption
Figure 1.3: The stable configuration for the Abelian sandpile model, obtained by adding 5×1045\times 10^{4} grains at one site, on the F-lattice of figure 1.2 with initial checkerboard configuration. Color code: red = 0, yellow = 1. The apparent orange regions in the picture represent the patches with checkerboard configuration. (Details can be seen in the electronic version using zoom in.)

The reason for interest in these patterns is two fold.

Firstly, these are analytically tractable examples of complex patterns that are obtained from simple deterministic evolution rules. Here complexity means that we have structures with variations, and a complete description of which is long. Thus, a living organism is complex because it has many different working parts, each formed by variations in the working out of the same, but relatively much simpler genetic coding.

Secondly, these patterns have the very interesting property of proportionate growth. This is a well-known feature of biological growth in animals, where different parts of the growing animal grow at roughly the same rate, keeping their shape almost the same. Our interest in studying the sandpile patterns comes from these being the simplest model of proportionate growth with non-trivial patterns. Compare the two patterns in figure 1.11.1 produced on the same background but with different values of NN. The pattern grows in size and finer features become discernible at the center, but the overall shape of the pattern remains same. Most of the other growth models studied in physics literature, such as the Eden model, the diffusion limited aggregation, or the surface deposition, do not show this property [eden, dla, barabasi]. In these models, the growth is confined to some active outer region. The inner structures, once formed are frozen in and do not evolve further in time.

The standard square lattice produces complicated patterns and it has not been possible to characterize them so far. We consider a pattern which is simpler but still complex. The pattern is produced on the F-lattice which is a variant of the square lattice with directed edges. The lattice with checker board distribution of heights is shown in figure 1.2. Each site has equal number of incoming and outgoing arrows. The threshold height is 22 and any unstable site relaxes by giving away one particle each in the direction of the outgoing arrows. The pattern produced by centrally seeding grains on the checkerboard background is shown in the figure 1.3.

1.2.1 The characterization of the pattern

We take some qualitative features of the observed pattern as input and show how one can get a complete and quantitative characterization of the pattern in the asymptotic limit of NN\rightarrow\infty.

In models with proportionate growth, it is natural to describe the asymptotic pattern in terms of the rescaled coordinate 𝐫=𝐑/Λ(N)\mathbf{r}=\mathbf{R}/\Lambda\left(N\right) where Λ(N)\Lambda\left(N\right) is the diameter of the pattern, suitably defined, and 𝐑\mathbf{R} is the position vector of a site on the lattice. The function Λ(N)\Lambda\left(N\right) increases in steps with NN and goes to infinity as NN\rightarrow\infty. In the asymptotic limit the pattern can be characterized by a function ρ(𝐫)\rho\left(\mathbf{r}\right) which gives the local density of sand grains in a small rectangle of size δξδη\delta\xi\delta\eta about the point 𝐫\mathbf{r}, with 1/Λδξ,δη11/\Lambda\ll\delta\xi,\delta\eta\ll 1 where ξ\xi and η\eta are the x and y components of the rescaled position vector 𝐫\mathbf{r}. We define Δρ(𝐫)\Delta\rho\left(\mathbf{r}\right) as the change in density ρ(𝐫)\rho\left(\mathbf{r}\right) from its background value.

The pattern is composed of large regions where the heights are periodic and we call these regions as patches. Inside each patch Δρ(𝐫)\Delta\rho\left(\mathbf{r}\right) is constant and takes only two values, either 0 or 1/21/2.

Let TN(𝐑)T_{N}\left(\mathbf{R}\right) be the number of topplings at site 𝐑\mathbf{R} when NN number of grains have been added and then relaxed. Define a rescaled toppling function

ϕ(𝐫)=limNTN(Λ𝐫)Λ(N)2,\phi\left(\mathbf{r}\right)=\lim_{N\rightarrow\infty}\frac{T_{N}\left(\lfloor\Lambda\mathbf{r}\rfloor\right)}{\Lambda\left(N\right)^{2}}, (1.1)

where the floor function x\lfloor x\rfloor is the largest integer less than or equal to xx. From the conservation of sand grains in the toppling process, it follows that ϕ\phi satisfies the Poisson equation

2ϕ(𝐫)=Δρ(𝐫)NΛ2δ(𝐫).\nabla^{2}\phi\left(\mathbf{r}\right)=\Delta\rho\left(\mathbf{r}\right)-\frac{N}{\Lambda^{2}}\delta\left(\mathbf{r}\right). (1.2)

The complete specification of ϕ(𝐫)\phi\left(\mathbf{r}\right) determines the density function Δρ(𝐫)\Delta\rho\left(\mathbf{r}\right) and hence the asymptotic pattern. The condition that determines ϕ(𝐫)\phi\left(\mathbf{r}\right) is the requirement that inside each patch of constant density, it is a quadratic function of ξ\xi and η\eta. Considering that there are only two types of patches and that ϕ(𝐫)\phi\left(\mathbf{r}\right) satisfies (1.2) we write

ϕ(𝐫)=18(1+m)ξ2+14nξη+18(1m)η2+dξ+eη+f,\phi\left(\mathbf{r}\right)=\frac{1}{8}\left(1+m\right)\xi^{2}+\frac{1}{4}n\xi\eta+\frac{1}{8}\left(1-m\right)\eta^{2}+d\xi+e\eta+f, (1.3)

for the patches with Δρ=1/2\Delta\rho=1/2 and

ϕ(𝐫)=18mξ2+14nξη18mη2+dξ+eη+f,\phi\left(\mathbf{r}\right)=\frac{1}{8}m\xi^{2}+\frac{1}{4}n\xi\eta-\frac{1}{8}m\eta^{2}+d\xi+e\eta+f, (1.4)

for the patches with Δρ=0\Delta\rho=0. Each patch is characterized by the values of the parameters mm,nn,dd,ee and ff. The continuity of ϕ(r)\phi\left(r\right) and its derivatives along the boundary between two adjacent patches imposes linear relations among the corresponding parameters. Using these relations we show that mm and nn take only integer values. Each patch with its parameters dd, ee and ff can be labeled by the pair (m,n)\left(m,n\right). The pair can be taken as the Cartesian coordinates of the adjacency graph of the patches, which for this pattern is a square lattice on a two sheeted Riemann surface. We show that the function D(m,n)=d(m,n)+ie(m,n)D\left(m,n\right)=d\left(m,n\right)+ie\left(m,n\right), with i=1i=\sqrt{-1}, satisfies the discrete Laplace’s equation on the adjacency graph. Using the asymptotic dependence of ϕ(𝐫)\phi\left(\mathbf{r}\right) close to the site of addition, we show that for large |m|+|n||m|+|n|,

D(m,n)±12πm+in.D\left(m,n\right)\simeq\pm\frac{1}{2\pi}\sqrt{m+in}. (1.5)

Solution of the discrete Laplace’s equation on this adjacency graph with the above boundary condition is difficult to determine. We numerically calculate the solution on finite adjacency graphs and extrapolate our results to the asymptotic limit. We also show that the pattern has an exact eight-fold rotational symmetry.

1.2.2 The effect of multiple sources or sinks

Refer to caption
Figure 1.4: The pattern produced by adding N=14×106N=14\times 10^{6} grains at the site (0,1)\left(0,1\right) in the checkerboard background on the F-lattice with the sink sites placed along the X-axis. Color code: yellow=1, and red=0. (Details can be seen in the electronic version using zoom in.)

We also studied the patterns where the grains are added at more than one site or those formed in presence of sink sites. One such pattern on the F-lattice with the checker board background in presence of a line of sink sites is shown in the figure 1.4{\color[rgb]{1,0,0}1.4}. There are still only two types of patches and like the single source case, the spatial distances can be expressed in terms of the solution of the discrete Laplace’s equation on the adjacency graph. However, the structure of the adjacency graph changes. For the pattern in figure 1.4{\color[rgb]{1,0,0}1.4}, the adjacency graph is still a square lattice but on a Riemann surface of three sheets. We have explicitly worked out the spatial distances by numerically solving the Laplace’s equation on this graph. We have also studied the case with two sites of addition and quantitatively characterized the pattern.

The most interesting effect of the sink sites is that it changes how different spatial lengths in the pattern scale with the number of added grains NN. For example, in the absence of sink sites, the diameter Λ(N)\Lambda\left(N\right) of the pattern in figure 1.3 grows as N\sqrt{N}, for large NN, whereas in presence of a line of sink sites next to the site of addition, it changes to N1/3N^{1/3}. More precisely, we show that in this case

C1Λ3+C2Λ2N,C_{1}\Lambda^{3}+C_{2}\Lambda^{2}\simeq N, (1.6)

where C1C_{1} and C2C_{2} are numerical constants. For C1=0.1853C_{1}=0.1853 and C2=0.528C_{2}=0.528 this relation describes the NN dependence of Λ(N)\Lambda\left(N\right) for NN in the range of 100100 to 10510^{5}, with unexpectedly high accuracy where both sides of the above equation differs by at most 11.

We have also studied the case in which the source site is at the corner of a wedge angle ω\omega, where the wedge boundaries are absorbing. We show that the relation similar to (1.6) is

C1Λ2+α+C2Λ2N,C_{1}\Lambda^{2+\alpha}+C_{2}\Lambda^{2}\simeq N, (1.7)

where α=ω/(π+2ω)\alpha=\omega/\left(\pi+2\omega\right). This analysis is extended to other lattices with different initial height distribution, and also to higher dimensions.

1.2.3 The compact and non-compact growth

Refer to caption
Figure 1.5: Directed triangular lattice. Unfilled circles represent z=1z=1 and filled ones z=2z=2. The gray area denotes a unit cell of the periodic distribution.
Refer to caption
Figure 1.6: The pattern produced by adding N=520N=520 grains at a single site on the directed triangular lattice. Only the patch boundaries are shown by colored lines. (Details can be seen in the electronic version using zoom in.)

The growth rate of the patterns closely depends on the background height distribution. When the heights at all sites on the background are low enough, one gets patterns with Λ(N)\Lambda\left(N\right) growing as N1/dN^{1/d} in d-dimensions. We refer to this growth as the compact growth. However if sites with maximum stable height in the background form an infinite cluster we get avalanches that do not stop, and the pattern is not-well defined. We describe our unexpected finding of an interesting class of backgrounds, that show an intermediate behavior. For any NN, the avalanches are finite, but the diameter of the pattern increases as NαN^{\alpha}, for large NN, with 1/2<α11/2<\alpha\leq 1. We call this as non-compact growth. The exact value of α\alpha depends on the background. These patterns still show proportionate growth.

We characterize one such pattern in the asymptotic limit for which α=1\alpha=1. This pattern is produced on a triangular lattice with directed edges with the background shown in the figure 1.5. The threshold height is 33 and the toppling rules are similar to the model on the F-lattice. The corresponding pattern is shown in figure 1.6. We show that for this pattern the rescaled toppling function ϕ\phi is piece-wise linear in ξ\xi and η\eta. The adjacency graph is also simpler, it is a hexagonal lattice and like the previous examples, the spatial distances in the pattern are expressed in terms of the solution of the Laplace’s equation on this graph. We determine the solution in a closed integral form.

1.3  Emergence of quasi-units in the Zhang model

The Zhang model in one dimension has the remarkable property that in spite of the randomness in the amount of energy added during driving, the steady state energy per site has a very sharply peaked distribution in which the width of the peak is much less than the spread in the input amount. One such distribution is shown in figure 1.7. The threshold energy Ec=1.5E_{c}=1.5 and the driving energy is chosen from a uniform distribution in the range [0.76:1.24]\left[0.76:1.24\right]. The distribution has a spike at E=0E=0 and a peak at E=1.0E=1.0 with a standard deviation σ=0.0135\sigma=0.0135. In general the width of the peak decreases with the increase of the system size.

Refer to caption
Figure 1.7: The probability distribution of energy per site in the Zhang model defined on a linear chain of length L=100L=100.

This behavior was noticed in numerical simulations in both one and two dimensions, and it is called as “emergence of quasi-units”. It is argued that for large systems, the behavior would be the same as in the discrete model [zhang]. Fey et. al. [fey] have shown that for some choices of the distribution of input energy, in one dimension, the variance of energy does go to zero as length of the chain LL goes to infinity. However they did not show how fast the variance decreases with LL.

We study the emergent behavior in the one-dimensional model by looking at how the added energy is redistributed among different sites in the relaxation process. Let the amount of energy for driving at time tt be chosen randomly from a uniform interval [1ϵ,1+ϵ]\left[1-\epsilon,1+\epsilon\right]. The time is counted in terms of the relaxation steps and at one time step all the unstable sites relax together. We write the amount of driving energy at time tt as

Δt=1+ϵut,\Delta_{t}=1+\epsilon u_{t}, (1.8)

where utu_{t} is uniformly distributed in the interval [1,1]\left[-1,1\right]. We decompose the energy variable at a site xx in a relaxation time step tt as

E(x,t)=Nint[E(x,t)]+ϵη(x,t)E\left(x,t\right)=Nint[E\left(x,t\right)]+\epsilon\eta\left(x,t\right) (1.9)

where NintNint refers to the nearest integer value. The integer part evolves as the integer heights in the ASM. The function η(x,t)\eta\left(x,t\right) is independent of ϵ\epsilon and is a linear function of utu_{t}. The precise function depends on the evolution history HtH_{t} which is determined by the initial configuration and the sequence of addition sites dtd_{t} up to time tt. We assume that at starting time t=0t=0, the variable η(x,t=0)\eta\left(x,t=0\right) are zero for all xx, and the initial configuration is a recurrent configuration of the ASM. We define G(x,t|dt,t,Ht)G\left(x,t|d_{t^{\prime}},t^{\prime},H_{t}\right) by

η(x,t|{ut},Ht)=t=1tG(x,t|dt,t,Ht)ut.\eta\left(x,t|\left\{u_{t}\right\},H_{t}\right)=\sum_{t^{\prime}=1}^{t}G\left(x,t|d_{t^{\prime}},t^{\prime},H_{t}\right)u_{t^{\prime}}. (1.10)

We show that this is equal to the probability Prob(x,t|dt,t,Ht)Prob\left(x,t|d_{t^{\prime}},t^{\prime},H_{t}\right) of a marked grain in the corresponding ASM, added at the site dtd_{t^{\prime}} at time tt^{\prime} following the history HtH_{t}, to be found at site xx at time tt

G(x,t|at,t,Ht)=Prob(x,t|at,t,Ht).G\left(x,t|a_{t^{\prime}},t^{\prime},H_{t}\right)=Prob\left(x,t|a_{t^{\prime}},t^{\prime},H_{t}\right). (1.11)

Then we show that the variance of energy in the steady state at a site xx can be written as

Var[E(x)]=L/(L+1)2+ϵ2Σ2(x),Var\left[E\left(x\right)\right]=L/(L+1)^{2}+\epsilon^{2}\Sigma^{2}\left(x\right), (1.12)

where

Σ2(x)=limtVar[η(x,t)]=13τ=01LlimtxG2(x,t+τ|x,t,Ht)¯.\Sigma^{2}\left(x\right)=\lim_{t\rightarrow\infty}Var\left[\eta\left(x,t\right)\right]=\frac{1}{3}\sum_{\tau=0}^{\infty}\frac{1}{L}\lim_{t^{\prime}\rightarrow\infty}\sum_{x^{\prime}}\overline{G^{2}(x,t^{\prime}+\tau|x^{\prime},t^{\prime},H_{t})}. (1.13)

The overbar denotes averaging over the evolution histories HtH_{t}.

The function G¯\overline{G} has been studied in [punya], but for G2¯\overline{G^{2}} the calculation is much more difficult. However analyzing the behavior in different limits we introduce a phenomenological expression for it and show that in the large LL limit the variance of energy at a site xx has a scaling form L1g(x/L)L^{-1}g\left(x/L\right). We determine an approximate form of the scaling function

g(ξ)=Aln(1+1Bξ(1ξ)),g\left(\xi\right)=A\ln\left(1+\frac{1}{B\sqrt{\xi\left(1-\xi\right)}}\right), (1.14)

where AA and BB are numerical constants. This expression agrees very well with the results of our numerical simulation.

1.4  Stochastic models of SOC

The sandpile models with stochastic toppling rules are important subclass of SOC models. These models are able to describe the avalanche behavior seen experimentally in the piles of granular media much better than the deterministic models [osloexpt]. Also in the numerical studies, one gets better scaling collapse, and consequently, more reliable estimates for the values of the critical exponents, than for the models with deterministic toppling rules [stochnum]. There is good numerical evidence that these models constitute a universality class different from their deterministic counter parts [univ1, univ2, numbtw, numsand1, numsand2].

Unfortunately, at present, the theoretical understanding of the models with stochastic toppling rules is much less than the deterministic models, even the characterization of the steady state is not known for the one-dimensional Manna model.

We consider the Manna model with Abelian toppling rule on a linear chain of length LL, described in section 1.1. Any stable state of the model is expressed as a linear combination of the stable height configurations with the coefficients being the probability of finding the system in that configuration. We define an addition operator 𝐚i\mathbf{a}_{i} corresponding to the addition of grains at the site ii, which acting on a stable state takes it to another stable state achieved following the stochastic relaxation rule.

The Abelian property of the operators is shown in [dm]. However, unlike the deterministic ASM, the inverse operator {𝐚i1}\left\{\mathbf{a}_{i}^{-1}\right\} need not exist. This makes the determination of the matrix form of the operators difficult for this model. In a straightforward exact numerical calculation of the steady state one needs to invert a matrix of size 4L×4L4^{L}\times 4^{L}. We use the operator algebra of the addition operators to obtain an efficient method which requires inverting a matrix only of size 2L×2L2^{L}\times 2^{L}.

Using the conservation of sand grains during toppling we show that

𝐚i2=14(𝐚i1+𝐚i+1)2.\mathbf{a}_{i}^{2}=\frac{1}{4}\left(\mathbf{a}_{i-1}+\mathbf{a}_{i+1}\right)^{2}. (1.15)

In general the operators 𝐚i\mathbf{a}_{i} need not be diagonalizable. However, using the Abelian property we construct a common set of generalized eigenvectors for all the operators such that in this basis the matrices simultaneously reduce to the Jordan block form. Corresponding to each block there is at least one common eigenvector. Then from eq. (1.15), the eigenvalues satisfy

ai2=14(ai1+ai+1)2,a_{i}^{2}=\frac{1}{4}\left(a_{i-1}+a_{i+1}\right)^{2}, (1.16)

with the boundary condition a0=aL+1=1a_{0}=a_{L+1}=1. We reduce this set of coupled quadratic equations to a set of linear equations by taking square root

ηiai=12(ai1+ai+1),\eta_{i}a_{i}=\frac{1}{2}\left(a_{i-1}+a_{i+1}\right), (1.17)

where ηi=±1\eta_{i}=\pm 1. There are 2L2^{L} different choices for the set of LL different η\eta’s and for each such choice, we get a set of eigenvalues {ai}\left\{a_{i}\right\}. In general there will be degenerate sets of eigenvalues. We show that degeneracies are possible only for L=3(mod4)L=3\left(\rm{mod~}4\right) and the set can at most be doubly degenerate. This implies that the largest dimension of a Jordan block is 22. We determine the matrix elements inside each block in terms of the solution of a set of coupled linear equations.

We define a transformation matrix between this generalized eigenvector basis and the height configuration basis.

|{zi}=j𝐌{zi},j|ψj,|\left\{z_{i}\right\}\rangle=\sum_{j}\mathbf{M}_{\left\{z_{i}\right\},j}|\psi_{j}\rangle, (1.18)

where |{zi}|\left\{z_{i}\right\}\rangle is the basis vector corresponding to the height configuration {zi}\left\{z_{i}\right\} and |ψj|\psi_{j}\rangle is the jj th generalized eigenvector. Any height configuration can be generated by an appropriate sequence addition operators acting on the all empty configuration. As the action of the addition operators on the generalized eigenvectors are known, this determines the elements of the transformation matrix 𝐌\mathbf{M}.

Given 𝐌\mathbf{M} we can get the eigenvectors of the addition operators in the configuration basis, in particular, the steady state vector, by the inverse transformation

|ψj=𝐌1|{zi}.|\psi_{j}\rangle=\mathbf{M}^{-1}|\left\{z_{i}\right\}\rangle. (1.19)

We numerically calculate the inverse matrix 𝐌1\mathbf{M}^{-1} and determine the exact steady state for systems of small sizes. This result is then extrapolated to determine the asymptotic density profile in the steady state. Our results suggest that the steady state density averaged over all sites approaches the asymptotic density as

1ρL=1ρ+B(L+δ,)ν\frac{1}{\rho_{L}}=\frac{1}{\rho_{\infty}}+\frac{B}{\left(L+\delta,\right)^{\nu}} (1.20)

with ρ=0.953\rho_{\infty}=0.953 which is close to the Monte Carlo estimate 0.9490.949. We also find that the ratio of probabilities of the most probable to the least probable configuration varies as exp(0.94LlogL)\exp{\left(0.94L\log L\right)}. We show that the steady state is not a product measure state.

The method described is easily generalized to other stochastic Abelian sandpile models and we discuss some examples of them.

Chapter 2 List of publications

  • (1)

    Tridib Sadhu and Deepak Dhar, Emergence of quasiunits in the one-dimensional zhang model, Phys. Rev. E. 𝟕𝟕\mathbf{77} (2008). no. 3, 031122.

  • (2)

    Tridib Sadhu and Deepak Dhar, Steady state of stochastic sandpile models, Journal of Statistical Physics 𝟏𝟑𝟒\mathbf{134} (2009), 427.

  • (3)

    Deepak Dhar, Tridib Sadhu, and Samarth Chandra, Pattern formation in growing sandpiles, Europhysics Letters 𝟖𝟓\mathbf{85} (2009), no. 4, 48002.

  • (4)

    Tridib Sadhu and Deepak Dhar, Pattern formation in growing sandpiles with multiple sources and sinks, Journal of Statistical Physics 𝟏𝟑𝟖\mathbf{138} (2010), 815.

  • (5)

    Tridib Sadhu and Deepak Dhar, Pattern formation in fast growing sandpiles, Phys. Rev. E. 𝟖𝟓\mathbf{85} (2012), 021107.

Chapter 3 Introduction

3.1  Self-organized criticality (SOC)

One of the most striking aspects of physics is the simplicity of its laws. Maxwell’s equations, Schrodinger’s equation, and Hamiltonian mechanics are simple and expressible in few lines. However every place we look, outside the textbook examples, we see a world of amazing complexity: huge mountain ranges, scale free coastlines, the delicate ridges on the surface of sand dunes, the interdependencies of financial markets, the diverse ecologies formed by living organisms are few examples. Each situation is highly organized and distinctive, but extremely complex. So why, if the basic laws are simple, is the world so complicated? The idea of Self Organized Criticality was born aiming to give an explanation for this ubiquitous complexity [jensen]. In this chapter the basic concepts related to SOC, that will be important for this thesis, are introduced.

The examples, cited above, share a common feature: a power-law tail of the correlations. Consider the two point correlation of a quantity Δh(𝐱)=h(𝐱)h¯\Delta h\left(\mathbf{x}\right)=h\left(\mathbf{x}\right)-\bar{h}, where h(𝐱)h\left(\mathbf{x}\right) is the height at a place 𝐱\mathbf{x} in a mountain range, and h¯\bar{h} is its average value. The function Δh(𝐱+𝐫)Δh(𝐱)\langle\Delta h(\mathbf{x+r})\Delta h(\mathbf{x})\rangle increases as rδr^{\delta}, with the exponent δ\delta varying very little for different mountain ranges. Similar distribution with extended tails is observed in many other natural phenomena: Gutenberg-Richter law in earth quake [gutenberg], Levy distribution in stock market price variations [levy], Hacks law in River networks [hackslaw1, hackslaw2] etc. Such power-law distributions entail scale invariance — there are no macroscopic spatial scales other than the system size, in terms of which one can describe the system, making it complex.

Such features are familiar to physicist in equilibrium systems undergoing phase transition. In standard critical phenomena there are control parameters such as temperatures, magnetic field, which requires to be fine tuned by an external agent, to reach the critical point. This is unlikely to happen in naturally occurring processes such as formation of mountain ranges, earth quakes or even stock markets. These are non-equilibrium systems brought to their present states, by their intrinsic dynamics — and not by a delicate selection of temperature, pressure or similar control parameters. 111Per Bak, in his book [blind], puts this in an interesting comment—“The nature is operated by a ’blind watchmaker’ who is unable to make continuous fine adjustments”.

In the summer of 1987, Bak, Tang and Wiesenfeld(BTW) published a paper [btw] proposing an explanation to such ubiquitous scale invariance. They argued that the dynamic which gives rise to the robust power-law correlations seen in the non-equilibrium steady states in nature must not involve any fine tuning of parameters. It must be such that the systems under their natural evolution are driven to a state at the boundary between the stable and unstable states. Such a state then shows long range spatio-temporal fluctuations similar to those in equilibrium critical phenomena. The complex features appear spontaneously due to a cooperative behavior between the components of the system. They called this self-organized criticality as the system self-organizes to its critical steady state.

SOC nicely compliments the idea of chaos. In the latter, dynamical systems with a few degrees of freedom, say as little as three, can display extremely complicated behavior. However, a statistical description of this randomness is predictable in the sense that, the signals have a white noise spectrum, and not a power law tail. A Chaotic system has little memory of the past, and it is easy to give a statistical description of such behavior. In short, chaos does not explain complexity. On the other hand, in SOC, generally, we start with systems of many degrees of freedom, and find a few general features which are also statistically predictable, but has a power-law spectra leading to complex behavior. In certain dynamical systems, e.g., logistic maps, there are points (the Feigenbaum point [chaos]) in the parameter space, which separates states with a predictable periodic behavior and chaos. At this transition point there is complex behavior, with power-law correlations. SOC gives description of how systems, under their own dynamics, without external monitoring, reaches this very special point (“edge of chaos”), explaining the robust complex behavior in natural systems.

In the book “How nature works?”, Per Bak gives various kinds of natural examples of SOC, of which the canonical one is the sandpile. On slowly adding grains of sand to an empty table, a pile will grow until its slope becomes critical and avalanches start spilling over the sides. If the slope is too small, each grain just stays at the place where it lands or creates a small avalanche. One can understand the motion of each grain in terms the local properties, like place, the neighborhood around it etc. As the process continues, the slope of the pile become steeper and steeper. If the slope becomes too large, a large catastrophic avalanche is likely, and the slope will reduce. Eventually, the slope reaches a critical value where there are avalanches of all sizes. At this point, the system is far out of balance, and its behavior can no longer be understood in terms of the behavior of localized events. The system is invariably driven towards its critical state.

3.2  Theoretical models

In order to have a mathematical formulation of SOC, BTW studied a so-called cellular automata known as the sandpile model [btw], which is discrete in space, time and in its dynamical variables. The model is defined on a two dimensional square lattice where each site ii has a state variable ziz_{i} referred as height, which takes only positive integer values. This integer can be thought of as representing the amount of sand at that location or in another sense it represents the slope of the sandpile at that point. Neither of these analogies is fully accurate, the model has aspects of both. One should consider it as a mathematical model of SOC, rather than an accurate model of physical sand.

A set of local dynamical rules defines the evolution of the model: At each time step a site is picked randomly, and its height ziz_{i} is increased by unity. In this thesis, this step will be referred as the driving. If the height now is greater than or equal to a threshold value zc=4z_{c}=4, the site is said to be unstable. It relaxes by toppling whereby four sand grains leave the site, and each of the four neighboring sites gets one grain. If there are any unstable sites remaining, they too are toppled, all in parallel. In case of toppling at a site at the boundary of the lattice, grains falling outside the lattice are removed from the system. This process continues until all sites are stable. This completes one time step. Then, another site is picked randomly, its height is increased by 11, and so on.

The following example illustrates the dynamics. Let the lattice size be 3×33\times 3 and suppose at some time step the following configuration is reached where all sites are stable.

2 3 2
3 3 0
1 2 3

We now add a grain of sand at randomly selected site: let us say the central site is chosen. Then the configuration becomes the following

2 3 2
3 4 0
1 2 3

The central site is not stable, and therefore it will topple and the configuration becomes

401133.\begin{tabular}[]{|c|c|c|}\hline\cr 2&{\color[rgb]{1,0,0}4}&2\\ \hline\cr{\color[rgb]{1,0,0}4}&0&1\\ \hline\cr 1&3&3\\ \hline\cr\end{tabular}.
242

This configuration has two unstable sites, so both will topple in parallel. Since these are at the boundary, two grains will be lost, on toppling. The new result is

021233,\begin{tabular}[]{|c|c|c|}\hline\cr{\color[rgb]{1,0,0}4}&0&3\\ \hline\cr 0&2&1\\ \hline\cr 2&3&3\\ \hline\cr\end{tabular},
403

and further toppling leads to

0 1 3
1 2 1
2 3 3

This is a configuration with all sites stable. One speaks in this case of an avalanche of size s=4s=4, since there are four topplings. Another measure is the number of steps required for relaxation, which in this case is t=3t=3. For large lattices, in the steady state, the distribution of avalanche sizes and durations display a long power-law tail, with an eventual cutoff determined by the finite size of the system.

Since the original sandpile model by BTW a large number of variations of the model have been studied (see [dharphysica06, jensen] for reviews). These are mostly extended systems with many components, which under steady drive reaches a steady state where there are irregular burst like relaxations and long ranged spatio temporal correlations. It is to be noted that in these models the complexity is not contained in the evolution rules itself, but rather emerges as a result of the repeated local interactions among different variables in the extended system.

In the rest of this chapter, I will introduce three of the most studied models of sandpile and the techniques used to analyze them.

3.2.1 Deterministic abelian Sandpile Model (DASM)

This is the most studied model due to it analytical tractability. In a series of papers, Deepak Dhar and his collaborators have shown that this model has some remarkable mathematical properties. In particular, the critical state of the system has been well characterized in terms of an abelian group. In the following I will generally follow the discussion in [dharphysica06].

The model is a generalized BTW model on any general graph with NN sites labeled by integers 1,2,3N1,2,3\cdots N. To make things precise, I will start with some definitions. A configuration CC for the sandpile model is specified by a set of integer heights {zi}\left\{z_{i}\right\} defined on the NN sites of the graph. We denote a threshold value of the height at a site ii as zicz_{i}^{c}. The system is driven like the BTW model by adding one sand grain at a randomly chosen site which increases the height at that site by 11. The toppling rules are specifies by a N×NN\times N toppling matrix Δ\Delta such that on toppling at site ii, heights at all sites are updated according to the rule:

zjzjΔi,jforeveryj.z_{j}\rightarrow z_{j}-\Delta_{i,j}\rm{~~for~~every~}j. (3.1)

For example in the BTW model on a square lattice

Δi,j={4for i=j1for i,j nearest neighbors0otherwise\Delta_{i,j}=\left\{\begin{array}[]{rl}4&\mbox{for $i=j$}\\ -1&\mbox{for $i,j$ nearest neighbors}\\ 0&\mbox{otherwise}\end{array}\right. (3.2)

Evidently the matrix Δ\Delta has to satisfy some conditions to ensure that the model is well behaved. These are

  • 1.

    Δi,i>0\Delta_{i,i}>0, for all ii. (Height decreases at the toppled site)

  • 2.

    Δi,j0\Delta_{i,j}\leq 0, for all jij\neq i. (Heights at other sites are increased or unchanged)

  • 3.

    jΔi,j0\sum_{j}\Delta_{i,j}\geq 0 for all ii. (Sand is not generated in toppling)

  • 4.

    Each site is connected through toppling events to at least one site where sand can be lost, such as the boundary.

Without loss of generality we choose zic=Δi,iz_{i}^{c}=\Delta_{i,i} (This only amounts to defining the reference level for the height variables).

With this convention, if all ziz_{i} are initially non-negative they will remain so, and we restrict ourself to configurations CC belonging to that space, denoted by Ω\Omega. Let 𝕊\mathbb{S} be the space of stable configurations denoted by CsC_{s} where the height variables at each site are below threshold. The property 44 above ensures that stability will always be achieved in a finite time.

We formalize the addition of sand to a stable configuration by defining an “addition operator” aia_{i} so that aiCsa_{i}C_{s} is the new stable configuration obtained by taking zizi+1z_{i}\rightarrow z_{i}+1 and then relaxing.

The mathematical treatment of ASM relies on one simple property it possesses: The order in which the operations of particle addition and site toppling are performed does not matter. Thus the operators aia_{i} commute i.e.

aiajCs=ajaiCs for every i,j and Cs.a_{i}a_{j}C_{s}=a_{j}a_{i}C_{s}\mbox{~ ~ for every $i,j$ and $C_{s}$}. (3.3)

The proof uses the linearity of the toppling processes [dharphysica06]. In the relaxation processes represented by the two sides of the above equation, the order of topplings can be changed, but the final configurations are equal. An example of this abelian nature is the process of long addition of multi-digit numbers. In this example the toppling process is like carrying.

Note that, there are some “garden of Eden” configurations that once exited can not be reached again. For example, in the BTW model on square lattice, system can never reach a state with two adjacent zi=0z_{i}=0. This is because in trying to topple a site to zero, the neighbor gains a grain, and vice versa. This leads to the definition of the recurrent state space \mathcal{R} which consists of any stable configuration that can be achieved by adding sand to some other recurrent configuration. This set is not empty since one can always reach a minimally stable configuration defined by having all zi=zc1z_{i}=z_{c}-1.

Dhar proved [dharprl] another remarkable property that the addition operators aia_{i} have unique inverses when restricted to the recurrent space; that is, there exists a unique operator ai1a_{i}^{-1} such that ai(ai1Cs)=Csa_{i}\left(a_{i}^{-1}C_{s}\right)=C_{s} for all CsC_{s} in \mathcal{R}. This can be easily seen from the fact that there are finite number of configurations in \mathcal{R}, so for some positive period pp, aipCs=Csa_{i}^{p}C_{s}=C_{s} with CsC_{s} a recurrent configuration. Using the abelian property it can be shown that the period pp is same for all CsC_{s}\in\mathcal{R}. Then aip1a_{i}^{p-1} is the inverse for aia_{i}.

These properties of aia_{i} have some interesting consequences [dharprl]. One is that in the steady state all the recurrent configurations are equally probable. Also, the number of recurrent states is simply the determinant of the toppling matrix Δ\Delta. For large square lattices of NN sites this determinant can be found easily by Fourier transform. In particular, whereas there are 4N4^{N} stable states, there are only (3.2102)N\left(3.2102\cdots\right)^{N} recurrent states. Thus starting from an arbitrary state and slowly adding sand, the system self-organizes to an exponentially small subset of states, which are the attractor of this dynamics.

There are many more interesting properties of the DASM, e.g., using a burning algorithm [burning], it is possible to test whether an arbitrary configuration is recurrent. Using this algorithm it can also be shown that the model is related to statistics of spanning-trees on the lattice, as well as with the q0q\rightarrow 0 limit of the Potts model [burning, dharphysica06]. As several results are known about spanning tree these equivalence help in relating properties of DASM to known properties of spanning trees.

In spite of these interesting mathematical properties, the exponents characterizing the power-law tail in the distribution of avalanches are still difficult to determine analytically on most lattices, and computer simulations are still needed. In fact, on a square lattice, the numerical values estimated by different people have shown a wide range of values. It has been argued that the simple finite size scaling does not work for the avalanche distribution and instead it has a multi-fractal character [kadanoff]. In some simpler quasi-one dimensional lattices it has been shown that simple linear combination of two scaling forms provides an adequate description [ali].

For higher dimensional lattices it has been shown by Priezzhev that the upper critical dimension for the models is 44 [ucd]. For lattices of dimension above 44, the avalanche exponents take mean field values and can be deduced from the exact solution of the model on a Bethe lattice [bethe].

3.2.2 Zhang model

The Zhang model, introduced by Zhang in 1989, differs from the DASM in two aspects: first, the height variables ziz_{i} are continuous and takes non-negative real values. A site is unstable if its height is above threshold, and it topples by equally dividing its entire content among its nearest neighbors, and itself becoming empty. Second, the external perturbation is not by adding height 11, but by a quantum chosen randomly from an interval [a,b)\left[a,b\right), where 0a<b0\leq a<b are positive real numbers.

Here, is an example of the Zhang model in one dimension. Let the threshold height is zic=1.5z_{i}^{c}=1.5, same for all ii, and an initial configuration is

0.8 1.4 0

Now a time step begins by an addition to a random site, of a random amount chosen from the interval [0,1.5)\left[0,1.5\right). Let the amount is 1.01.0 and the site is the central site. After addition the result is

0.8 2.4 0

Because the middle site is unstable, an avalanche starts:

2.001.201.01.2\begin{tabular}[]{|c|c|c|}\hline\cr 2.0&0&1.2\\ \hline\cr\end{tabular}\rightarrow\begin{tabular}[]{|c|c|c|}\hline\cr 0&1.0&1.2\\ \hline\cr\end{tabular}

In case of two or more unstable sites, all are toppled in parallel.

Since the addition amount is random, a stable site could in principle have any height between zero and the threshold and the stationary distribution could be very different from that of the DASM, where only discrete values are encountered. Nevertheless, when one simulates the model on large lattices in one and two dimensions, the stationary heights tend to concentrate around nonrandom discrete values. This is known as the “emergence of quasi-units” [zhang]. It appears that altering the local toppling rules of the DASM, does not have that much effect on the global behavior after all, if the lattice size is large.

This behavior led to the conjecture that in the thermodynamic limit the critical behavior is identical to that of DASM. However, due to the changed toppling rules, the dynamics is no longer abelian, and determining the steady state is quite difficult, even in one-dimension. In fact, Blanchard et. al. have shown that the probability distribution of heights in the steady state, even for the two site problem, has a multi-fractal character [blanchard].

This status was unchanged for over a decade until Fey et. al. showed that on a one-dimensional lattice, for some specific choice of the amount of addition, the toppling becomes abelian. Using this they showed that, indeed, the model is on the same universality class of the DASM. However, the analysis in two dimension is still an open problem.

3.2.3 Manna model

Another important class of the sandpile models are with stochastic toppling rules. The first model of its kind was studied by Manna in 1991, and is known as the Manna model [manna].

The evolution rules of this sandpile in dd-dimensions are very similar to the ones defined for the DASM. In fact, the driving rule and the dissipation rules at the “boundary” remain the same. But in a toppling, an unstable site redistributes all the sand grains between sites randomly chosen amongst its 2d2d nearest neighbors.

zi\displaystyle z_{i} \displaystyle\rightarrow 0\displaystyle 0
zj\displaystyle z_{j} \displaystyle\rightarrow zj+1 for zi sites chosen randomly amongst n.n. of i.\displaystyle z_{j}+1\mbox{~ ~ for $z_{i}$ sites chosen randomly amongst n.n. of $i$.}

The randomness in the evolution rule is a relevant change in the dynamics, which makes it non-abelian. It is possible to get back the abelianness by a simple modification in the toppling rule, which I will discuss in detail in the later chapters. However, the addition operators defined appropriately do not form a group anymore and this makes the analysis less tractable even for a linear chain.

The steady state is very different from its deterministic counter part e.g. on a simple linear chain the different recurrent states are not equally probable, unlike the deterministic model. Also the avalanche distribution can be satisfactorily described by simple finite size scaling. Another evidence of the differences between these models is in the way the avalanches spread over the lattice [milshtein]. The distribution of number of toppling per site in a typical avalanche for both DASM and Manna model on a square lattice are shown in Fig. 3.1. For the DASM, one can see a shell structure in which all sites that toppled TT times form a connected cluster with no holes, and these sites are contained in the cluster of sites that toppled T1T-1 times, and so on. On the other hand, the toppling distribution exhibits a random avalanche structure with many peaks and holes.

Refer to caption
Refer to caption
Figure 3.1: Number of toppling per site for a typical avalanche in (a) DASM and (b) Manna model. The darker shades denote more topplings. (Courtesy [milshtein])

For many years, the universality of the manna model was a controversial question. At present there are convincing numerical evidences that in dimension up to 33, they have a different critical behavior, from its deterministic counterpart, with a different set of critical exponents. However in dimensions d4d\geq 4, both DASM and Manna model take the same mean-field values of critical exponents.

3.3  Universality in the sandpile models.

Since the work by BTW, a large number of different models have been studied e.g. sandpile models with many variations of the BTW toppling matrix [kadanoff] or sand grain distribution rules [maslov], stochastic topplings [manna], with activity inhibition [manna2], continuous height models [zhang], loop erased random walk [loop], Takayasu aggregation model [takayasu], train model [train1, train2], non-abelian sandpile directed sandpile model [lee, pan, threshold, pruessner], forest-fire model [forest], Olami-Feder-Christensen model [ofc] etc (and many more could have been defined). Most of these models could only be studied numerically, and for a while it seemed that each new variation studied belong to a new universality class each with its own set of critical exponents. It is a fair question to ask, what is the generic behavior?

Although this question is not yet resolved completely, by now, there has been a fair amount of understanding of this problem. The universality classes with renormalization group flow in these models can be summarized in the Fig. 3.2.

Refer to caption
Figure 3.2: A schematic flow diagram of renormalization group flows between different fixed points of sandpile models.

There are sufficient numerical evidence that sandpile models with deterministic toppling rules (DASM) and stochastic toppling rules (Manna model) constitute different universality classes. There are also several other model which show critical exponents different from these two [sneppen1, sneppen2, grass]. They are related to the directed percolation (DP) [dp], which describes the active-absorbing state phase transition in a wide class of reaction-diffusion systems. The activity in avalanches in sandpile can grow, diffuse or die, and any stable configuration is an absorbing state. Thus one would expect that in general the sandpile should belong to the universality class of active-absorbing state transition with many absorbing states [path]. However, these models do not involve any conserved fields. In Manna and DASM-type models, it is this presence of conservation laws of sand that makes the critical behavior different from DP [vespignani].

Recently, the effect of non-conservation has been explicitly studied [mohanty1, mohanty2] by introducing stickiness in the toppling rules (i.e. there is small probability that the incoming particles to a site get stuck there, and do not cause any toppling until the next avalanche hits the site, thus in effect there is no conservation of grains within an avalanche). It has been argued that as long as the sand grains have non-zero stickiness, the distribution of avalanche sizes follows directed percolation exponents. The DASM, and the stochastic Manna-type models are unstable to this perturbation, and the renormalization group flows are directed away from them to the directed percolation fixed point, as schematically shown in the figure. This picture is exactly verified in directed sandpiles. However, the argument is less convincing for undirected models, and the issues is not settled [bonachela2].

3.4  Experimental models of SOC

Soon after the sandpile model was introduced, several experimental groups measured the size distribution of avalanches in granular materials. Unfortunately, real sandpile do not seem to behave as the the theoretical models. Experiments show large periodic avalanches separated by quiescent states with only limited activity. While for small piles one could try to fit the avalanche distribution with power-law over a limited range, the behavior would eventually cross over, on increasing the system size, to a state which is not scale-invariant [sandexpt1, sandexpt2]. It is later realized that inertia of rolling grains is the reason for non-criticality. A large avalanche propagating over a surface with slope θc\theta_{c} scours the surface, and takes away materials from it. The final angle, after the avalanche has stopped, is bellow θc\theta_{c}. So if we want to see power-law avalanches, we have to minimize the effect of inertia of the grains. This is achieved in an experiment in Oslo by using rice grains. Because of the elongated shape of the rice grains (Fig. 3.3) frictional forces are stronger and these poured at very small rate gave rise to a convincing power-law avalanche distribution [osloexpt].

Refer to caption
Figure 3.3: A schematic of a rice-pile. The elongated shapes of the rice grains reduces the inertial effect in an avalanche. (Courtesy K. Christensen.)

A similar power law distribution of avalanche sizes are obtained in motion of domain walls in ferro-magnets [feromag1, feromag2] and flux lines in type II superconductors [sup1, sup2]. A more recent experimental realization of SOC is obtained in suspensions of sedimenting non-brownian particles by slow periodic shear [corte].

It is worth mentioning that SOC has been invoked in several other situations in geophysics (atmospheric precipitation [presp], river pattern due to erosion [erotion], landslides [land]), biology (neural-network [nunet]), economics (stock-market crashes [smcr]) and many more. I have deliberately chosen the above experimental examples for which experimental observations are accurate and reproducible.

3.5  Remarks

Originally, SOC was proposed with the aim of providing an explanation of the ubiquitous complexity in nature [btw]. The abundance of fractal structures in nature, temporal as well as spatial, was considered to be an effect of a generic tendency — pertinent to most many-body systems — to develop by themselves in to a critical scale-invariant state.

However, certainly not all systems that organize themselves into one specific state will, when gently driven, exhibit scale invariance in that self-organized state. The experiments of real sandpiles referred earlier are a prime example. Neither is all observed power law behavior are an effect of dynamical self-organization into a critical state. The work by Sethna and co-workers on Barkhausen noise [sethna] is an interesting example of this, what Didier Sornette has called “Power laws by sweeping of an instability” [sornet].

Since the introduction of the idea, a large amount of discussion went into understanding the minimum conditions for a model to be self-organized critical. Though a broad picture has emerged in last two decades, it is still not complete and controversial. In the rest of this section, I will discuss two of the most discussed properties, using both examples and counter examples.

  • Slow driving limit. There is a strong belief in the community that an essential ingredient of SOC is slow driving (driving and dynamics operating at two infinitely separated timescales, i.e. avalanches are instantaneous relative to the time scale of driving). This idea got widely accepted after an argument given by Dickman et. al..[path] They argued that the dynamics in the sandpile model implicitly involve tuning of the density of grains to a value where a phase transition takes place between an active state, where topplings take place, and a quiescent “absorbing” state. When the system is quiescent, addition of new particles increases the density. When the system is active, particles are lost to the sinks via toppling, decreasing the density. The slow driving ensures that these two density changing mechanisms balance one another out, driving the system to the threshold of instability.

    However in the Takayasu model of aggregation [takayasu] the driving is fast. A simple example, it can be defined on a linear chain on which particles are continuously injected, diffuse and coalesce. One can write the explicite rules as follows:

    • At each time step, each particle in the system moves by a single step, to the left or to the right, taken with equal probability, independent of the choice at other sites.

    • A single particle is added at every site at each time step.

    • If there are more than one particle at one site, they coalesce and become a single particle whose mass is the sum of the masses of the coalescing parts. In all subsequent events, the composite particles acts as a single particle.

    The probability distribution of total mass at a randomly chosen site, has power law tail, with an upper cutoff that increases with time. This is a signature of criticality. The analogue of avalanches in this model is the event of coming together of large masses. In fact, it can be shown [dharphysica06] that the model is equivalent to a directed version of sandpile. In this example, it is clear that the driving is fast, and the rate is comparable to the local movements of the particles.

  • Conservation. Conservation of grains is also considered as a key property for the criticality to emerge in sandpile models. A simple intuitive argument goes as follows: the sand grains introduced in the pile can dissipate only by reaching the diffusive “boundary” of the lattice. Owing to this and because of the vanishing rate of sand addition, arbitrarily large avalanches (of all possible sizes) must exist for an arbitrarily large system size, yielding a power-law size distribution. In contrast, in the presence of non-vanishing bulk dissipation, grains disappear at some finite rate, and avalanches stop after some characteristic size determined by the dissipation rate. This clearly says that bulk dissipation is a relevant perturbation in the sandpile dynamics and breaks the criticality [bonachela1].

    There are also some other models of SOC like Forest fire [forest], OFC model [ofc] where it was shown, mostly numerically, that non-conservation in the dynamics leads to non-critical steady state.

    However, extrapolating these results and considering conservation as a neccesarry criteria for SOC, in general, is not correct. A model which is clearly non-conservative and still, when slowly driven displays power-law in the avalanche size distribution is discussed in [ice]. Another two non-conservative models of SOC are a sandpile model with threshold dissipation[thresdis], and Bak-Sneppen model of evolution [sneppen2].

Finally, one could ask: Has SOC, taught us anything about the world that we did not know prior to it? Jensen addresses this question very nicely in his book. The most important lesson is that, in a great variety of systems, particularly for slowly-driven-interaction- dominated-threshold systems, it is misleading to neglect fluctuations. In these systems, sometimes, the fluctuations are so large that the fate of a major part of the system can be determined by a single burst of activity. Dinosaurs may have become extinct simply as a result of an intrinsic fluctuation in a system consisting of a highly interconnected and interacting web of species; there may be no need for an explanation in terms of external bombardment by meteorites. Fluctuations are so large that the "atypical" events decides the future of the system. This new insight is sufficiently important to justify and inspire more theoretical, and experimental research in SOC.

3.6  Overview of the later chapters

The work in this thesis ranges from characterizing the spatial patterns in sandpile model, to quasi-units in the stationary distribution of Zhang’s model, and determining exact steady state of Manna model. The first three chapters in the following are about sandpile as a growth model, where we show how well-structured non-trivial patterns emerge at large length scales, due to local interactions in cellular lengths where the patterns are not obvious. In chapter 7 we discuss another emergent behavior in the Zhang model. Chapter 8 contains an operator algebraic analysis of the stochastic sandpile models. Here is a brief summary of these chapters.

  • Chapter 4: While a considerable amount of research went into characterizing the universality classes of sandpile models and understanding the mechanism of SOC, very limited work is done about spatial patterns in sandpile models. Such patterns were noted around the time when sandpile was first introduced [liu]. Yet, very little is known about them.

    This chapter is devoted to the study of a class of such spatial patterns produced by adding sand at a single site on an infinite lattice with initial periodic distribution of grains and then relaxing using the DASM toppling rules. We present a complete quantitative characterization of one such patterns. We show that the spatial distances in the asymptotic (in the limit when large number of grains are added) patterns produced by adding a large number of grains, can be expressed in terms solution of discrete Laplace’s equation (discrete holomorphic functions [duffin, mercat, laszlo]) on a grid on two-sheeted Riemann surface.

    We also discuss the importance of these patterns as a paradigmatic model of growth where different parts of the structure grow in proportion to each other, keeping their shape the same. We call these kind of growth as proportionate growth. We discuss the importance of such growth in real world examples.

  • Chapter 5: In this chapter we describe how the pattern changes in presence of absorbing sites, reaching which the grains get lost and no longer participate in the avalanches. We show that, again, the asymptotic pattern can be characterized in terms of discrete holomorphic functions, but on a different lattice. Similar effects of multiple sites of addition on the pattern are also calculated.

    The most interesting effect of the sink sites is the change in the rate of growth of the pattern. In absence of sink sites the diameter of the pattern, suitably defined, increases as N\sqrt{N} where NN is the number of sand grains added in the lattice. When the pattern grows with the sink sites inside, the growth rate of the diameter changes, in general, to NαN^{\alpha}, where the exponent α\alpha depends on the sink geometries. For example, α=1/3\alpha=1/3, when the sink sites are along an infinite line adjacent to the site where grains are dropped. When the site of addition is inside a wedge of angle π/2\pi/2 with the sink sites along the wedge boundary, this value of the exponent is 1/41/4. We use an scaling argument and determine α\alpha, for some simple sink-geometries.

  • Chapter 6: The growth rate also depends on the arrangement of heights in the background, and this dependence is quite intriguing. When the initial heights are low enough at all sites, one gets patterns with α=1/d\alpha={1/d}, in dd-dimension. If sites with maximum stable height (zc1)\left(z^{c}-1\right) in the starting configuration form an infinite cluster, we get avalanches that do not stop, and the model is not well-defined. In this chapter, we study backgrounds in two dimensions. We describe our unexpected finding of an interesting class of backgrounds, that show an intermediate behavior: For any NN, the avalanches are finite, but the diameter of the pattern increases as NαN^{\alpha}, for large NN, with 1/2<α11/2<\alpha\leq 1, the exact value of α\alpha depending on the background. It still shows proportionate growth. We characterize the asymptotic pattern exactly for one illustrative example.

  • Chapter 7: As mentioned, the Zhang model on one and two dimensional lattices displays a remarkable property: emergence of quasi-units, where the continuous heights, in spite of the randomness in the driving, are peaked around a few discrete non-random values. Fey et. al have shown that on a linear chain the width of the distribution vanishes in the infinite volume limit. However they did not show how it approaches zero.

    In this chapter, we show that, the sequence of toppling of the continuous height variables, when suitably discretized, have an one-to-one relation with that of integer heights in the corresponding DASM. We use this relation to show that the width of the distribution of heights decreases in inverse power of the length of the chain. We also determine how the variance of height at a site, changes with position of the site along the length of the system.

  • Chapter 8: This chapter contains an algebraic approach of determining the steady state of a class of sandpile models with stochastic toppling rules. The original Manna model, as discussed in section 1.2.3, does not have the abelian property of its deterministic counterpart. However, a simple modification of the toppling rules makes the model abelian [dm]. A similar construction is possible for other stochastic toppling rules. However, analysis of these models are still difficult as the corresponding addition operators (see section 3.2.1), in general, does not have an inverse, and are not diagonalizable.

    We show that, in principle, the operators can be reduced to a Jordan block form, using the algebra satisfied by these. These are then used to determine the steady state of the models. We illustrate this procedure by explicitly determining the numerically exact steady for a stochastic model on a linear chain. Using the desktop computers at our disposal, we have been able to perform the calculation for systems of size 12\leq 12 and also studied the density profile in the steady state.

Chapter 4 Pattern formation on growing sandpiles

Based on the paper [myepl] by Deepak Dhar, Tridib Sadhu and Samarth Chandra.

  • Abstract

    Adding grains at a single site on a flat substrate in the abelian sandpile models produces beautiful complex patterns. We study in detail the pattern produced by adding grains on a two-dimensional square lattice with directed edges (each site has two arrows directed inward and two outward), starting with a periodic background with half the sites occupied. The model shows proportionate growth and the size of the pattern formed by adding NN grains scales as N\sqrt{N}. We give exact characterization of the asymptotic pattern, in terms of the position and shape of different features in the pattern.

4.1  Introduction

As discussed in details in chapter 3, the sandpile models were introduced in physics in the context of self-organized criticality, where the main interest has been the power-law tail in the distribution of avalanche sizes [btw]. In this chapter our interest is different. We study the pattern produced by adding large number of sand grains at a single site in a two dimensional DASM starting from a periodic background, and allowing the system to relax using the sandpile toppling rule (See chapter 1). For example, consider the ASM on an infinite square lattice with initial heights zi=2z_{i}=2, for all sites, and add large NN number of grains at the origin. The distribution of heights ziz_{i} in the relaxed configuration, produces a very beautiful, but complex pattern (Fig. 4.1) 111A natural sandpile, formed by pouring sand grains at a constant rate on a flat table with boundaries, gives rise to singular structures like ridges, in the stationary state. This has been attracted much attention recently [hadeler, falcone]. In this chapter, we give a detailed quantitative characterization of similar patterns produced on two directed lattices, starting from a simple periodic background.

Refer to caption
Figure 4.1: A stable configuration for the abelian sandpile model, obtained by adding 5×1045\times 10^{4} sand grains at one site, on a square lattice, and relaxing. Initial configuration with all heights 22. Color code: blue=0, green=1, red=2, yellow=3. (Details can be seen in the electronic version using zoom in.)
Refer to caption
Refer to caption
Figure 4.2: The proportionate growth of the pattern for DASM, obtained by adding NN grains at one site on a square lattice. Initial configuration is with all heights 22. The two patterns correspond to N=104N=10^{4} and 5×1045\times 10^{4}, respectively. Color code same as in the Fig. 4.1. Both patterns are on the same scale. (Details can be seen in the electric version using zoom in).

These patterns are examples of complex patterns obtained from simple deterministic evolution rules, and are also analytically tractable. Here complexity means that we have structures with variations, and a complete description of which is long. Thus, a living organism is complex because it has many different working parts, each formed by variations in the working out of the same, but relatively much simpler genetic coding. There are some earlier known theoretical examples of complex patterns obtained from local deterministic evolution rules. Most studied among them are the Conway’s game of life [earlierone], which is a cellular automata model with local update rules, and Turing patterns [earliertwo], which are reaction-diffusion models. In general, a detailed and exact mathematical characterization of such patterns has not been possible so far. In this aspect the sandpile patterns are important as they are analytically tractable. Understanding these should also help in studying the more general problem. The most important aspect of these patterns is that, these are the simplest examples that show nontrivial spatial features with proportionate growth (see Fig. 4.2), where these features grows in proportion, keeping the overall shape same. Examples of proportionate growth are abundant in the animal kingdom, where a young animal, typically, grows in size with time, with different parts of the body growing roughly at the same rate. Obviously, this kind of growth requires some coordination and communication between different parts. While there are many models of growing objects studied in physics literature so far, e.g. the Eden model, Diffusion-Limited Aggregation (DLA), invasion-percolation etc. [herrmann], none has this property. All of these are mainly models of aggregation, where growth occurs by accretion on the surface of the object, and inner parts do not evolve significantly (Fig. 4.3). It is worth mentioning, that modelling proportionate growth with simple structures is easy, e. g., growth of a water droplet as one injects more water into it. However, generating a complex pattern with large number of structures inside, all growing at same rate, maintaining their relative shape, is highly nontrivial. This is what happens in the patterns produced in the sandpile models.

Refer to caption
Figure 4.3: Growth in a DLA occurs by accretion of particles, doing random walk, and attaching to the cluster connected to the origin, when it comes close to it.

Also, there is an astonishing qualitative similarity between the formation of these patterns and the way a fertilized egg develops into a well structured multicellular organism. The development starts with a single cell which divides into more cells, and then they divide in turn. At some stage of the development, few cells generate newer types of cells and form organs. This process continues and after a long time it forms a large complex, but highly coordinated cellular assembly. The same genetic code in each cell is responsible for the cell differentiation and structure formation. In the abelian sandpile when the sand grains are added at the same site, the grains redistribute themselves and a pattern emerges around the addition site, which grows as more and more sands are added. The same redistribution rule is used for all sites, and yet the pattern has large visibly distinguishable structures inside, which, one can think of as different organs in an animal. This simple mathematical model of growing sandpile captures these qualitative features, even though the actual mechanism of growth is much more complicated in the biological world.

Refer to caption
Figure 4.4: The directed square lattices studied in this chapter: (a)(a) the F-lattice, (b)(b) the Manhattan lattice.

The spatial patterns in sandpile models were first discussed by Liu et al. [liu]. The asymptotic shape of the boundaries of the sandpile patterns produced by adding grains at a single site in different periodic backgrounds was discussed in [dhar99]. Borgne et al. [borgne] obtained bounds on the rate of growth of these boundaries and later these bounds were improved by Fey et al. [redig] and Levine et al. [lionel]. The first detailed analysis of different periodic structures found in the patterns were carried out by Ostojic in [ostojic]. Other spatial configurations in the abelian sandpile models, like the identity [borgne, identity, caracciolo] or the stable state produced from special unstable states, also show complex internal self-similar structures [liu], which share common features with the patterns studied here. In particular, the identity configuration on the F-lattice has recently been shown to have spatial structure similar to what we study here [caracciolo]. There are other models, which are related to the abelian sandpile model, e.g. the Internal Diffusion-Limited Aggregation (IDLA), Eulerian walkers (also called the rotor-router model), and the infinitely-divisible sandpile, which also show similar structure. For the IDLA, Gravner and Quastel showed that the asymptotic shape of the growth pattern is related to the classical Stefan problem in hydrodynamics, and determined the exact radius of the pattern with a single point source [gravner]. Levine and Peres have studied patterns with multiple sources in these models recently, and proved the existence of a limit shape[levine_peres].

Refer to caption
Figure 4.5: The stable configuration for the DASM, obtained by adding 5×1045\times 10^{4} particles at one site, on the F-lattice of Fig.4.4aa with initial checkerboard configuration. Color code: red=0, yellow=1. The apparent orange regions in the picture represent the patches with checkerboard configuration. (Details can be seen in the electronic version using zoom in.)

4.2  Definition of the model

The pattern on a standard square lattice is rather complicated (Fig.4.1), and it has not been possible to characterize it so far. In this chapter, we consider two variations of the square lattice, assigning orientations to its edges, such that each site has two inward and two outward arrows, as shown in Fig.4.4a and Fig.4.4b. They are known as F-lattice and Manhattan lattice, respectively.

We define a position vector on the lattice, 𝐑(x,y)\mathbf{R}\equiv\left(x,y\right). The DASM is defined on the lattice by a height variable z(𝐑)z\left(\mathbf{R}\right), at each site 𝐑\mathbf{R}. In a stable configuration all sites have height z(𝐑)<2z\left(\mathbf{R}\right)<2. The system is driven by adding grains at a single site and if this addition makes the system unstable it relaxes by the toppling rule: each unstable site transfers one grain each in the direction of its outward arrows. We start with an initial checkerboard configuration in which z(𝐑)=1z\left(\mathbf{R}\right)=1 for sites with (x+y)=(x+y)= even, and 0 otherwise. Clearly, the average density of sand grains for the initial configuration is 1/21/2 per site. For numerical purpose we use a lattice large enough so that none of the avalanches reaches the boundary. The result of adding N=5×104N=5\times 10^{4} grains at the origin is shown in Fig. 4.5 and Fig. 4.6, for the two lattices.

The asymptotic pattern in large NN limit, for the two lattices are indistinguishable from each other, at large scales, except that the thin lines of 11’s forming two triangles outside the octagon are rotated by 4545^{\circ} (Fig.4.6). Since the lattices are different, this is quite intriguing. Specially there is no obvious lattice symmetry, and it is easily checked that patterns produced for small NN are quite different (Fig.4.7).

This pattern is somewhat simpler than in Fig.4.1, which makes its study easier. We shall discuss here only the F-lattice, but the discussion is equally applicable to the Manhattan lattice. Taking some qualitative features of the observed pattern (e.g. only two types of patches are present, and they are all 33- or 44- sided polygons) as input, we show how one can get a complete and quantitative characterization of the pattern. We also show that the asymptotic pattern has an unexpected exact 88-fold rotational symmetry, and determine the exact coordinates of all the boundaries in it. We will also discuss some other cases, where exactly the same asymptotic pattern is obtained.

Refer to caption
Figure 4.6: A stable configuration for the DASM on the Manhattan lattice of Fig.4.4b, obtained by adding 25×10325\times 10^{3} particles at one site, with initial checkerboard configuration. Color code: red=0, yellow=1. (Details can be seen in the electronic version using zoom in.)
Refer to caption
Refer to caption
Figure 4.7: Very different stable configurations for the abelian sandpile model on (a)(a) the F-lattice, and (b)(b) the Manhattan lattice, obtained by adding only 2020 particles at one site, with initial checkerboard configuration. Color code: red=0=0, yellow=1=1.

4.3  Characterizing asymptotic pattern: A general theory

We first describe a general method of formally characterizing a large number of sandpile patterns, not just the three patterns shown till now. We start by defining 2Λ(N)2\Lambda\left(N\right) as the diameter of the pattern when NN grains have been added. The exact definition of Λ\Lambda is flexible, and the characterization does not depend on the choice. For the patterns in Fig. 4.1, 4.5, and 4.6 we choose 2Λ2\Lambda as the width of the smallest rectangle that encloses all sites that have toppled at least once.

As mentioned before, the patterns exhibit proportionate growth, i.e., all structures in the pattern grows at the same rate to the diameter. While there is as yet no rigorous proof of this important property, we assume this in the following discussion. Then, it is natural to describe the patterns in the reduced coordinates defined by ξ=x/Λ\xi=x/\Lambda and η=y/Λ\eta=y/\Lambda. A position vector in these reduced coordinates is defined by 𝐫=𝐑/Λ(ξ,η)\mathbf{r}=\mathbf{R}/\Lambda\equiv\left(\xi,\eta\right). Then in the limit Λ\Lambda\rightarrow\infty, the patterns can be characterized by a function ρ(𝐫)\rho(\mathbf{r}) which gives the local density of sand grains in a small rectangle of size δξδη\delta\xi\delta\eta about the point 𝐫\mathbf{r}, with 1/Λδξ1/\Lambda\ll\delta\xi, δη1\delta\eta\ll 1. We define Δρ(𝐫)\Delta\rho\left(\mathbf{r}\right) as the change in density ρ(𝐫)\rho\left(\mathbf{r}\right) from its initial background value.

A large number of sandpile patterns, including the one in Fig. 4.1, 4.5, and 4.6, are made of a union of distinct regions, called “Patches”, inside which the heights are periodic in space. Then, inside each patch Δρ(𝐫)\Delta\rho\left(\mathbf{r}\right) is constant. For example, in the pattern in Fig. 4.5, there are only two types of patches, and the change in density takes only two possible values, 1/21/2 in a high-density patch (color yellow in Fig. 4.5) and 0 in a low-density patch (color orange). There are few defect-lines, which move with NN, and can also be seen in Fig.4.1 and Fig.4.5. But these can be ignored in discussing the asymptotic pattern.

Let TΛ(𝐑)T_{\Lambda}\left(\mathbf{R}\right) be the number of topplings at site the 𝐑\mathbf{R} when the diameter reaches the value 2Λ2\Lambda for the first time. Define

ϕ(𝐫)=limΛ12Λ2TΛ(𝐑),\phi\left(\mathbf{r}\right)=\lim_{\Lambda\rightarrow\infty}\frac{1}{2\Lambda^{2}}T_{\Lambda}\left(\mathbf{R}^{\prime}\right), (4.1)

where 𝐑(Λξ,Λη)\mathbf{R}^{\prime}\equiv\left(\lfloor\Lambda\xi\rfloor,\lfloor\Lambda\eta\rfloor\right), with x\lfloor x\rfloor being the floor function which gives the largest integer x\leq x. From the conservation of sand-grains in the toppling process, it is easy to see that

𝐑n.n.TΛ(𝐑)αTΛ(𝐑)=Δz(𝐑)Nδ𝐑,0,\sum_{\mathbf{R^{\prime}}\in n.n.}T_{\Lambda}\left(\mathbf{R^{\prime}}\right)-\alpha T_{\Lambda}\left(\mathbf{R}\right)=\Delta z\left(\mathbf{R}\right)-N\delta_{\mathbf{R},0}, (4.2)

where the sum is over the sites nearest neighbors of 𝐑\mathbf{R}, and α\alpha is the number of them. Then in the rescales coordinate, ϕ\phi satisfies the Poisson equation

2ϕ(𝐫)=Δρ(𝐫)NΛ2δ(𝐫).\nabla^{2}\phi\left(\mathbf{r}\right)=\Delta\rho\left(\mathbf{r}\right)-\frac{N}{\Lambda^{2}}\delta\left(\mathbf{r}\right). (4.3)

In an electrostatic analogy, we can think of Δρ(𝐫)\Delta\rho(\mathbf{r}) as an areal charge density, and ϕ(𝐫)\phi(\mathbf{r}) as the corresponding electrostatic potential. A complete specification of ϕ(𝐫)\phi\left(\mathbf{r}\right) determines the density function Δρ(𝐫)\Delta\rho\left(\mathbf{r}\right) which in turn characterizes the asymptotic pattern.

The key observation that allows us to determine the asymptotic pattern is the following proposition.

Proposition 4.3.1

Inside each patch of periodic heights, ϕ(𝐫)\phi(\mathbf{r}) is a quadratic function of ξ\xi and η\eta.

A proof can be done in the following way. Within a patch, the function ϕ(𝐫)\phi(\mathbf{r}) is Taylor expandable around any point 𝐫O(ξo,ηO)\mathbf{r}_{O}\equiv\left(\xi_{o},\eta_{O}\right) inside the patch.

ϕ(𝐫)=f+dΔξ+eΔη+a(Δξ)2+2hΔξΔη+b(Δη)2+𝒪(Δξ3,Δη3),\phi\left(\mathbf{r}\right)=f+d\Delta\xi+e\Delta\eta+a\left(\Delta\xi\right)^{2}+2h\Delta\xi\Delta\eta+b\left(\Delta\eta\right)^{2}+\mathcal{O}\left(\Delta\xi^{3},\Delta\eta^{3}\right)\dots, (4.4)

where Δξ=ξξo\Delta\xi=\xi-\xi_{o} and Δη=ηηo\Delta\eta=\eta-\eta_{o}. Consider any term of order 3\geq 3 in the expansion, for example the term (Δξ)3\sim(\Delta\xi)^{3}. This can only arise due to a term (Δx)3/Λ\sim(\Delta x)^{3}/\Lambda in T(x,y)T(x,y). Then, considering the fact that T(𝐑)T\left(\mathbf{R}\right) is an integer function of the coordinates, it is easy to see that it will change discontinuously at intervals of Δx𝒪(Λ1/3)\Delta x\sim\mathcal{O}(\Lambda^{1/3}). This leads to change in the periodicity of heights at such intervals inside each patch which themselves are of size Λ\sim\Lambda. This would then result in an infinitely many defect-lines in the asymptotic pattern. However there are no such features in Fig.4.1 or Fig.4.5. Therefore inside each periodic patch of constant Δρ(𝐫)\Delta\rho(\mathbf{r}), ϕ(𝐫)\phi(\mathbf{r}) can at most be quadratic in ξ\xi and η\eta.

The argument finally boils down to proving the two features of the pattern, i.e., there is proportionate growth, and that the pattern can be decomposed in terms of periodic patches.    

In each periodic patch the toppling function T(x,y)T(x,y) is a sum of two terms: a part, that is a simple quadratic function of xx and yy, and another is a periodic part. The periodic part averages to zero, and does not contribute to the coarse-grained function ϕ(𝐫)\phi(\mathbf{r}) 222In some patterns, with other backgrounds (not discussed here) there are regions that occupy finite fraction area of the full pattern, which show aperiodic height patterns. These cases are harder to analyse.. The quadratic part, when rescaled, can be written as

ϕ(𝐫)=f+dξ+eη+aξ2+2hξη+bη2,\phi\left(\mathbf{r}\right)=f+d\xi+e\eta+a\xi^{2}+2h\xi\eta+b\eta^{2}, (4.5)

where a,h,b,d,e,fa,h,b,d,e,f are constants inside a patch, and a+b=Δρ/2a+b=\Delta\rho/2, corresponding to the patch. Then each patch is characterized by the values of these parameters.

Now we will show that the continuity of ϕ\phi and its first derivatives along the boundary between adjacent patches imposes linear relations among the corresponding parameters. Consider two neighboring periodic patches 𝐏{\bf P} and 𝐏{\bf P^{\prime}} with mean densities ρ\rho and ρ\rho^{\prime} respectively. Let the rescaled quadratic toppling function be Q(𝐫)Q(\mathbf{r}) and Q(𝐫)Q^{\prime}(\mathbf{r}) in these patches. Then the boundary between the patches is given by the equation Q(𝐫)=Q(𝐫)Q(\mathbf{r})=Q^{\prime}(\mathbf{r}). As the derivatives of ϕ\phi are also continuous across the boundary, the boundary between two periodic patches must be a straight line, and

Q(𝐫)=Q(𝐫)+12(ρρ)l2,Q^{\prime}(\mathbf{r})=Q(\mathbf{r})+\frac{1}{2}(\rho^{\prime}-\rho)l_{\perp}^{2}, (4.6)

where ll_{\perp} is the perpendicular distance of (𝐫)(\mathbf{r}) from the boundary. We can start with a periodic patch 𝐏{\bf P}, and go to another patch 𝐏{\bf P^{\prime}} by more than one path. Since the final quadratic function at 𝐏{\bf P^{\prime}} should be the same whichever path we take, this imposes consistency conditions which restrict the allowed values of slopes of the boundaries. Consider a point z0z_{0} where nn periodic patches meet, with n>2n>2 (Fig.4.8). If the jjth boundary at this point makes an angle θj\theta_{j} with the xx-axis, and the density of the patch in the wedge θjθθj+1\theta_{j}\leq\theta\leq\theta_{j+1} is ρj+1\rho_{j+1} (Fig.4.8), then the condition that the net change in the quadratic form is zero if we go around z0z_{0} once, reduces to the following condition:

j=1n(ρj+1ρj)e2iθj=0,\sum_{j=1}^{n}(\rho_{j+1}-\rho_{j})e^{2i\theta_{j}}=0, (4.7)

with ρn+1=ρ1\rho_{n+1}=\rho_{1}. For n=3n=3, with ρ1ρ2ρ3\rho_{1}\neq\rho_{2}\neq\rho_{3}, this equation has only trivial solutions with θj\theta_{j} equal to 0 or π\pi for all jj. Hence, only n4n\geq 4 are allowed.

Refer to caption
Figure 4.8: nn different periodic patches of density ρ1\rho_{1},...,ρn\rho_{n} meeting at point z0z_{0}.

These linear equations amongst the parameters corresponding to neighboring patches, can be solved and this will determine the complete potential function ϕ\phi, giving a quantitative characterization of the pattern.

4.4  Determination of the potential function

We now apply this method, in the last section, to the F-lattice pattern in Fig. 4.5, and determine the exact potential function ϕ(𝐫)\phi\left(\mathbf{r}\right). We note that in this pattern, there are no aperiodic patches, only two types of periodic patches, where ρ(𝐫)\rho(\mathbf{r}) only takes values 11 or 1/21/2. Also, the slopes of the boundaries between patches only take values 0, ±1\pm 1 or \infty. The patches are typically dart shaped quadrilaterals, and some triangles. These simplifications, not present in Fig.4.1, make possible a full characterization of the pattern in Fig.4.5.

We start by determining the exact asymptotic size of the pattern. We note from Fig.4.5 that the boundary of the pattern is an octagon (we shall prove later that this is a regular octagon). In fact, there are four lines of 11’s outside the octagon. But these have zero areal density in the limit NN\rightarrow\infty, and do not contribute to ρ(𝐫)\rho(\mathbf{r}). We will ignore these in the following discussion.

Refer to caption
Figure 4.9: The pattern in Fig.4.5 is obtainable by putting together square tiles of different sizes. Each of the tiles is divided into two halves of different density.

Let BB be the minimum boundary square containing all (𝐫\mathbf{r}) that have a non-zero charge density Δρ(𝐫)\Delta\rho(\mathbf{r}). We observe that BB can be considered as a union of disjoint smaller squares, each of which is divided by diagonal into two parts where Δρ(𝐫)\Delta\rho(\mathbf{r}) takes values 1/21/2 and 0 (Fig.4.9). This is seen to be true for the outer layer patches. Towards the center, the squares are not so well resolved. Assuming that this construction remains true all the way to the center, in the limit of large NN, the mean density of negative charge in the bounding square =1/4=1/4. Given that the total amount of negative charge is 1-1, the area of the bounding square should be 44. Hence, the boundaries of the minimum bounding square are

|ξ|=1, |η|=1.|\xi|=1,\textrm{ }|\eta|=1. (4.8)

This means, with our choice of the diameter as the width of the box BB, we have

Λ(N)=N+lower order terms.\Lambda\left(N\right)=\sqrt{N}+\textrm{lower order terms}. (4.9)

In Fig. 4.11, we have shown, the correction term appears to grow as N1/4N^{1/4}.

Refer to caption
Refer to caption
Figure 4.10: The patterns produced on the F-lattice, by adding N=12801N=12801 and N+1N+1 particles. The shaded region on the second pattern represents the toppled sites. Notice that the avalanches are stopped by some of the defect lines in the first picture.

Most of the time the avalanches does not reach the boundary. They are often stopped by the defect-lines inside the patches, which breaks the periodicity of the heights. For example, there are lines of alternating 11’s and 0’s inside the dense (all 11) patches. When an avalanche enters the patch, the defect line shifts its position, partially increasing the size of the patch. An example of such event is shown in the Fig.4.10. Because of this, the diameter increases in steps with the increase of NN (see Fig.4.12).

Refer to caption
Figure 4.11: Difference of the diameter to N\sqrt{N} is less than 33 for NN, at least, up to 10510^{5}.
Refer to caption
Figure 4.12: Λ\Lambda for the F-lattice pattern (Fig. 4.5) as a function of NN, in the range 5000N100005000\leq N\leq 10000.

Let NbN_{b} be the minimum number of particles that have to be added so that at least one site at y=by=b topples. We find that for b=10b=10, 5050, 100100, and 300300, Nb=10.770\sqrt{N_{b}}=10.770, 49.43649.436, 98.89498.894 and 297.798297.798. This is consistent with Eq. (4.9).

Then, the Poisson equation, in Eq. (4.3), for this pattern becomes,

2ϕ(𝐫)=Δρ(𝐫)δ(𝐫),\nabla^{2}\phi\left(\mathbf{r}\right)=\Delta\rho\left(\mathbf{r}\right)-\delta\left(\mathbf{r}\right), (4.10)

i.e., there is unit amount of point charge at the origin.

Refer to caption
Figure 4.13: 1/r21/r^{2} transformation of the pattern in Fig. 4.5. Blue lines are drawn between the patches if they are neighbor of each other, with triangular patches considered as degenerate quadrilaterals.
Refer to caption
Figure 4.14: 1/z21/z^{2} transformation of the section of the pattern in Fig. 4.5, on the half-plane corresponding to positive values of η\eta. The regions along the positive and negative ξ\xi-axis are glued together in the transformed picture. The blue lines are drawn in a way similar those in the previous picture, and they form a square grid.

We now determine the parameters in the quadratic form of the potential function. In order to do that in a consistent way, we first look at the topological structure of the pattern. We note that the patches become smaller, and there are more of them in number, as we move towards the center. One can use a coordinate transformation r=1/r2r^{\prime}=1/r^{2}, θ=θ\theta^{\prime}=\theta to avoid this overcrowding (Fig.4.13). We can now draw the adjacency graph (Fig.4.15aa) of the pattern, where each vertex denotes a patch, and a bond between the vertices is drawn if the vertices share a common boundary. It is convenient to think of the triangular patches in the pattern as degenerate quadrilaterals, with one side of length zero. Then we see that the adjacency graph is planar with each vertex of degree four, except a single vertex of coordination number eight corresponding to the exterior of the pattern. The graph has the structure of a square lattice wedge of wedge angle 4π4\pi. The square lattice structure of the adjacency graph is seen more clearly, if rather than 1/r21/r^{2} transformation, the transformation used is z=1/z2z^{\prime}=1/z^{2} ( this has been used earlier in [ostojic]), where z=ξ+iηz=\xi+i\eta, and view it in the complex zz^{\prime}-plane (see Fig.4.14). Thus, one can equivalently represent the graph as a square grid on a Riemann surface of two sheets (fig.4.15bb).

Refer to caption
Refer to caption
Figure 4.15: Two representations of the adjacency graph of the pattern. Here the vertices are the patches, and the edges connect the adjacent patches. (a)(a) Representation as a planar graph, (b)(b) as a graph of wedge of angle 4π4\pi formed by glueing together the eight quadrant graphs at the origin.

We now use the qualitative information obtained from the adjacency matrix of the observed pattern, to obtain quantitative prediction of the exact coordinates of all the patches. Consider an arbitrary patch 𝐏{\bf P}, having an excess density 1/21/2. The potential function in this patch is a quadratic function of (ξ,η)(\xi,\eta) and we parametrize it as

ϕ𝐏(𝐫)\displaystyle\phi_{{}_{\bf P}}(\mathbf{r}) =\displaystyle= 18(m𝐏+1)ξ2+14n𝐏ξη+18(1m𝐏)η2\displaystyle\frac{1}{8}(m_{{}_{\bf P}}+1)\xi^{2}+\frac{1}{4}n_{{}_{\bf P}}\xi\eta+\frac{1}{8}(1-m_{{}_{\bf P}})\eta^{2} (4.11)
+d𝐏ξ+e𝐏η+f𝐏.\displaystyle+d_{{}_{\bf P}}\xi+e_{{}_{\bf P}}\eta+f_{{}_{\bf P}}.

The potential function in another patch 𝐏{\bf P} having zero excess density is parametrized as

ϕ𝐏(𝐫)=18m𝐏(ξ2η2)+14n𝐏ξη+d𝐏ξ+e𝐏η+f𝐏.\phi_{{}_{\bf P}}(\mathbf{r})=\frac{1}{8}m_{{}_{\bf P}}(\xi^{2}-\eta^{2})+\frac{1}{4}n_{{}_{\bf P}}\xi\eta+d_{{}_{\bf P}}\xi+e_{{}_{\bf P}}\eta+f_{{}_{\bf P}}. (4.12)

Now consider two neighboring patches 𝐏{\bf P} and 𝐏{\bf P^{\prime}} with excess densities 1/21/2 and 0 respectively. Then using the matching conditions (see Eq. (4.6)), it is easy to show that if the boundary between them is a horizontal line η=η𝐏\eta=\eta_{{{}_{\bf P}}}, we must have

m𝐏\displaystyle m_{{{}_{\bf P}}^{\prime}} =\displaystyle= m𝐏+1n𝐏=n𝐏d𝐏=d𝐏,\displaystyle m_{{}_{\bf P}}+1\textrm{, }n_{{{}_{\bf P}}^{\prime}}=n_{{}_{\bf P}}\textrm{, }d_{{{}_{\bf P}}^{\prime}}=d_{{}_{\bf P}},
e𝐏\displaystyle e_{{{}_{\bf P}}^{\prime}} =\displaystyle= e𝐏+η𝐏/2f𝐏=f𝐏η𝐏2/4.\displaystyle e_{{}_{\bf P}}+\eta_{{}_{\bf P}}/2\textrm{, }f_{{{}_{\bf P}}^{\prime}}=f_{{}_{\bf P}}-{\eta_{{}_{\bf P}}}^{2}/4. (4.13)

There are similar conditions for other boundaries. These result a coupled set of linear equations for the coefficients {m𝐏,n𝐏,d𝐏,e𝐏,f𝐏}\{m_{{}_{\bf P}},n_{{}_{\bf P}},d_{{}_{\bf P}},e_{{}_{\bf P}},f_{{}_{\bf P}}\}. The equations for m𝐏m_{{}_{\bf P}} and n𝐏n_{{}_{\bf P}} do not involve other variables. In the outermost patch, clearly ϕ(𝐫)=0\phi(\mathbf{r})=0, and for this patch both mm and nn are zero. It follows that m𝐏m_{{}_{\bf P}} and n𝐏n_{{}_{\bf P}} are integers, equal to the Cartesian coordinates of the vertex corresponding to the patch 𝐏{\bf P} in the discretized Riemann surface in Fig.4.15b. In the following, we denote a patch by integers (m,n)(m,n), and write the corresponding coefficients d𝐏d_{{}_{\bf P}}, e𝐏e_{{}_{\bf P}}, and f𝐏f_{{}_{\bf P}} as dm,nd_{m,n}, em,ne_{m,n} and fm,nf_{m,n}. With this convention, the matching conditions in Eq.(4.13) can be rewritten as

dm+1,n=dm,nem+1,nem,n=ηm,n/2(m+n) odd.d_{m+1,n}=d_{m,n}\textrm{, }e_{m+1,n}-e_{m,n}=\eta_{m,n}/2\textrm{, $(m+n)$ odd}. (4.14)

Using similar matching conditions for the boundary of patch (m(m, n)n) with slope ±1\pm 1, we get the conditions

dm,n+1dm,n\displaystyle d_{m,n+1}-d_{m,n} =\displaystyle= em,nem,n+1, (m+n)odd,\displaystyle e_{m,n}-e_{m,n+1},\textrm{ }(m+n)\rm{~odd},
dm,n1dm,n\displaystyle d_{m,n-1}-d_{m,n} =\displaystyle= em,n1em,n, (m+n)odd.\displaystyle e_{m,n-1}-e_{m,n},\textrm{ }(m+n)\rm{~odd}. (4.15)

We can eliminate the variables dm,nd_{m,n} and em,ne_{m,n} with (m+n)(m+n) even using Eq. (4.14) and Eq.(4.15). Then the equations become

em+2,nem,n\displaystyle e_{m+2,n}-e_{m,n} =\displaystyle= ηm,n/2,\displaystyle\eta_{m,n}/2, (4.16)
dm2,ndm,n\displaystyle d_{m-2,n}-d_{m,n} =\displaystyle= ξm,n/2,\displaystyle\xi_{m,n}/2, (4.17)
dm1,n1dm,n\displaystyle d_{m-1,n-1}-d_{m,n} =\displaystyle= em+1,n1em,n,\displaystyle e_{m+1,n-1}-e_{m,n}, (4.18)
dm1,n+1dm,n\displaystyle d_{m-1,n+1}-d_{m,n} =\displaystyle= [em+1,n+1em,n].\displaystyle-[e_{m+1,n+1}-e_{m,n}]. (4.19)

It is convenient to introduce the complex variables z=ξ+iηz=\xi+i\eta, M=m+inM=m+in and D=d+ieD=d+ie. In these variables we can write the potential function, in Eq. (4.11) and (4.12), as

ϕ(z)=18zz¯+18Re[z2M¯+D¯z]+f,\phi(z)=\frac{1}{8}z\bar{z}+\frac{1}{8}Re[z^{2}\bar{M}+\bar{D}z]+f, (4.20)

where overbar denotes complex conjugation.

On the (m,n)(m,n) lattice, with (m+n)(m+n) odd, the natural basis vectors are (1,1)(1,1) and (1,1)(1,-1). Let us call these α\alpha and β\beta. We define the finite difference operators Δ±α\Delta_{\pm\alpha} and Δ±β\Delta_{\pm\beta} by

Δ±αf(z)=f(z±α)f(z),\displaystyle\Delta_{\pm\alpha}f(z)=f(z\pm\alpha)-f(z),
Δ±βf(z)=f(z±β)f(z).\displaystyle\Delta_{\pm\beta}f(z)=f(z\pm\beta)-f(z). (4.21)

Then the equations (4.16-4.19) can be written as

Δαd=Δβe,\displaystyle\Delta_{-\alpha}d=\Delta_{\beta}e,
Δβd=Δαe.\displaystyle\Delta_{-\beta}d=-\Delta_{\alpha}e. (4.22)

These equations are the discrete analog of the familiar Cauchy-Riemann conditions connecting the partial derivatives of real and imaginary parts of an analytic function where the role of the analytic function is played by D=d+ieD=d+ie.

From Eq.(4.16)(\ref{a6}) and Eq.(4.19), it is easy to deduce that DD satisfies the discrete Laplace’s equation

[ΔαΔα+ΔβΔβ]D=0.[\Delta_{\alpha}\Delta_{-\alpha}+\Delta_{\beta}\Delta_{-\beta}]D=0. (4.23)

If mm and nn are large, the corresponding patch is near the origin (|ξ|+|η||\xi|+|\eta| is small), and where the leading behavior of ϕ(𝐫)\phi(\mathbf{r}) is given by ϕ~(𝐫)14πlog(ξ2+η2)\tilde{\phi}(\mathbf{r})\sim-\frac{1}{4\pi}\log(\xi^{2}+\eta^{2}) (see Eq. 4.10). Consider a point z0z_{0}, such that at z0z_{0}

2ϕ~/ξ2m/4;2ϕ~/ξηn/4.\partial^{2}\tilde{\phi}/\partial\xi^{2}\approx m/4;~~~~~\partial^{2}\tilde{\phi}/\partial\xi\partial\eta\approx n/4. (4.24)

Then, z0z_{0} would be expected to lie in the patch labeled by (m,n)(m,n). This gives z0±(πM¯/2)1/2z_{0}\approx\pm(\pi\bar{M}/2)^{-1/2}. Then, setting ϕ~/z\partial\tilde{\phi}/\partial z equal to D¯/2\bar{D}/2 gives us

Dm,n±12πm+in.D_{m,n}\simeq\pm\frac{1}{\sqrt{2\pi}}\sqrt{m+in}. (4.25)

The equation (4.23), subjected to the behavior at large |m|+|n||m|+|n| given by Eq.(4.25) on the 4π4\pi-wedge graph (for each value of (m,n)(m,n), Dm,nD_{m,n} has two values) has a unique solution. Clearly the solution has eight fold rotational symmetry about the origin in the (m,n)(m,n) space. This implies that

Dn,m=i1/2Dm,n;forall(m,n).D_{-n,m}=i^{1/2}D_{m,n};\rm{~for~all~}(m,n). (4.26)

Given Dm,nD_{m,n}, its real and imaginary parts determine dm,nd_{m,n} and em,ne_{m,n}, and using Eq.(4.16, 4.17) we determine the exact positions of all the patch corners. The exact eight-fold rotational symmetry of the adjacency graph of the pattern, and the fact that DD satisfies Eq.(4.26) on the adjacency graph together imply the eight-fold rotational symmetry of all the distances in the pattern.

Note that for the usual square lattice, the solution of Eq.(4.23) is the well known 2-dimensional lattice Greens function, that is explicitly calculable for any finite (m,n)(m,n), and is a simple polynomial of 1/π1/\pi with rational coefficiants [spitzer]. However, for our case of the two sheeted Riemann surface, we have not been able to find a closed-form formula for Dm,nD_{m,n}. But the solution can be determined numerically to very good precision by solving it on a finite grid Lm-L\leq m, nLn\leq L with the condition in Eq.(4.25) imposed exactly at the boundary. We determined dm,nd_{m,n} and em,ne_{m,n} numerically for L=100,200,400L=100,200,400, and extrapolated our results for LL\rightarrow\infty. We find d1,0=0.5000d_{1,0}=0.5000 and d2,1=0.6464d_{2,1}=0.6464, in perfect agreement with the exact theoretical values 1/21/2 and 11/221-1/2\sqrt{2}, respectively, determined using the Fig. 4.9.

Refer to caption
Figure 4.16: The stable configuration for the abelian sandpile model on F-lattice, obtained by adding 5×1045\times 10^{4} particles at one site, initial configuration with average height 5/85/8. Color code: red=0, yellow=1. (Details can be seen in the electronic version using zoom in.)
Refer to caption
Figure 4.17: The stable configuration for the abelian sandpile model on F-lattice, obtained by adding 10510^{5} particles at one site, initial configuration with all heights 0. Color code: red=0, yellow=1. (Details can be seen in the electronic version using zoom in.)

An interesting question to ask is, what is the size distribution of the patches? This can be easily determined from the 1/z21/z^{2} transformation of the pattern, as shown in Fig.4.14. In this representation, the patches are positioned around the sites of the square grid, and all the patches have similar sizes. The Jacobian J(ξ,η)J(\xi,\eta) of the coordinate transformation is an estimate of the area on the ξ\xi-η\eta plane, corresponding to a unit area around (m,n)(m,n) site of the grid on the ξ\xi^{\prime}-η\eta^{\prime} plane. For large mm and nn, it can be shown that

J(ξ,η)|ξ+iη|31|m+in|3/2.J(\xi,\eta)\sim|\xi+i\eta|^{3}\sim\frac{1}{|m+in|^{3/2}}. (4.27)

On the other hand, from the same picture, the number of patches of area larger than or equal to the area of the patch (m,n)(m,n) is equal to the number of sites inside the circle of radius |m+in||m+in|, on the square grid. This number increases linearly with |m+in||m+in|. Then, the number of patches of area greater than or equal to AA is A2/3\sim A^{-2/3}, which in turn implies that the number of patches of area lying between AA and A+dAA+dA would vary as A5/3dAA^{-5/3}dA.

4.5  Other patterns

Our calculations above can be easily extended to the patterns on any other background, on any other two dimensional lattices, so long as there are only patches with two values of Δρ\Delta\rho. The matching conditions along the patch boundaries, ensure that the boundaries are straight lines. Although, we do not have a complete understanding of what determines the slope of the patch boundaries and the number of them for a patch, it seems, that as long as there are only two types of patches, the patches are always quadri-laterals, and the slopes of boundaries are integer multiples of π/4\pi/4. Then our analysis shows that the asymptotic pattern is same as the one for the F-latiice. For example, as mentioned already, this is true for the Manhattan lattice (Fig.4.6), for initial density 1/21/2. Same happens for the the F-lattice itself, with a different periodic background of initial density 5/8 (zi,j=1z_{i,j}=1 if i+ji+j even, or (i,j)(i,j) congruent to (0(0, 1)1) or (2(2, 3)3) mod 44). The pattern for this case is shown in (Fig.4.16). In this case, only the density of patches are different from the one on the checkerboard background, but the patch boundaries for the asymptotic pattern, in the rescaled coordinate, are at the identical positions.

In some other cases, like the F-lattice, with initially all sites empty, the pattern is very similar, but there are some aperiodic patches in the outermost ring (Fig.4.17). Since the behavior of ϕ(𝐫)\phi(\mathbf{r}) in such patches are not known, the equations for Dm,nD_{m,n} do not close in this case.

Finally, how much of this analysis applies to the pattern in Fig. 4.1? As noted in [ostojic], there are large number, possibly infinitely many periodic patches in the asymptotic pattern. Characterization of such patterns remains an interesting open problem.

Chapter 5 Effect of multiple sources and sinks on the growing sandpile pattern

Based on the paper [myjsp2] by Tridib Sadhu and Deepak Dhar.

  • Abstract

    In this chapter, we study the effect of sink sites on DASM patterns, discussed in chapter 4. Sinks change the scaling of the diameter of the pattern with the number NN of sand grains added. For example, in two dimensions, in the presence of a sink site, the diameter of the pattern grows as (N/logN)\sqrt{(N/\log N)} for large NN, whereas it grows as N\sqrt{N} if there are no sink sites. In the presence of a line of sink sites, this rate reduces to N1/3N^{1/3}. We determine the growth rates for various sink geometries along with the case when there are two lines of sink sites forming a wedge, and generalizations to higher dimensions. We characterize the asymptotic pattern in the large NN limit for one such case, the two-dimensional F-lattice with a single source adjacent to a line of sink sites. The characterization is done in terms of the positions of different spatial features in the pattern. For this lattice, we also provide an exact characterization of the pattern with two sources, when the line joining them is along one of the axes of the lattice.

5.1  Introduction

In the previous chapter, we studied growing sandpiles in the abelian model on the F-lattice and the Manhattan lattice. We were able to characterize the pattern corresponding to the initial configuration in which each alternate site of the lattice is occupied, forming a checkerboard pattern. The full characterization of this pattern reveals an interesting underlying mathematical structure, which seems to deserve further exploration. This is what we do in this chapter by adding sink sites or multiple sources.

The presence of sink sites changes the pattern in interesting ways. In particular, it changes how different spatial lengths in the pattern scale with the number of added grains NN. For example, in the absence of sink sites, the diameter of the pattern grows as N\sqrt{N} for large NN, whereas in the presence of a single sink site, this changes to a N/logN\sqrt{N/\log{N}} growth. If there is a line of sink sites next to the site of addition, the growth rate is N1/3N^{1/3}. We also study the case in which the source site is at the corner of a wedge-shaped region of wedge angle ω\omega, where the wedge boundaries are absorbing. We show that for any ω\omega the pattern grows as NαN^{\alpha}, with α=ω/(π+2ω)\alpha=\omega/(\pi+2\omega). This analysis is extended to other lattices with different initial height distributions, and to higher dimensions.

We also study the exact characterization of the asymptotic pattern in the infinite NN limit for the pattern with a line of sink sites. For a single point source, as discussed in chapter 4, the determination of the different distances in the pattern requires a solution of the Laplace equation on a discrete Riemann surface of two-sheets. Interestingly, for the pattern with a line sink, we still have to solve the discrete Laplace equation, but the structure of the Riemann surface changes from two-sheets to three-sheets.

We then study the effect on the pattern of having multiple sites of addition. For multiple sources, the pattern of small patches near each source is not substantially different from a single-source pattern, but some rearrangements occur in the larger outer patches. Two patches may sometimes join into one, or, conversely, a patch may break up into two. While the number of patches undergoing such changes is finite, the sizes and positions of all the patches are affected by the presence of the other source, and we show how these changes can be calculated exactly for the asymptotic pattern.

This chapter is organized as follows. In Section 5.2, we discuss scaling of the diameter of the patterns with NN for different sink geometries. First, we consider the pattern in the presence of a line of sink sites. Then, this analysis is extended to other sink geometries: two intersecting line sinks in two dimensions and two or three intersecting planes of sink sites in three dimensions. The problem of a single sink site is a bit different from the others, and is discussed separately in Section 5.3. In Section 5.4, we numerically verify the growth rates. The remaining sections are devoted to a detailed characterization of some of these patterns. In Section 5.5, we characterize the pattern in the presence of a line sink. In Section 5.6, we discuss the case when there are two sources present. These analytical calculations for the metric properties of the asymptotic pattern are compared in Section 5.7, with the measured values for the patterns with finite but large NN. Section 5.8, contains a summary and some concluding remarks.

5.2  Rate of growth of the patterns

For the single source pattern, discussed in chapter 4, the diameter 2Λ(N)2N2\Lambda\left(N\right)\simeq 2\sqrt{N}, for large NN. We want to study how this dependence gets modified in the presence of sink sites.

First, consider the pattern formed by adding sand grains at a single site in the presence of a line of sink sites. In the rest of this chapter we will use the same notations defined in chapter 4. Any grain reaching a sink site gets absorbed, and is removed from the system. For simplicity let us consider the source site at 𝐑o(xo,0)\mathbf{R}_{o}\equiv\left(x_{o},0\right) and the sink sites along the yy-axis. A picture of the pattern produced by adding 1433600014336000 grains at (1,0)\left(1,0\right) is shown in Fig.5.1.

Refer to caption
Figure 5.1: Pattern produced by adding grains at a single site adjacent to a line of sink sites. Color code: red=0 and yellow=1. Apparent orange regions in the picture represent patches with checkerboard configuration (Zoom in for details in the electronic version).

The equation analogous to Eq. (4.3) for this problem is

2ϕ(𝐫)=Δρ(𝐫)NΛ2δ(𝐫𝐫o),\nabla^{2}\phi\left(\mathbf{r}\right)=\Delta\rho\left(\mathbf{r}\right)-\frac{N}{\Lambda^{2}}\delta\left(\mathbf{r}-\mathbf{r}_{o}\right), (5.1)

for all 𝐫\mathbf{r} in the right-half plane with ξ>0\xi>0, where 𝐫o\mathbf{r}_{o} is the position of the source in reduced coordinates. Also, as there is no toppling at the sink sites, ϕ\phi must satisfy the boundary condition

ϕ(𝐫)=0 for all 𝐫(0,η).\phi\left(\mathbf{r}\right)=0\textrm{~ ~ for~all~}\mathbf{r}\equiv\left(0,\eta\right). (5.2)

We can think of ϕ\phi as the potential due to a point charge N/Λ2N/\Lambda^{2} at 𝐫o\mathbf{r}_{o} and an areal charge density Δρ(𝐫)-\Delta\rho\left(\mathbf{r}\right), in the presence of a grounded conducting line along the η\eta-axis. This problem can be solved using the well-known method of images in electrostatics. Let 𝐫\mathbf{r}^{\prime} be the image point of 𝐫\mathbf{r} with respect to the η\eta-axis. Define Δρ(𝐫)\Delta\rho\left(\mathbf{r}\right) in the left half plane as

Δρ(𝐫)=Δρ(𝐫).\Delta\rho\left(\mathbf{r}^{\prime}\right)=-\Delta\rho\left(\mathbf{r}\right). (5.3)

Then the Poisson equation for this new charge configuration is

2ϕ(𝐫)=Δρ(𝐫)NΛ2δ(𝐫𝐫o)+NΛ2δ(𝐫𝐫o).\nabla^{2}\phi(\mathbf{r})=\Delta\rho(\mathbf{r})-\frac{N}{\Lambda^{2}}\delta\left(\mathbf{r}-\mathbf{r}_{o}\right)+\frac{N}{\Lambda^{2}}\delta\left(\mathbf{r}-\mathbf{r^{\prime}}_{o}\right). (5.4)

As the function Δρ(𝐫)\Delta\rho\left(\mathbf{r}\right) is odd under reflection, ϕ\phi automatically vanishes along the η\eta-axis.

We define NrN_{r} as the number of sand grains that remain unabsorbed. Then

Nr=x>0yΔz(x,y),N_{r}=\sum_{x>0}\sum_{y}\Delta z\left(x,y\right), (5.5)

where Δz(x,y)\Delta z\left(x,y\right) is the change in the height variables between its values before and after the system relaxes. Clearly, for large Λ\Lambda, we can write

NrΛ2𝑑τΔρ(𝐫),N_{r}\simeq\Lambda^{2}\int_{\mathbb{H}}d\tau\Delta\rho\left(\mathbf{r}\right), (5.6)

where dτ=dξdηd\tau=d\xi d\eta is the infinitesimal area around 𝐫(ξ,η)\mathbf{r}\equiv\left(\xi,\eta\right). The integration is performed over the right half-plane \mathbb{H} with ξ>0\xi>0. We shall use the sign \simeq to denote equality up to leading order in Λ\Lambda. Since Δρ(𝐫)\Delta\rho\left(\mathbf{r}\right) is a non-negative bounded function, exactly zero outside a finite region, this integral exists. Let its value be C2C_{2}, then we have

NrC2Λ2.N_{r}\simeq C_{2}\Lambda^{2}. (5.7)

Let NaN_{a} denote the number of grains that are absorbed by the sink sites. Then considering that the grains can reach the sink sites only by toppling at its neighbors we have

Na12yTΛ(1,y).N_{a}\simeq\frac{1}{2}\sum_{y}T_{\Lambda}\left(1,y\right). (5.8)

The factor 1/21/2 comes from the fact that in the F-lattice, only half of the sites on the column x=1x=1 would have arrows going out to the sink sites. Then using our scaling ansatz in equation (4.1), for Λ\Lambda large,

TΛ(1,y)2Λϕξ|ξ=0.T_{\Lambda}\left(1,y\right)\simeq 2\Lambda\left.\frac{\partial\phi}{\partial\xi}\right\arrowvert_{\xi=0}. (5.9)

Hence

NaΛ2𝑑ηϕξ|ξ=0.N_{a}\simeq\Lambda^{2}\int_{-\infty}^{\infty}d\eta\left.\frac{\partial\phi}{\partial\xi}\right\arrowvert_{\xi=0}. (5.10)

Now from equation (5.4) the potential ϕ\phi can be written as the sum of two terms: ϕdipole\phi_{dipole} due to two point charges N/Λ2N/\Lambda^{2} and N/Λ2-N/\Lambda^{2} at 𝐫o(ξo,0)\mathbf{r}_{o}\equiv\left(\xi_{o},0\right) and its image point 𝐫o(ξo,0)\mathbf{r}^{\prime}_{o}\equiv\left(-\xi_{o},0\right) respectively, and the term ϕrest\phi_{rest} due to the areal charge density.

ϕ(𝐫)=ϕdipole(𝐫)+ϕrest(𝐫),\phi\left(\mathbf{r}\right)=\phi_{dipole}\left(\mathbf{r}\right)+\phi_{rest}\left(\mathbf{r}\right), (5.11)

where

2ϕdipole(𝐫)\displaystyle\nabla^{2}\phi_{dipole}\left(\mathbf{r}\right) =\displaystyle= NΛ2δ(𝐫𝐫o)+NΛ2δ(𝐫𝐫o),\displaystyle-\frac{N}{\Lambda^{2}}\delta\left(\mathbf{r}-\mathbf{r}_{o}\right)+\frac{N}{\Lambda^{2}}\delta\left(\mathbf{r}-\mathbf{r}^{\prime}_{o}\right),
2ϕrest(𝐫)\displaystyle\nabla^{2}\phi_{rest}\left(\mathbf{r}\right) =\displaystyle= Δρ(𝐫).\displaystyle\Delta\rho\left(\mathbf{r}\right). (5.12)

We first consider the case where RoR_{o} is finite and ro=Ro/Λr_{o}=R_{o}/\Lambda vanishes in the large Λ\Lambda limit. Then ϕdipole\phi_{dipole} reduces to a dipole potential, and it diverges near the origin. However, ϕrest(𝐫)\phi_{rest}\left(\mathbf{r}\right) is a continuous and differentiable function for all 𝐫\mathbf{r}. From the solution of the dipole potential, it is easy to show that

ϕdipole(r,θ)=Acosθr,\phi_{dipole}\left(r,\theta\right)=A\frac{\cos\theta}{r}, (5.13)

for 1r1/Λ1\gg r\gg 1/\Lambda, where we have used polar coordinates (r,θ)\left(r,\theta\right) with θ\theta being measured with respect to the ξ\xi-axis. Here AA is a numerical constant, which is a property of the asymptotic pattern. Then

ϕξ|ξ=0=Aη2,\left.\frac{\partial\phi}{\partial\xi}\right\arrowvert_{\xi=0}=\frac{A}{\eta^{2}}, (5.14)

and the integral in equation (5.10) diverges as A/ηminA/\eta_{min}, where ηmin\eta_{min} is the cutoff introduced by the lattice. Using ηmin=𝒪(1/Λ)\eta_{min}=\mathcal{O}\left(1/\Lambda\right) it is easy to show that

NaC1Λ3,N_{a}\simeq C_{1}\Lambda^{3}, (5.15)

where C1C_{1} is a constant. Then using equations (5.7) and (5.15) and that NaN_{a} and NrN_{r} add up to NN, we get

C1Λ3+C2Λ2N.C_{1}\Lambda^{3}+C_{2}\Lambda^{2}\simeq N. (5.16)

Considering the dominant term in the expression for large Λ\Lambda, it follows that Λ\Lambda increases as N1/3N^{1/3}.

For the patterns in the other limit where the source is placed at a distance 𝒪(Λ)\mathcal{O}\left(\Lambda\right) such that ror_{o} is non-zero for Λ\Lambda\rightarrow\infty, ϕdipole\phi_{dipole} is non-singular along the sink line. Then, clearly NaΛ2N_{a}\sim\Lambda^{2} and as a result Λ(N)N1/2\Lambda\left(N\right)\sim N^{1/2}.

The above analysis can be easily generalized to a case with the sink sites along two straight lines intersecting at an angle ω\omega and a point source inside the wedge. For a square lattice, ω=0,π/2,π,3π/2\omega=0,\pi/2,\pi,3\pi/2 and 2π2\pi are most easily constructed, and avoid the problems of lines with irrational slopes, or rational numbers slopes with large denominators. The wedge with wedge-angle ω=π/2\omega=\pi/2 is obtained by placing the sink sites along the xx and yy-axis and the source site at 𝐑o(1,1)\mathbf{R}_{o}\equiv\left(1,1\right) in the first quadrant. The pattern with a line sink, discussed in previous section, corresponds to ω=π\omega=\pi.

For the general ω\omega, the corresponding electrostatic problem reduces to determining the potential function ϕ\phi inside a wedge formed by two intersecting grounded conducting lines. Again the potential has two contributions: the potential ϕpoint(𝐫)\phi_{point}\left(\mathbf{r}\right) due to a point charge at the source site and the potential ϕrest(𝐫)\phi_{rest}\left(\mathbf{r}\right) due to the areal charge density. We first consider the case where the source site is placed at a finite distance from the wedge corner such that the distance in reduced coordinates vanishes in the large Λ\Lambda limit. In this limit ϕrest\phi_{rest} is a non-singular function of 𝐫\mathbf{r} while ϕpoint\phi_{point} diverges close to the origin. A simple calculation of the electrostatic problem gives

ϕpoint(r,θ)Asinαθrα,\phi_{point}\left(r,\theta\right)\approx A\frac{\sin\alpha\theta}{r^{\alpha}}, (5.17)

where α=π/ω\alpha=\pi/\omega and we have used polar coordinates (r,θ)\left(r,\theta\right) with the polar angle θ\theta measured from one of the absorbing lines. Again AA is a constant independent of NN or Λ\Lambda and is a property of the asymptotic pattern. Then arguing as before, we get

NaC1Λ2+αandNrC2Λ2.N_{a}\simeq C_{1}\Lambda^{2+\alpha}\rm{~~and~~}N_{r}\simeq C_{2}\Lambda^{2}. (5.18)

So the equation analogous to equation (5.16) is

C1Λ2+α+C2Λ2N.C_{1}\Lambda^{2+\alpha}+C_{2}\Lambda^{2}\simeq N. (5.19)

For a wedge angle ω=π\omega=\pi, α=1\alpha=1, and the above equation reduces to Eq.(5.16).

Similar arguments involving conformal transformation have been used earlier in the context of equilibrium statistical physics to determine the wedge-angle dependence of surface critical exponents near a wedge [dup].

For the problem where the source site is at a distance 𝒪(Λ)\mathcal{O}\left(\Lambda\right) from the wedge corner both the functions ϕrest\phi_{rest} and ϕpoint\phi_{point} are nonsingular close to the origin. It is easy to show that Λ(N)\Lambda\left(N\right) grows as N1/2N^{1/2}.

These arguments can be easily extended to other lattices with different initial height distributions, or to higher dimensions. Consider, for example, an abelian sandpile model defined on the cubic lattice. The allowed heights are from 0 to 55, and a site topples if the height exceeds 55, and sends one particle to each neighbor. The sites are labelled by the Cartesian coordinates (x,y,z)(x,y,z), where x,yx,y and zz are integers. We consider the infinite octant defined by x0,y0,z0x\geq 0,y\geq 0,z\geq 0. We start with all heights equal to 44, and add sand grains at the site (1,1,1)(1,1,1). We assume that the sites on planes x=0x=0, y=0y=0 and z=0z=0 are all sink sites, and any grain reaching there is lost. We add NN grains and determine the diameter of the resulting stable pattern.

We again write the potential function in two parts: ϕpoint\phi_{point} due to a point charge at (1/Λ,1/Λ,1/Λ)\left(1/\Lambda,1/\Lambda,1/\Lambda\right) and ϕrest\phi_{rest} due to the bulk charge density in the presence of three conducting grounded planes. Then, a simple electrostatic calculation shows that the potential ϕpoint\phi_{point} is the octapolar potential with it’s form in spherical polar coordinate as

ϕ(r,θ,Φ)f(θ,ϕ)r4.\phi\left(r,\theta,\Phi\right)\approx\frac{f\left(\theta,\phi\right)}{r^{4}}. (5.20)

This then implies that the equation determining the dependence of Λ\Lambda on NN is

C1Λ6+C2Λ3NC_{1}\Lambda^{6}+C_{2}\Lambda^{3}\simeq N (5.21)

5.3  A single sink site

Let the site of addition be the origin, with the sink site placed at 𝐑o\mathbf{R}_{o}. We shall show that when 𝐑o\mathbf{R}_{o} lies in a high-density patch (color yellow in Fig.5.2), the asymptotic patterns are identical to the one produced in the absence of the sink site.

The patterns, produced for ror_{o} close to 11, with the sink sites placed deep inside a high-density patch are simple to analyze, even for finite but large Λ\Lambda. One such pattern is presented in Fig.5.2.

Refer to caption
Figure 5.2: The pattern produced by adding 224000224000 grains at the origin with a sink site at (400,0)\left(400,0\right), inside a patch of density 11 (color yellow). Color code: red=0=0 and yellow=1=1. The apparent orange regions correspond to the checkerboard height distribution. (Zoom in for details in the electronic version.)
Refer to caption
Figure 5.3: The pattern produced by adding 224000224000 grains at the origin with a sink site placed at (360,140)\left(360,140\right), inside a low-density patch. Color code red=0=0 and yellow=1=1. The apparent orange regions correspond to the checkerboard height distribution. (Details can be seen in the electronic version using zoom in.)

We see that the effect of the sink site on the pattern is to produce a depletion pattern centered at this site. The depletion pattern is a smaller negative copy of the single source pattern, where negative means Δρ\Delta\rho is negative of the original pattern. We define the function Δzsink(𝐑;N)\Delta z_{sink}\left(\mathbf{R};N\right) as the difference between the heights at 𝐑{\mathbf{R}} in the final stable configuration produced by adding NN grains at the origin, with and without the sink site.

Δzsink(𝐑;N)=Δzsource+sink(𝐑;N)Δzsource(𝐑;N).\Delta z_{sink}\left(\mathbf{R};N\right)=\Delta z_{source+sink}\left({\mathbf{R}};N\right)-\Delta z_{source}\left(\mathbf{R};N\right). (5.22)

From the figure it is seen that, in this case, Δzsink(𝐑;N)\Delta z_{sink}\left(\mathbf{R};N\right) is the negative of the pattern produced by a smaller source, centered at 𝐑0\mathbf{R}_{0}. The number of grains required to produce this smaller pattern is exactly the number of grains NaN_{a} absorbed at the sink site.

Δzsink(𝐑;N)=Δzsource(𝐑𝐑o;Na).\Delta z_{sink}\left(\mathbf{R};N\right)=-\Delta z_{source}\left(\mathbf{R}-\mathbf{R}_{o};N_{a}\right). (5.23)

This is immediately seen from the fact that the toppling function TΛ(𝐑)T_{\Lambda}\left(\mathbf{R}\right) satisfies

ΔTΛ(𝐑)=Δzsource+sink(𝐑;N)Nδ𝐑,𝟎+Naδ𝐑,𝐑o,\Delta T_{\Lambda}\left(\mathbf{R}\right)=\Delta z_{source+sink}\left(\mathbf{R};N\right)-N\delta_{\mathbf{R},\mathbf{0}}+N_{a}\delta_{\mathbf{R},\mathbf{R}_{o}}, (5.24)

where Δ\Delta is the toppling matrix for the sandple model on the F-lattice (see chapter 3). Let Tsource(𝐑;N)T_{source}({\mathbf{R}};N) be the number of topplings at 𝐑{\mathbf{R}}, when we add NN particles at the origin in the absense of any sink site. Since Eq. (5.24) is a linear equation, it follows that a solution of this equation is

TΛ(𝐑)=Tsource(𝐑;N)Tsource(𝐑𝐑o;Na).T_{\Lambda}\left(\mathbf{R}\right)=T_{source}\left(\mathbf{R};N\right)-T_{source}\left(\mathbf{R}-\mathbf{R}_{o};N_{a}\right). (5.25)

This is a valid solution for our problem, if the corresponding heights in the final configuration with the sink are all non-negative. This happens when the region with nonzero Δzsink\Delta z_{sink} is confined within a high-density patch of the single source pattern.

The number NaN_{a} can be determined from the requirement that the number of topplings at the sink site is zero. The potential function for the single source problem diverges as (4π)1logr\left(4\pi\right)^{-1}\log r near the source. Considering the ultraviolate cutoff due to the lattice, Tsource(𝐑,N)T_{source}\left(\mathbf{R},N\right) at 𝐑=0\mathbf{R}=0 can be approximated by (4π)1NlogN\left(4\pi\right)^{-1}N\log N to leading order in NN. Then at 𝐑=𝐑0\mathbf{R}=\mathbf{R}_{0}, Tsource(𝐑𝐑o;Na)T_{source}\left(\mathbf{R}-\mathbf{R}_{o};N_{a}\right) is approximately equal to (4π)1NalogNa(4\pi)^{-1}N_{a}\log N_{a} whereas Tsource(𝐑0;N)Nϕsource(𝐫0)T_{source}\left(\mathbf{R}_{0};N\right)\approx N\phi_{source}(\mathbf{r}_{0}), where ϕsource(𝐫)\phi_{source}\left(\mathbf{r}\right) is the potential function for the problem without a sink. Then from the equation (5.25) we have

14πNalogNaNϕsource(𝐫o).\frac{1}{4\pi}N_{a}\log N_{a}\simeq N\phi_{source}\left(\mathbf{r}_{o}\right). (5.26)

For large NN, this implies that

Na4πϕsource(𝐫o)N/logN.N_{a}\simeq 4\pi\phi_{source}\left(\mathbf{r}_{o}\right)N/\log N. (5.27)

Then, in the large NN limit, for a sink at a fixed reduced coordinate 𝐫o\mathbf{r}_{o}, the relative size of the defect produced by the sink site decreases as 1/logN1/\sqrt{\log N}. Hence asymptotically, the fractional area of the defect region will decrease to zero, if the sink position 𝐫o\mathbf{r}_{o} is inside a high-density patch.

When the sink site is inside a low-density patch, the subtraction procedure in equation (5.23) gives negative heights, and no longer gives the correct solution. However it is observed for the patches in the outer layer, where the patches are large, that the effect of the sink site is confined within the neighboring high-density patches (Fig.5.3) and rest of the pattern in the asymptotic limit remains unaffected.

The pattern in which the source and the sink sites are adjacent to each other, appears to be very similar to the one produced without the sink site. This is easy to see. The Poisson equation analogous to equation (4.3) for this problem is

2ϕ(𝐫)=Δρ(𝐫)NΛ2δ(𝐫)+NaΛ2δ(𝐫𝐫o),\nabla^{2}\phi(\mathbf{r})=\Delta\rho(\mathbf{r})-\frac{N}{\Lambda^{2}}\delta(\mathbf{r})+\frac{N_{a}}{\Lambda^{2}}\delta(\mathbf{r}-\mathbf{r}_{o}), (5.28)

where NaN_{a} is the number of grains absorbed in the sink site at 𝐫o\mathbf{r}_{o}. In an electrostatic analogy, as discussed earlier, ϕ\phi can be considered as the potential due to a distributed charge of density Δρ(𝐫o)-\Delta\rho\left(\mathbf{r}_{o}\right) and two point charges of strength N/Λ2N/\Lambda^{2} and Na/Λ2-N_{a}/\Lambda^{2}, placed at the origin and at 𝐫o\mathbf{r}_{o} respectively. It is easy to see that the dominant contribution to the potential is the monopole term with net charge (NNa)/Λ2(N-N_{a})/\Lambda^{2}. The contribution due to other terms decreases as 1/Λ1/\Lambda for large Λ\Lambda, and the asymptotic pattern is the same as without a sink, with NNaN-N_{a} particles added.

The number NaN_{a} of particles absorbed is determined by the condition that the number of topplings at (1,0)(1,0) (the sink position) is zero. The potential produced at (1,0)(1,0) and (0,0)(0,0), by the areal charge density is nearly the same. The number of topplings at (1,0)(1,0), if we add NaN_{a} particles at the sink site, is approximately (4π)1NalogNa\left(4\pi\right)^{-1}N_{a}\log N_{a}. Now, from the solution of the discrete Laplacian, the number of topplings produced at (1,0)(1,0) due to NN particles added at (0,0)(0,0) is approximately (4π)1(NlogNCN)\left(4\pi\right)^{-1}\left(N\log N-CN\right) with CC being an undetermined constant. Equating these two, we get

NalogNaNlogNCN.N_{a}\log N_{a}\simeq N\log N-CN. (5.29)

As the asymptotic pattern is the same as that produced by adding (NNa)\left(N-N_{a}\right) grains at the origin without a sink, we have NNaΛ2N-N_{a}\simeq\Lambda^{2}, and

(NΛ2)log(NΛ2)NlogNCN.(N-\Lambda^{2})\log(N-\Lambda^{2})\simeq N\log N-CN. (5.30)

Simplification of this equation for large NN shows that Λ\Lambda grows as N/logN\sqrt{N/\log N} with NN.

For finite NN, the leading correction to ϕ(𝐫)\phi\left(\mathbf{r}\right) comes from the dipole term in the potential. This term breaks the reflection symmetry of the pattern about the origin. A measure of the bilateral asymmetry is the difference of the boundary distances on two opposite sides of the source. As the relative contribution of the dipole potential compared to the monopole term decays as logΛ/Λ\log\Lambda/\Lambda, for large Λ\Lambda, this difference vanishes in the asymptotic pattern in the reduced coordinates.

5.4  Numerical results

All the above scaling behaviors are verified by the measurement of lengths in the patterns for finite, but large NN. Let Λline(N)\Lambda^{\ast}_{line}\left(N\right) be the real positive root of equation (5.16) for a given integer value of NN. As Λline\Lambda_{line} takes only the integer values on the lattice, an estimate of it would be Nint[Λline(N)]Nint\left[\Lambda^{\ast}_{line}(N)\right], the integer nearest to Λline(N)\Lambda^{\ast}_{line}\left(N\right). Interestingly, we found that for a choice of C1=0.1853C_{1}=0.1853 and C2=0.528C_{2}=0.528, this estimate gives values which differ from the measured values at most by 11 for all NN in the range of 100100 to 3×1063\times 10^{6}. We rewrite the equation (5.16) as

0.1853Λline3+0.528Λline2N,0.1853\Lambda_{line}^{3}+0.528\Lambda_{line}^{2}\doteqdot N, (5.31)

where we used the symbol \doteqdot to denote that both sides differ at most by 11. Clearly more precise estimates of C1C_{1} and C2C_{2} would be required if we want this to work for larger NN.

Similarly for the other two equations (5.19) and (5.21) we find that they are in very good agreement with our numerical data. We consider the case of wedge angle ω=2π\omega=2\pi. This corresponds to the case with the source site next to an infinite half-line of sink sites. Here α=1/2\alpha=1/2 and equation (5.19) reduces to

C1Λω=2π5/2+C2Λω=2π2N.C_{1}\Lambda_{\omega=2\pi}^{5/2}+C_{2}\Lambda_{\omega=2\pi}^{2}\simeq N. (5.32)

Choosing C1=0.863408C_{1}=0.863408 and C2=0.043311C_{2}=0.043311, we find that the function Nint[Λω=2π(N)]Nint\left[\Lambda^{\ast}_{\omega=2\pi}\left(N\right)\right] differs from the measured values by at most 11 for all NN in the range of 100100 to 2×1052\times 10^{5}. Then, as in equation (5.31), we write

0.863408Λω=2π5/2+0.043311Λω=2π2N.0.863408\Lambda_{\omega=2\pi}^{5/2}+0.043311\Lambda_{\omega=2\pi}^{2}\doteqdot N. (5.33)

Similarly, for the three dimensional abelian sandpile model with the source site inside the first octant and x=0x=0, y=0y=0, and z=0z=0 as the absorbing planes, the equation determining the dependence of the diameter on NN is

0.0159Λ3d6+88Λ3d3N0.0159\Lambda_{3d}^{6}+88\Lambda_{3d}^{3}\doteqdot N (5.34)

We have verified this equation for NN between 5×1055\times 10^{5} to 5×1085\times 10^{8}.

We obtained these equations by determining the number of absorbed grains NaN_{a} and the remaining grains NrN_{r} from dimensional counting grounds, and the final equations are then only a statement of the conservation of the sand grains. It is quite remarkable that this scaling analysis gives almost the exact values of the diameter. In addition, these equations have an important feature that they include a “correction to scaling” term whereas the usual scaling analysis ignores the sub-leading powers.

We also verify equation (5.27) using patterns with fixed 𝐫o\mathbf{r}_{o} and the sink site inside a high-density patch in the outer layer of the pattern. It is found that for a change of NN from 224000224000 to 896000896000, NalogN/NN_{a}\log{N}/N changes by less than 7%7\%, which is consistent with the scaling relation.

In the other limit, where the sink site is next to the source, the dependence of Λ\Lambda on NN is given in equation (5.30). We measure Λ(N)\Lambda\left(N\right) for the patterns with the sink site at (1,0)\left(1,0\right) and the source at the origin. For NN in the range of 100100 to 5×1055\times 10^{5} we find that the function Nint[Λpoint(N)]Nint[\Lambda^{\ast}_{point}\left(N\right)] with C=2.190C=2.190 in equation (5.30), gives almost exact values of Λ(N)\Lambda\left(N\right), with their difference being at most 11. Then we write

(NΛpoint2)log(NΛpoint2)NlogN2.190N.(N-\Lambda_{point}^{2})\log(N-\Lambda_{point}^{2})\doteqdot N\log N-2.190N. (5.35)

In the last case, let R1R_{1} and R2R_{2} be the boundary distances measured along the positive and the negative xx axis. The difference R2R1R_{2}-R_{1} is plotted in Fig.5.4 where the data is found to fit to the function 1.22log(R2+0.5)1.22\log{(R_{2}+0.5)}. This confirms the result that the relative bilateral asymmetry (R2R1)/R2(R_{2}-R_{1})/R_{2} vanishes in the asymptotic pattern as logΛ/Λ\log\Lambda/\Lambda.

Refer to caption
Figure 5.4: The bilateral asymmetry due to the presence of a sink site in Fig.5.2.

5.5  Characterization of the pattern with a line sink

The pattern with a line sink (Fig.5.1), discussed in Section 5.2, retained two important properties present in the single source pattern (Fig. 4.5). These are: The asymptotic pattern is made of the union of two types of patches of excess density 1/21/2 and 0 and the separating boundaries of the patches are straight lines of slope 0, ±1\pm 1 or \infty. However the adjacency graph is changed significantly and this changes the sizes of the patches as well. In this section we show how to explicitly determine the potential function on this adjacency graph.

The adjacency graph of the patches is shown in Fig.5.6. This representation of the graph is easier to see by taking the 1/r31/r^{3} transformation of the pattern and then joining neighboring patches by straight lines (Fig.5.5). Each vertex in the graph is connected to four neighbors except for the vertices corresponding to the patches next to the absorbing line. These have coordination number 33. Also the vertex at the center corresponding to the exterior of the pattern is connected to seven neighbors.

Refer to caption
Figure 5.5: 1/r31/r^{3} transformation of the pattern in Fig.5.1. Two adjoining patches are connected by drawing a straight line.
Refer to caption
Figure 5.6: The adjacency graph of the patches corresponding to the pattern in Fig.5.1.

Let us write the quadratic potential function in a patch PP having excess density 1/21/2 as

ϕP(𝐫)=18(mP+1)ξ2+14nPξη+18(1mP)η2+dPξ+ePη+fP,\phi_{{}_{P}}(\mathbf{r})=\frac{1}{8}(m_{{}_{P}}+1)\xi^{2}+\frac{1}{4}n_{{}_{P}}\xi\eta+\frac{1}{8}(1-m_{{}_{P}})\eta^{2}+d_{{}_{P}}\xi+e_{{}_{P}}\eta+f_{{}_{P}}, (5.36)

where the parameters mm, nn, dd, ee and ff take constant values within a patch. Similarly for a low-density patch PP^{\prime}

ϕP(𝐫)=18mP(ξ2η2)+14nPξη+dPξ+ePη+fP.\phi_{{}_{P^{\prime}}}(\mathbf{r})=\frac{1}{8}m_{{}_{P^{\prime}}}(\xi^{2}-\eta^{2})+\frac{1}{4}n_{{}_{P^{\prime}}}\xi\eta+d_{{}_{P^{\prime}}}\xi+e_{{}_{P^{\prime}}}\eta+f_{{}_{P^{\prime}}}. (5.37)

Using the continuity of ϕ(𝐫)\phi\left(\mathbf{r}\right) and its first derivatives along the common boundaries between neighboring patches it has been shown in chapter 4, that for the single source pattern without sink sites mm, and nn take integer values. The same argument also applies to this problem and it can be shown that (m,n)\left(m,n\right) are the coordinates of the patches in the adjacency graph in Fig.5.6. These coordinates are shown next to some of the vertices. There are two different patches corresponding to the same set of (m,n)\left(m,n\right) values. In fact, as in the single source pattern the adjacency graph forms a square grid on a two sheeted Riemann surface, the same is formed for this pattern, but on a three sheeted Riemann surface. This can be constructed by modifying the graph in Fig 5.6 keeping its topology the same. In this representation the pattern covers half of the surface with (m,n)\left(m,n\right) being the Cartesian coordinates on the surface.

Define function D(m,n)=d(m,n)+ie(m,n)D\left(m,n\right)=d\left(m,n\right)+ie\left(m,n\right) on this lattice. As discussed in [myepl], the continuity of ϕ(𝐫)\phi(\mathbf{r}) and its first derivatives along the common boundary between neighboring patches imposes linear relations between dd and ee of the corresponding patches. Using these matching conditions it can be shown that dd and ee satisfy the discrete Cauchy-Riemann conditions [myepl]

d(m+1,n+1)d(m,n)\displaystyle d\left(m+1,n+1\right)-d\left(m,n\right) =\displaystyle= e(m,n+1)e(m+1,n),\displaystyle e\left(m,n+1\right)-e\left(m+1,n\right),
e(m+1,n+1)e(m,n)\displaystyle e\left(m+1,n+1\right)-e\left(m,n\right) =\displaystyle= d(m+1,n)d(m,n+1),\displaystyle d\left(m+1,n\right)-d\left(m,n+1\right), (5.38)

and then the function DD satisfies the discrete Laplace equation

i=±1j=±1D(m+i,n+j)4D(m,n)=0,\sum_{i=\pm 1}\sum_{j=\pm 1}D(m+i,n+j)-4D(m,n)=0, (5.39)

on this adjacency graph.

Let us define M=m+inM=m+in and z=ξ+iηz=\xi+i\eta. As argued before, close to the origin the potential ϕ\phi diverges as 1/r1/r (equation (5.13)). Then, the corresponding complex potential function Φ(z)1/z\Phi\left(z\right)\sim 1/z. As Md2Φ/dz2M\sim{d^{2}\Phi}/{dz^{2}}, and DdΦ/dzD\sim d\Phi/dz, it follows that for large |M||M|,

DM2/3.D\sim M^{2/3}. (5.40)

Also, the condition that on the absorbing line ϕ(𝐫)\phi\left(\mathbf{r}\right) must vanish implies that for the vertices with even nn along the red line in Fig.5.6 e(0,n)e(0,n) vanishes. These vertices correspond to the patches with the absorbing line as the horizontal boundary in Fig.5.1.

Equation (6.19) with the above constraint and the boundary condition (Eq.(5.40)) has a unique solution. The normalization of ϕ\phi is fixed by the requirement that d(1,0)=1d(1,0)=-1, which fixes the diameter of the pattern to be 22 in reduced units. All the spatial distances in the pattern can be expressed in terms of this solution D(m,n)D\left(m,n\right) using the matching conditions between two neighboring patches. As an example, consider the boundary between the patches corresponding to (m,n)\left(m,n\right) and (m+1,n)\left(m+1,n\right) with (m+n)\left(m+n\right) being odd. The matching conditions only allow a horizontal boundary between them with the equation η=ηp\eta=\eta_{p}, where

e(m+1,n)e(m,n)=ηp/2.e\left(m+1,n\right)-e\left(m,n\right)=\eta_{p}/2. (5.41)

Similarly there is a vertical boundary between the patches (m,n)\left(m,n\right) and (m1,n)\left(m-1,n\right), with the equation ξ=ξp\xi=\xi_{p}, where

d(m1,n)d(m,n)=ξp/2.d\left(m-1,n\right)-d\left(m,n\right)=\xi_{p}/2. (5.42)

The other boundaries can similarly be determined using the solution for D(m,n)D\left(m,n\right). The characterization of the asymptotic patterns for ω=π/2\omega=\pi/2, 3π/23\pi/2 and 2π2\pi is qualitatively similar and will not be discussed here.

5.6  Patterns with two sources

In this section we discuss patterns produced by adding NN grains each at two sites placed at a distance 2Λ𝐫𝐨2\Lambda\mathbf{r_{o}} from each other along the xx-axis, at Λ𝐫o\Lambda\mathbf{r}_{o} and Λ𝐫o-\Lambda\mathbf{r}_{o} with 𝐫o(ξo,0)\mathbf{r}_{o}\equiv\left(\xi_{o},0\right). Again, the diameter 2Λ2\Lambda is defined as the height of the smallest rectangle enclosing all sites that have toppled at least once. The two limits, r0r_{0} close to zero and r0r_{0} large are trivial: For ro0r_{o}\rightarrow 0, the asymptotic pattern is the same as that produced by adding grains at a single site. On the other hand if ro>1r_{o}>1, each source produces its own pattern, which do not overlap, and the final pattern is a simple superposition of the two patterns.

Refer to caption
Figure 5.7: The pattern produced by adding N=640000N=640000 grains each at (760,0-760,0) and (760,0760,0) on the F-lattice with the initial checkerboard distribution of grains and relaxing. This corresponds to ro=0.95r_{o}=0.95. Color code red=0 and yellow=1. (Details can be seen in the electronic version using zoom in )
Refer to caption
Figure 5.8: The pattern constructed by combining two single source patterns and drawing connecting lines between few patches following the connectivity in the pattern in Fig.5.7.

As noted before, the adjacency graph for the single source pattern has a square lattice structure on a Riemann surface of two-sheets [myepl]. Then the graph for two non-intersecting single source patterns is a square lattice on two disjoint Riemann surfaces, each having two-sheets (Fig.5.9). Only the vertex at the origin represents the exterior of the pattern, which is the same for both of the single source patterns. It has sixteen neighbors and is placed midway between the two Riemann surfaces. For later convenience let us associate the lower Riemann surface to the pattern around the left source at 𝐫o-\mathbf{r}_{o} and denote it by ΓL\Gamma_{L}. Similarly the upper Riemann surface as ΓR\Gamma_{R} corresponding to the pattern around the right source 𝐫o\mathbf{r}_{o}.

For 0<ro<10<r_{o}<1, the two single source patterns overlap. Using the abelian property, we first topple as if the second source were absent. The resulting pattern still has some unstable sites in the region where the patterns overlap. Further relaxing these sites transfers these excess grains outward, and changes the dimensions and positions of the patches: some patches become bigger, some may merge, and sometimes a patch may break into two disjoint patches.

The pattern produced with two sources with r0=0.95r_{0}=0.95 is shown in Fig.5.7. We see that there are still only two types of periodic patches, corresponding to Δρ(𝐫)\Delta\rho(\mathbf{r}) values 0 and 1/21/2, and the slope of the boundaries between patches takes the values 0, ±1\pm 1 or \infty.

The relaxation due to overlap changes the adjacency graph from the case with no overlap. This modified adjacency graph, for ror_{o} in the range 0.700.70 to 1.001.00, is shown in Fig.5.10. For r0r_{0} just below 11, these changes are few and are listed below.

Refer to caption
Figure 5.9: Representation of the adjacency graph of the patches for two non-overlapping single source patterns as a square grid on two Riemann surfaces each of two-sheets. The vertices with same (m,n)(m,n) coordinates on different sheets are represented by different colors.
Refer to caption
Figure 5.10: The adjacency graph for two intersecting single source patterns around two sites of addition placed at a distance 2𝐫o2\mathbf{r}_{o} from each other. The graph has the structure of square grids on four Riemann sheets except for a finite number of vertices indicated by the alphabates AA, BB, OO, OO^{\prime}, O′′O^{\prime\prime} and DD shown placed in the middle layer. This graph remains unchanged for ror_{o} in the range 0.700.70 to 1.001.00.

(i) We note that the patches labelled AA and AA^{\prime} in Fig.5.8 have the same ξ\xi and η\eta dependence of the potential function ϕ\phi. Then, for r0r_{0} just below 11, these patterns can join with each other by a thin strip. This only requires a small movement in the boundaries of nearby patches ( i.e. only a small change in the dd and ee values of nearby patches). Thus, in the adjacency graph, the vertices corresponding to AA and AA^{\prime} are collapsed into a single vertex AA in Fig.5.10.

(ii) Similarly, the vertices corresponding to the patches BB and BB^{\prime} in Fig.5.8 are collapsed into a single vertex BB in Fig.5.10.

(iii) This divides the region outside the pattern in to three parts, OO, OO^{\prime} and O′′O^{\prime\prime}. They are also shown in Fig.5.10 as separate vertices.

(iv) The patches marked CC and CC^{\prime} also have the same quadratic form, and the vertical boundary between them disappears. However, the patches DD and DD^{\prime} are also joined by a thin strip. This horizontal strip divides the joined CC and CC^{\prime} into two again (Fig.5.8).

The adjacency of other patches remains unchanged. The adjacency graph of the pattern is shown in Fig.5.10. Interestingly, this new adjacency graph remains the same for all 0.70<r0<10.70<r_{0}<1, even though for ro<0.85r_{o}<0.85, the sizes of different patches are substantially different. Compare the pattern for r0=0.70r_{0}=0.70 in Fig.5.11, with the pattern for r0=0.95r_{0}=0.95 in Fig.5.7: The shape of the central patches in Fig.5.11 is different from that in Fig.5.7.

In Fig.5.10, we have have placed the vertices which are formed by merging or dividing the patches, midway between the Riemann sheets corresponding to the two sources. As r0r_{0} is decreased below 0.700.70, more collisions between the growing patches will occur and the number of vertices in this middle region will increase. For any nonzero r0r_{0}, the number of vertices in the middle layer is finite. In the ro0r_{o}\rightarrow 0 limit, vertices from both the surfaces ΓL\Gamma_{L} and ΓR\Gamma_{R} come together and form a single Riemann surface corresponding to a single source pattern around 𝐫=0\mathbf{r}=0. For r0r_{0} small, but greater than zero, the outer patches are arranged as in the single-source case, but closer to the sources, one has a crowded pattern near each source. In the adjacency graph, this corresponds to the vertices near the patch (0,0)(0,0) roughly arranged as on a Riemann surface of two-sheets, while the ones farther from the patch (0,0)(0,0) remain undisturbed on the 4-sheeted Riemann surface.

Refer to caption
Figure 5.11: The pattern produced by adding 640000640000 grains at site (600,0)\left(-600,0\right) and (600,0)\left(600,0\right). Although the pattern is significantly different from the one in Fig.5.7, their adjacency graph is same.

We now characterize the pattern with two sources and r0>0.70r_{0}>0.70 in detail by explicitly determining the potential function on this adjacency graph.

The Poisson equation analogous to Eq.(4.3) for this problem is

2ϕ(𝐫)=Δρ(𝐫)NΛ2δ(𝐫𝐫o)NΛ2δ(𝐫+𝐫o).\nabla^{2}\phi(\mathbf{r})=\Delta\rho(\mathbf{r})-\frac{N}{\Lambda^{2}}\delta(\mathbf{r}-\mathbf{r}_{o})-\frac{N}{\Lambda^{2}}\delta(\mathbf{r}+\mathbf{r}_{o}). (5.43)

Let us use the same quadratic form of the potential function given in equation (5.36) and equation (5.37).

Again using the same argument given in [myepl], it can be shown that mm and nn are the coordinates of the patches in both the adjacency graphs in Figs.5.9 and 5.10. These coordinates are shown next to each vertex. Also, on this graph, the function D(m,n)=d(m,n)+ie(m,n)D(m,n)=d(m,n)+ie(m,n) satisfies the discrete Laplace equation

mnD(m,n)4D(m,n)=0,\sum_{m^{\prime}}\sum_{n^{\prime}}D(m^{\prime},n^{\prime})-4D(m,n)=0, (5.44)

where (m,n)\left(m^{\prime},n^{\prime}\right) denote the neighbors of (m,n)\left(m,n\right) in the odd or even sublattice [duffin]. Let us define zo=ξo+iηoz_{o}=\xi_{o}+i\eta_{o} where (ξo,ηo)(\xi_{o},\eta_{o}) and (ξo,ηo)(-\xi_{o},-\eta_{o}) are the coordinates corresponding to 𝐫o\mathbf{r}_{o} and 𝐫o-\mathbf{r}_{o}. Considering that close to 𝐫o\mathbf{r}_{o} and 𝐫o-\mathbf{r}_{o} the potential ϕ(𝐫)\phi\left(\mathbf{r}\right) diverges logarithmically it can be shown (as done for single source pattern in [myepl]) that for large |M||M|,

D(m,n)\displaystyle D(m,n) =\displaystyle= z¯oM4±A2πM+lowerorderinM,onΓL\displaystyle\bar{z}_{o}\frac{M}{4}\pm\frac{A}{\sqrt{2\pi}}\sqrt{M}+\rm{lower~order~in~}M\rm{,~on~}\Gamma_{L} (5.45)
=\displaystyle= z¯oM4±A2πM+lowerorderinM,onΓR\displaystyle-\bar{z}_{o}\frac{M}{4}\pm\frac{A}{\sqrt{2\pi}}\sqrt{M}+\rm{lower~order~in~}M\rm{,~on~}\Gamma_{R}

where AA is a constant independent of NN or Λ\Lambda. The solution of the equation (5.44) with the boundary condition D(0,0)=0D(0,0)=0 and that in equation (5.45) for large |M||M| determines the final pattern.

5.7  Numerical analysis

In both the examples in section 66 and 77 the patterns are characterized in terms of the solution of the standard two dimensional lattice Laplace equation on the corresponding adjacency graphs. The solution is well-known when (m,n)2\left(m,n\right)\in\mathbb{Z}^{2} [spitzer]. In our case where the lattice sites form surfaces of multiple sheets, we have not been able to find a closed-form expression for D(m,n)D(m,n). However, the solutions can be determined numerically to very good precision by solving it on a finite grid Lm,nL-L\leq m,n\leq L with the corresponding boundary conditions imposed exactly at the boundary.

For the pattern with the line sink, the calculation is performed with D=M2/3D=M^{2/3} at the boundary and then the solution is normalized to have d(1,0)=1d\left(1,0\right)=-1. We determined dd and ee numerically for L=100L=100, 200200, 300300, 400400 and 500500 and extrapolated our results for LL\rightarrow\infty. Comparison of the results from this numerical calculation and that obtained by measurements on the pattern is presented in Table 11. We consider the four different lengths R1R_{1}, R2R_{2}, R3R_{3} and R4R_{4} as defined in Fig.5.12. By the definition of the diameter of the pattern R1=2ΛR_{1}=2\Lambda. We present the values of R2R_{2}, R3R_{3} and R4R_{4} normalized by R1R_{1} for different NN. The asymptotic values of these lengths are determined from the values of dd and ee. Comparison of these results shows very good agreement between the theoretical and the measured values.

Refer to caption
Figure 5.12: The spatial lengths R1R_{1}, R2R_{2}, R3R_{3} and R4R_{4} tabulated in Table 11.
 N 896k896k 14336k14336k 57344k57344k 229376k229376k Theoretical
R2/R1R_{2}/R_{1} 0.769 0.768 0.770 0.770 0.7698
R3/R1R_{3}/R_{1} 0.675 0.675 0.667 0.668 0.6666
R4/R1R_{4}/R_{1} 0.609 0.609 0.617 0.616 0.6172
Table 5.1: Comparison of different lengths measured directly from the pattern in Fig.5.12 for increasing values of NN, with their theoretical values.

A similar numerical calculation is done for the pattern with two sources. In this case the boundary condition is given by equation (5.45). The value of AA is determined from a self consistency condition that the diameter of the pattern in the reduced coordinate is 22 which imposes 2e(1,0)=12e(-1,0)=-1 corresponding to the vertex AA in Fig.5.10. We determined dd and ee numerically for L=100L=100, 200200, 300300, 400400 and 500500 and extrapolated our results for LL\rightarrow\infty. A comparison of the results from this numerical calculation and that obtained by measurements on the pattern are presented in Table 22. We considered five different spatial lengths in the pattern, corresponding to ro=0.800r_{o}=0.800. These different lengths are drawn in Fig.5.13 and their values rescaled by N\sqrt{N}, for the patterns with increasing NN, are given in Table 22. The asymptotic values of these lengths are obtained using the values of dd and ee. The rescaled lengths extrapolated to the infinite NN limit match very well with the theoretical results.

Refer to caption
Figure 5.13: The spatial lengths R1R_{1}, R2R_{2}, R3R_{3}, R4R_{4} and R5R_{5} tabulated in Table.22
 N 2.5k2.5k 10k10k 40k40k 160k160k 640k640k Theoretical
R1/NR_{1}/\sqrt{N} 1.84 1.84 1.84 1.83 1.83 1.82
R2/NR_{2}/\sqrt{N} 1.06 1.07 1.07 1.06 1.05 1.06
R3/NR_{3}/\sqrt{N} 0.22 0.21 0.20 0.19 0.18 0.18
R4/NR_{4}/\sqrt{N} 0.18 0.19 0.19 0.18 0.18 0.18
R5/NR_{5}/\sqrt{N} 0.20 0.22 0.21 0.21 0.21 0.21
Table 5.2: Comparison of different lengths measured directly from the two source pattern for ro=0.800r_{o}=0.800 with their theoretical values.

5.8  Discussion

While the results discussed in quantifying the patterns with growing sandpiles are presumably exact (in the sense that D(m,n)D\left(m,n\right) can be determined to arbitrary precision), they have not been established rigorously. In particular, as noted before, it would be desirable to have a direct proof of the proportional growth property from the definition of the problem. Also, we use the observation that the asymptotic pattern consists of only two types of patches, and the adjacency graph of the pattern is also taken as observed. It would be nice to see it following from the definition of the problem. The unexpected accuracy of the scaling arguments giving Eqs. (3434, 3636, 3737, 3838) also deserves to be understood better.

We have shown that the exact characterization of the patterns in the F-lattice on a checkerboard background reduces to solving a discrete Laplace equation on the adjacency graph of the pattern. For the single source pattern this graph is a square grid on a two-sheeted Riemann surface and in the presence of a line sink it is on a three-sheeted Riemann surface. This Riemann surface structure occurs for other sink geometries as well and the number of sheets can be determined from the way ϕ\phi diverges near the origin.

If the potential ϕ(r)\phi(r) diverges as rar^{-a} near the origin, then the corresponding complex function Φ(z)za\Phi(z)\sim z^{-a}. Then d2dz2Φz2a\frac{d^{2}}{dz^{2}}\Phi\sim z^{-2-a}. In all the cases studied above, the patch to which point zz belongs is characterized by integers (m,n)(m,n), where d2dz2Φm+in\frac{d^{2}}{dz^{2}}\Phi\sim m+in. Also ddzΦd+ie\frac{d}{dz}\Phi\sim d+ie. Writing D=d+ieD=d+ie, and M=m+inM=m+in, we see that DM1+a2+aD\sim M^{\frac{1+a}{2+a}}. This then gives the number of Riemann sheets. For example, for the wedge angle ω=2π\omega=2\pi, we have a=1/2a=1/2. Then DM3/5D\sim M^{3/5}, and the Riemann surface would have 5 sheets.

Refer to caption
Figure 5.14: Pattern produced by adding N=40000N=40000 grains each at (180,0-180,0) and (180,20180,20) on the F-lattice with initial checkerboard distribution of grains and relaxing. Color code red=0 and yellow=1. (Details can be seen in the online version using zoom in )

The patterns discussed so far in this chapter have only two types of patches with densities 1/21/2 and 11. But it is possible to have patterns with patches of other densities. For example, for the patterns with two sources, even a slight deviation of the position of the second source in Fig.5.7 from the x-axis introduces patches which have areal density different from 1/21/2 or 11. One such pattern produced by adding 4000040000 grains each at (180,0)\left(-180,0\right) and (180,20)\left(180,20\right) is shown in Fig.5.14. The regions with stripes of red and yellow are patches of the new density. In addition, the boundaries of these patches have slopes other than 0, ±1\pm 1 and \infty. Most of the analysis presented here is appilcable to this pattern, except that the matching conditions along the common boundary between two patches and the adjacency graph are different.

The cases in which the full pattern can be explicitly determined are clearly special. For example, one of the conditions used for the exact characterization of the patterns in this chapter is that inside each patch the height variables are periodic and hence Δρ(𝐫)\Delta\rho\left(\mathbf{r}\right) is constant. It is easy to check that this condition is not met for most sink geometries. For example, patterns of the type discussed in Section 44 with any ω\omega other than integer multiples of π/4\pi/4 have aperiodic patches. In such cases, the present treatment for characterization of patterns is clearly not applicable. However, the scaling analysis for the growth of the spatial lengths in the pattern with NN is still valid.

The function D=d+ieD=d+ie satisfies the discrete Cauchy-Riemann condition (equation (5.38)). These functions are known as discrete holomorphic functions in the mathematics literature. Usually they have been studied for a square grid of points on the plane [duffin, spitzer]. While more general discretizations of the plane have been discussed [mercat, laszlo], not much is known about the behavior of such functions for multi-sheeted Riemann surfaces. A perturbative approach of determining these functions for square discretization of multi-sheeted Riemann surface is presented in the Appendix B.

In our analysis we have also used the fact that the patterns have nonzero average overall excess density ( i.e. C2C_{2} in Eq. (5.7) is nonzero). The case C2=0C_{2}=0 is quite different, and requires a substantially different treatment. We discuss such patterns in the next chapter.

Chapter 6 Pattern Formation in Fast-Growing Sandpiles

Based on the paper [myjsm] by Tridib Sadhu and Deepak Dhar.

  • Abstract

    We study the patterns formed by adding NN sand-grains at a single site on an initial periodic background in the Abelian sandpile models, and relaxing the configuration. When the heights at all sites in the initial background are low enough, one gets patterns showing proportionate growth, with the diameter of the pattern formed growing as N1/dN^{1/d} for large NN, in dd-dimensions. On the other hand, if sites with maximum stable height in the starting configuration form an infinite cluster, we get avalanches that do not stop. In this chapter, we describe our unexpected finding of an interesting class of backgrounds in two dimensions, that show an intermediate behavior: For any NN, the avalanches are finite, but the diameter of the pattern increases as NαN^{\alpha}, for large NN, with 1/2<α11/2<\alpha\leq 1. Different values of α\alpha can be realized on different backgrounds, and the patterns still show proportionate growth. The non-compact nature of growth simplifies their analysis significantly. We characterize the asymptotic pattern exactly for one illustrative example with α=1\alpha=1.

6.1  Introduction

In the last two chapters, we studied the patterns produced by adding grains at a single site in a Deterministic Abelian Sandpile Model (DASM), and relaxing. A complete relaxation process, starting from the addition of sand to reaching the final stable configuration is called an avalanche. The length of an avalanche depends on the initial height configuration, i e., the background. For some backgrounds on an infinite lattice, topplings may continue for ever, and the avalanches reach to infinity. For other backgrounds, where the avalanches are finite, the toppled sites form patterns in the spatial configuration of sites with different values of the height variables.

The backgrounds leading to infinite avalanches have been termed as explosive.

Refer to caption
Figure 6.1: A directed triangular lattice.

In the other backgrounds with finite avalanches the diameter of the pattern usually grows as N1/dN^{1/d} with increasing number of added grains in dd-dimensions. We call this type of growth as compact growth. All the patterns studied so far showed compact growth. In this chapter, we describe a remarkable class of patterns where the diameter remains finite for any finite NN, but grows as NαN^{\alpha}, with 1/d<α11/d<\alpha\leq 1. We call this type of growth as non-compact growth. Characterization of these patterns, as will be shown, is simpler than the ones with compact growth.

For a sandpile model with stochastic toppling rule, the size of the pattern is determined only by the density ρo\rho_{o} of heights in the background, and the specific arrangement of heights does not matter. There exist a critical density ρc\rho_{c}, depending on the toppling rules, such that, on a background with sub-critical density ρo<ρc\rho_{o}<\rho_{c}, finite avalanches occur with probability 11. The corresponding asymptotic pattern is a simple circle, with density ρ=ρc\rho=\rho_{c}, inside, and the diameter 2Λ2\Lambda of the circle growing as N\sqrt{N}. For densities ρo>ρc\rho_{o}>\rho_{c}, probability of finite avalanches vanishes in the large NN limit.

For a deterministic sandpile a similar critical density can not be defined. One can construct backgrounds with densities very close to zero, and still there are infinite avalanches. A simple example of such backgrounds, on any lattice, is the one where the sites with height zc1z_{c}-1 form an infinite connected cluster, with zcz_{c} being the threshold height. Height at other sites could be zero, and thus the density ρo\rho_{o} of the background could be made very small. On the other hand, it is possible to construct backgrounds with mean density arbitrarily close to zc1z_{c}-1, and yet the avalanches are always finite LABEL:explosion. Absence of an infinite avalanche depends on the detailed arrangement of heights in the background, and not on the density alone.

Refer to caption
Refer to caption
Figure 6.2: Examples of the background of class I and II, respectively. The filled circles represent height 11 and unfilled ones 22.

There are some earlier work on the growth rate of the sandpile patterns. Some backgrounds of both types, explosive and non-explosive, for a deterministic ASM were studied in [explosion, fey]. In all the examples, studied so far, the background is either explosive or the growth of the patterns is compact. For a deterministic ASM on a square lattice, it was shown [fey], that the pattern produced on a background of constant height zzc2z\leq z_{c}-2, is always enclosed inside a square whose width grows as N\sqrt{N}. Given the absence of any critical density, it is non-trivial to find a background on which the patterns grow with a rate faster than N\sqrt{N}, but finite. In fact, for the sandpile models on a standard square lattice there are no known examples of patterns with non-compact growth.

Refer to caption
Figure 6.3: (color in the electronic copy) The pattern formed on the background in figure 6.2(a)(a)by adding NN particles respectively at the origin. Details can be viewed in the electronic version using zoom in.
Refer to caption
Figure 6.4: (color in the electronic copy) The pattern formed on the background in figure 6.2(b)(b) by adding NN particles respectively at the origin. Details can be viewed in the electronic version using zoom in.

We found two classes of backgrounds, both infinite, on a directed triangular lattice (see Fig. 6.1), for which the growth is proportionate, with the growth exponent α=1\alpha=1. Examples of these classes of backgrounds and patterns formed on them are shown in Fig. 6.2, Fig. 6.3 and Fig. 6.4. Our numerical study shows, but we have no formal proof, that different backgrounds belonging to the same class produce the same asymptotic pattern. In addition, we found infinitely many backgrounds on the F-lattice which produce patterns with proportionate non-compact growth. However, in these cases the growth exponent α\alpha takes a different value, with 1/2<α<11/2<\alpha<1 for each member.

We also discuss the exact characterization of the pattern shown in Fig. 6.3, one of the two asymptotic patterns we have found with α=1\alpha=1. This is described, as in the earlier studied case of compact growth (see previous chapters), in terms of the scaled toppling function. However, the analysis of non-compact patterns is actually simpler. Clearly, for α>1/d\alpha>1/d, the mean excess density of particles in the toppled region is zero, in the asymptotic patterns. Infact, the patterns are made of large patches where heights are periodic, and inside each patch, the mean density is exactly the same as in the background, and the excess grains are concentrated along the patch boundaries. There are also some boundaries where excess grains density is negative. We show that this leads to the scaled toppling function being a piece-wise linear function of the rescaled coordinates. Thus, in each patch, the potential function is specified by only three coefficients. In contrast, for the compact patterns discussed in chapters 4 and 5, the scaled toppling function is a quadratic function of the coordinates in each patch, and one has to determine six coefficients for each patch, to determine the function fully.

We are able to reduce the problem of determining the asymptotic pattern in Fig. 6.3 to that of finding the lattice Green’s function on a hexagonal lattice. This is known to be expressible as integrals that can be evaluated in closed form (see Appendix A), and this leads to a full solution of the problem. This is in contrast to the characterization of the compact growth patterns in previous chapters, where one requires solution of Discrete Laplace’s equation on a square grid on Riemann surfaces of multiple sheets, and there are no known closed form expression for the solution.

This chapter is organized as follows: In section 6.2, we discuss, in details, how different periodic background configurations give rise to different rates of growth. In section 6.3 we define a deterministic ASM on the directed triangular lattice, and describe the two classes of periodic backgrounds that produces patterns with non-compact growth. In section 6.4 we argue that, for any pattern with non-compact proportionate growth the rescaled toppling function is piece-wise linear. In section 6.5, we discuss exact characterization of the simplest of the non-compact growth patterns with α=1\alpha=1. Patterns on the F-lattice, with 1/2<α<11/2<\alpha<1 are discussed in section 6.6. The section 6.7 contains some discussion about connection to tropical polynomials.

6.2  Compact and non-compact growth

The simplest growing patterns are found in the Manna-type sandpile models with stochastic toppling rules [sasm]. In these models, when the density of particles ρo\rho_{o} in the background is small, the avalanches are always finite. In the relaxed configuration, the toppled sites form a nearly circular region (see Fig. 6.5). The asymptotic pattern seems to be perfectly circular disc of uniform density, with an average density ρ\rho^{\star} inside the circle and ρo\rho_{o} outside. The value of ρ\rho^{\star} is independent of the background density ρo\rho_{o}, and is equal to the unique steady state density of the corresponding self organized critical model with random sites of addition, and dissipation at the boundary [sasm]. The region inside the circle forgets about the initial height configuration, and is in the self-organized critical state. The boundary of the affected region is thin with a sharp transition of density from ρ\rho^{\star} to ρo\rho_{o} (see Fig. 6.6). Then considering that, for large NN, all the added grains are confined inside the circular region of diameter 2Λ2\Lambda, we get

N=(ρρo)πΛ2+LowerorderinΛ.N=\left(\rho^{\star}-\rho_{o}\right)\pi\Lambda^{2}+\rm{Lower~order~in~}\Lambda. (6.1)

Thus the pattern has a compact growth.

For densities ρo\rho_{o} close to, but below ρ\rho^{\star}, sometimes a single particle addition can lead to very large increase in the size of the toppled region. However, probability of such large jumps decreases exponentially with size, and for any finite NN, with probability 11, avalanches remain finite. As long as ρo\rho_{o} is less than ρ\rho^{\star}, the system relaxes, forming a pattern whose diameter grows as N\sqrt{N}. Adding a single grain on a background of super-critical density (ρ>ρ\rho>\rho^{\star}) gives rise to infinite avalanches, with non-zero probability. Then, with probability 11, such backgrounds will lead to an infinite avalanche for some finite value of NN. In higher dimensions also, a similar behavior is expected.

Refer to caption
Figure 6.5: The pattern produced by adding N=105N=10^{5} grains at a single site on a stochastic ASM defined on an infinite square lattice and relaxing; Initial configuration with all sites empty. The threshold height zc=2z_{c}=2, and on toppling two grains are transfered either to the vertical or horizontal neighbors, with equal probability. Color code: White=0, and Black=1.
Refer to caption
Figure 6.6: The variation of density ρ\rho along the radius of the circular pattern in Fig. 6.5.

At ρo=ρc\rho_{o}=\rho_{c} the probability of large avalanches has a power law tail, and the above argument does not apply. It may be possible to construct a robust background with critical density of heights. However, no such example has been found, so far.

In the models with deterministic relaxation rules there is no well defined critical density ρc\rho_{c}, separating the explosive and non-explosive backgrounds. The geometry of height distribution plays the determining role in the robustness of a background.

In the deterministic models, similar circular pattern is produced for a background with random assignment of heights zzcz\leq z_{c} per site, of small average density ρo\rho_{o}. Inside the pattern, density of heights is ρs\rho_{s} which is the steady state density of the corresponding SOC model. However, on a background of higher densities, this picture is changed considerably. For example consider the BTW model on a square lattice, where the steady state density ρs=17/8=2.125\rho_{s}=17/8=2.125. It has been shown that a background with a random assignment of height 33 with probability ϵ\epsilon, on a sea of constant height 22 is explosive, even for arbitrary small value of ϵ\epsilon [explosion], although the average density ρo=2+ϵ\rho_{o}=2+\epsilon is much less than ρs\rho_{s}.

For a background with periodic heights, it is possible to construct explosive backgrounds of any density, even with arbitrary small values. As an example, we consider the BTW model on an infinite square lattice. Define a background made of square unit cells of width mm with empty sites inside the cell, and 33 grains at each site in the boundary. For m>1m>1, the average density ρo=6/m9/m2\rho_{o}=6/m-9/m^{2}. If any of the occupied site receives a grain, it starts a chain of toppling events where all the occupied sites topple, and the avalanche reaches infinity.

On the other hand a constant background of height 33 at all sites is a minimally stable configuration i.e, addition of a single grain will produce an infinite avalanche. Still, it is possible to construct a robust background with density arbitrarily close to 33. For example, consider the background in the previous example, and exchange the height variables: make the occupied sites empty, and fill the empty sites with 33 grains. It has been shown [explosion], that this background is stable and the pattern produced has a compact growth.

We will show in the next section that, there is a large class of backgrounds, with a range of densities, for which the growth is less than explosive, but more than compact.

6.3  Examples of non-compact growth

We first discuss the patterns with α=1\alpha=1. We start with an ASM on a directed graph corresponding to an infinite two dimensional triangular lattice, with each site having three incoming and three outgoing arrows (see Fig. 6.1). The threshold height zc=3z_{c}=3, for each site. If the height at any site is above or equal to zcz_{c}, it is unstable, and relaxes by toppling: in each toppling, three sand grains leave the unstable site, and are transferred one each along the directed bonds going out of the site.

We consider two classes of backgrounds on this lattice:

  • Class II: We consider the lattice as made of triangular plaquettes, which are joined together to make tiles in the shape of regular hexagons with edges of length ll. We cover the two-dimensional plane with these tiles. Sites that lie on the boundaries of these hexagons are assigned height 11, and the rest of the sites have height 22. Figure 6.2(a)(a) shows the background configuration for the case l=2l=2.

  • Class IIII: For these backgrounds, we cover the two-dimensional plane with tiles in the shape of equilateral triangles of edge-length ll. The sites that lie on the boundaries of the triangles, and are shared by two triangles, are assigned height 11, and remaining sites are assigned height 22. Sites that are at the corners of triangular tiles, and shared by six of them, are also assigned heights 22. The background configuration corresponding to l=4l=4 is shown in figure 6.2(b)(b). The pattern made of triangular tiles with l=3l=3 is same as the class I background with hexagon of edge-length 11. Hence, only patterns formed with triangles of edge-length l4l\geq 4 will be said to be in this class.

The patterns produced by adding NN grains, where NN is large, at a single site on the two backgrounds in Fig. 6.2 are shown in Fig. 6.3 and 6.4. While the patterns look quite similar, a closer examination shows that they are not identical. In Fig. 6.4, there are extra lines of particles within the brownish patches which break each patch into smaller parts. In fact, with the identification of some patches having only a point in common, as discussed later, we can show that each patch breaks into exactly three patches. These three parts have similar periodic pattern, but with different orientations.

Refer to caption
Refer to caption
Figure 6.7: The patterns in terms of Q(r)Q\left(r\right), corresponding to those in Fig. 6.3 and 6.4. Sites with zero Q(r)Q\left(r\right) are colored white, and non-zero are colored black. The larger patches are given identifying labels.

This differences can be seen more clearly in terms of the net excess change in height Q(R){Q\left(R\right)} in a unit cell centered at RR, where the unit cell is that of the background pattern.

Q(R)=Runit cellΔz(R+R),Q\left(R\right)=\sum_{R^{\prime}\in\textrm{unit cell}}\Delta z(R+R^{\prime}), (6.2)

where Δz(R)\Delta z\left(R\right) is the change in height at site RR. For example in the first background in Fig. 6.2 a unit cell is a hexagon of edge length l=2l=2, and for the second background it is a parallelogram of each side length l=4l=4. A site that is on the edge of the unit cell is counted with weight 1/21/2, and a site on the corner of the hexagon with weight 1/31/3, and on the corner of the parallelogram with weight 1/41/4. By construction, the function Q(r)Q\left(r\right) is zero inside each patch, and non-zero along the boundaries between patches. The patterns in terms of these variables, corresponding to those in Fig. 6.3 and 6.4 are shown in Fig. 6.7.

Refer to caption
Figure 6.8: (color in the electronic copy) The diameter 2Λ2\Lambda of the patterns as a function of the number NN of added grains. The cases shown are (i) Class I, l=1l=1, (ii) Class II, l=2l=2, and (iii) Class IIII, l=4l=4. The corresponding straight line fits have slopes given by 1.11.1, 2.72.7 and 1.71.7 respectively.

We have seen that the patterns on these two classes of backgrounds exhibit proportionate growth, i.e., all the spatial features inside the patterns for large NN, grow at the same rate with the diameter. We define the diameter 2Λ2\Lambda, in general, for any pattern in this paper, as the height of the smallest rectangle containing it. For the patterns in Fig. 6.3 and Fig. 6.4, it is then the length of a side of the bounding equilateral triangle. This particular choice makes 2Λ2\Lambda as an integer multiple of 3\sqrt{3}, on the triangular lattice. We find that for both types of backgrounds in Fig. 6.2, the diameter of the pattern grows linearly with NN (Fig. 6.8).

6.4  Piece-wise linearity of the toppling function

Considering the proportionate growth, let us define a rescaled coordinate r=R/Nα\vec{r}=\vec{R}/N^{\alpha}, where R(x,y)\vec{R}\equiv\left(x,y\right) is the position vector of a site on the lattice. The number of topplings at any site inside the pattern, scales linearly with NN. Let us define

ϕ(r)=limNTN(R)N.\phi\left(\vec{r}\right)=\lim_{N\rightarrow\infty}\frac{T_{N}(\vec{R})}{N}. (6.3)

We now show, using an extension of the argument given in chapter 4, that the function ϕ\phi is linear inside periodic patches in all the patterns with non-compact growth, i.e., with α>1/2\alpha>1/2. Within a patch, the function ϕ(r)\phi(\vec{r}) is expandable in Taylor series around any point ro\vec{r}_{o}, not on the boundary of the patch. Defining ro(ξo,ηo)\vec{r}_{o}\equiv\left(\xi_{o},\eta_{o}\right), and Δro(Δξ,Δη)\Delta\vec{r}_{o}\equiv\left(\Delta\xi,\Delta\eta\right) we have

ϕ(ξo+Δξ,ηo+Δη)ϕ(ξo,ηo)=dΔξ+eΔη+𝒪(Δξ2,Δη2,ΔξΔη).\phi\left(\xi_{o}+\Delta\xi,\eta_{o}+\Delta\eta\right)-\phi\left(\xi_{o},\eta_{o}\right)=d\Delta\xi+e\Delta\eta+\mathcal{O}\left(\Delta\xi^{2},\Delta\eta^{2},\Delta\xi\Delta\eta\right). (6.4)

Consider any term of order 2\geq 2 in the expansion, for example, the term (Δξ)2\sim(\Delta\xi)^{2}. This can only arise due to a term (Δx)2N12α\sim(\Delta x)^{2}N^{1-2\alpha} in the toppling function TN(R)T_{N}(\vec{R}). Then, considering the fact that TN(R)T_{N}(\vec{R}) is an integer function of xx and yy, it is easy to see that this term would lead to discontinuous changes in TN(R)T_{N}(\vec{R}) at intervals of Δx𝒪(Nα1/2)\Delta x\sim\mathcal{O}(N^{\alpha-1/2}). As α>1/2\alpha>1/2 for non-compact growth patterns, this leads to a change in the periodicity of heights at such intervals inside each patch which themselves are of size Nα\sim N^{\alpha}. This would then result in many defect lines within a patch, in the pattern at large NN. However there are no such features in Fig. 6.10. Therefore inside each periodic patch, ϕ(r)\phi(\vec{r}) must be exactly linear in r\vec{r}. In fact, it turns out that the integer toppling function TN(R)T_{N}(\vec{R}) is exactly linear inside a patch even for any finite NN, except for an additional periodic term of periodicity equal to that of the heights inside the patch.

Refer to caption
Figure 6.9: The background of class I corresponding to l=1l=1. The filled circles represent height z=1z=1 and unfilled ones z=2z=2.

Another consequence of the exact linearity of the potential function in each patch is that all patch boundaries in the asymptotic pattern are straight lines.

The argument finally relies on the two observed (not rigorously established) features of the patterns, i.e., there is proportionate growth, and that the patterns can be decomposed in terms of periodic patches which are themselves of size 𝒪(Nα)\mathcal{O}\left(N^{\alpha}\right).

Refer to caption
Figure 6.10: (color in the electronic copy) The pattern produced by adding N=3760N=3760 grains at a single site on the background in Fig. 6.9, and relaxing. Details can be seen in the electronic copy using zoom-in

Let us write the toppling function TN(R)T_{N}(\vec{R}) within a single patch PP as

TN(R)=AP+KPR+Tperiodic(R),T_{N}(\vec{R})=A_{P}+\vec{K}_{P}\cdot\vec{R}+T_{periodic}(\vec{R}), (6.5)

where Tperiodic(R)T_{periodic}(\vec{R}) is a periodic function of its argument with zero mean value. If e^1\hat{e}_{1} and e^2\hat{e}_{2} are the basis vectors at the unit cell of the periodic pattern then we have

TN(R+e^1)TN(R)\displaystyle T_{N}(\vec{R}+\hat{e}_{1})-T_{N}(\vec{R}) =\displaystyle= KPe^1,\displaystyle\vec{K}_{P}\cdot\hat{e}_{1},
TN(R+e^2)TN(R)\displaystyle T_{N}(\vec{R}+\hat{e}_{2})-T_{N}(\vec{R}) =\displaystyle= KPe^2.\displaystyle\vec{K}_{P}\cdot\hat{e}_{2}. (6.6)

As TN(R)T_{N}(\vec{R}) are integer valued functions, KPe^1\vec{K}_{P}\cdot\hat{e}_{1} and KPe^2\vec{K}_{P}\cdot\hat{e}_{2} can only take integer values. If g^1\hat{g}_{1} and g^2\hat{g}_{2} are the unit vectors in the reciprocal space of the super lattice of the periodic pattern,

g^ie^j=δij i,j=1,2,\hat{g}_{i}\cdot\hat{e}_{j}=\delta_{ij}\textrm{~ ~ ~ ~ }i,j=1,2, (6.7)

then KP\vec{K}_{P} must be an integer linear combination of g^1\hat{g}_{1} and g^2\hat{g}_{2}, and can be written as

KP=n1g^1+n2g^2,\vec{K}_{P}=n_{1}\hat{g}_{1}+n_{2}\hat{g}_{2}, (6.8)

where n1n_{1} and n2n_{2} are some integers. For example, in the background pattern in Fig. 6.9, a choice of the basis vectors and its reciprocal vectors is

e^1(32,32);\displaystyle\hat{e}_{1}\equiv\left(\frac{3}{2},\frac{\sqrt{3}}{2}\right); e^2(32,32)\displaystyle\mathrm{~~~~~}\hat{e}_{2}\equiv\left(\frac{3}{2},-\frac{\sqrt{3}}{2}\right)
g^123(12,32);\displaystyle\hat{g}_{1}\equiv\frac{2}{3}\left(-\frac{1}{2},-\frac{\sqrt{3}}{2}\right); g^223(12,32).\displaystyle\mathrm{~~~~~}\hat{g}_{2}\equiv\frac{2}{3}\left(-\frac{1}{2},\frac{\sqrt{3}}{2}\right). (6.9)

The fact that KPK_{{}_{P}} is constant inside a patch, implies that the patches can be labeled by the pair of integers (n1,n2)\left(n_{1},n_{2}\right).

An interesting consequence of this linear dependence of TN(R)T_{N}(\vec{R}) is that there are no transient structures within the patches. On increasing NN, if the APA_{{}_{P}} function increases, all sites in the patch PP, except possibly those at the patch boundaries, undergo same number of additional topplings.

6.5  Characterizing the class II asymptotic patterns

We now discuss characterization of the asymptotic pattern of class I, showing α=1\alpha=1. In this section we quantitatively characterize the asymptotic pattern for the case l=1l=1. The background configuration is shown in Fig. 6.9. A site on the triangular lattice can be labeled uniquely by a pair of integers (p,q)\left(p,q\right), such that its position on a complex plane can be written as 𝐑=p+qω\mathbf{R}=p+q\omega, where ω=exp(i2π/3)\omega=\exp\left(i2\pi/3\right) is a complex cube root of unity. Then, the height variables in the background pattern in Fig. 6.9, can be written as

h(p+qω)\displaystyle h(p+q\omega) =\displaystyle= 2 if p+q=0 (mod 3),\displaystyle 2\textrm{ if }p+q=0\textrm{ (mod 3),} (6.10)
=\displaystyle= 1otherwise.\displaystyle 1\rm{~~~otherwise.}

The average height in the background, z=4/3\langle z\rangle=4/3. The configuration of the pile produced on this background, by adding N=3760N=3760 grains at the origin is shown in Fig. 6.10.

Refer to caption
Figure 6.11: (color in the electronic copy) An example of patch boundaries in Fig. 6.10 meeting each other. Each filled hexagon represents Wigner cell around a site, and the color in them denotes height of that site. The color code is same as in Fig. 6.10.

We see that the sites toppled due to addition of the grains are confined within an equilateral triangle. The pattern can be thought of as a union of patches, inside which the heights are periodic. A zoom-in showing the height configuration with five patches meeting at a point is shown in Fig. 6.11. There are only two types of periodic patches seen: one is like the background, where the sites of height 22 are surrounded by sites of height 11, and the other with heights 0 surrounded by heights 22. Then, the average height z\langle z\rangle inside both types of patches are same. In fact, it is equal to that of the background, z=4/3\langle z\rangle=4/3.

The patches in the outer region of the pattern are big, and they become smaller, and more numerous as we go inwards. Along the common boundary of adjacent patches, we see line-like defect structures, and only along these lines the density is different from the background. In Fig. 6.11, one can also see the periodicity of the structures along the patch boundaries. Some patch boundaries, like the horizontal boundary in Fig. 6.11, have a deficit of particles compared to the background.

The boundaries of the patches are seen more clearly in terms of Q(𝐑)Q(\mathbf{R}) variables, as shown in figure 6.7(a), where we have labelled different patches as 𝐀,𝐀,𝐁,𝐁\mathbf{A,A^{\prime},B,B^{\prime}}... etc..

Refer to caption
Figure 6.12: Jmax(N)J_{max}(N) for the background in Fig. 6.9 has a square root dependence on NN with a fitting function 3.25x3.25\sqrt{x}.

.

The dependence of 2Λ2\Lambda on NN for this background is shown in Fig. 6.8. We see that the diameter for the pattern grows asymptotically linearly with NN, but it grows in bursts: it remains constant for a long interval as more and more grains are added, and suddenly increases by a large amount at certain values of NN. For example, at N=3721N=3721, the 2Λ2\Lambda is 227632276\sqrt{3}, and it jumps to a value 240832408\sqrt{3} when one more grain is added. Let Jmax(Nm)J_{max}(N_{m}) denote the size of the maximum jump in 2Λ2\Lambda encountered, as NN is varied from 11 to NmN_{m}. In Fig. 6.12, we have plotted the variation of Jmax(Nm)J_{max}(N_{m}) with NmN_{m}. The graph is consistent with a power-law growth, with a power around 1/21/2. Thus the fractional size of the bursts decreases for large NN.

Refer to caption
Figure 6.13: The adjacency graph of patches in the pattern in Fig. 6.10. The vertices corresponding to the brownish and greenish patches in the pattern are denoted by different colors. The pair of patches labeled by the alphabets and its corresponding primed alphabets in Fig. 6.7(a) are represented by same vertex on the graph.

We define scaled complex coordinates 𝐫=𝐑/N\mathbf{r}=\mathbf{R}/N, where 𝐑=p+qω\mathbf{R}=p+q\omega is the complex coordinate of the site (p,q)\left(p,q\right). We define the rescaled toppling function for this pattern as

ϕ(𝐫)=limN3TN(𝐫N)2N.\phi\left(\mathbf{r}\right)=\lim_{N\rightarrow\infty}\frac{\sqrt{3}T_{N}\left(\mathbf{r}N\right)}{2N}. (6.11)

Then it is easy to see that ϕ=(ξϕ,ηϕ)\nabla\phi=\left(\partial_{\xi}\phi,\partial_{\eta}\phi\right) is equal to the mean flux of particles at 𝐫\mathbf{r}. If we consider a small line element d𝐥(dξ,dη)d\mathbf{l}\equiv\left(d\xi,d\eta\right), then the net flux of particles across the line d𝐥d\mathbf{l} equals Nϕd𝐥N\nabla\phi\cdot d\mathbf{l}. Then, the conservation of sand grains implies that the toppling function TN(𝐑)T_{N}\left(\mathbf{R}\right) satisfies the equation

2TN(𝐑)=δz(𝐑)Nδ(𝐑),\nabla_{\circ}^{2}T_{N}\left(\mathbf{R}\right)=\delta z\left(\mathbf{R}\right)-N\delta\left(\mathbf{R}\right), (6.12)

where 2\nabla_{\circ}^{2} is the finite-difference operator on the lattice, corresponding to the Laplacian 2\nabla^{2}. It is easy to see that this implies that the scaled potential function ϕ\phi satisfies the Poisson equation

2ϕ(𝐫)=Δρ(𝐫)δ(𝐫),\nabla^{2}\phi\left(\mathbf{r}\right)=\Delta\rho\left(\mathbf{r}\right)-\delta\left(\mathbf{r}\right), (6.13)

where Δρ(𝐫)\Delta\rho\left(\mathbf{r}\right) is the areal density of excess grains at 𝐫\mathbf{r}. It is related to Δz(𝐫)\langle\Delta z\left(\mathbf{r}\right)\rangle, the mean excess grain density per site by

Δρ(𝐫)=23Δz(𝐫).\Delta\rho\left(\mathbf{r}\right)=\frac{2}{\sqrt{3}}\langle\Delta z\left(\mathbf{r}\right)\rangle. (6.14)

The piece-wise linearity of ϕ\phi simplifies the analysis of the pattern, significantly. The potential function can be characterized by only three parameters. Using Eq. (6.8), (6.9) and (6.11), for each patch PP, we can find a pair of integers (m,n)\left(m,n\right) such that the potential in patch PP is characterized by

ϕ(𝐫)=123(𝐃m,n𝐫¯+𝐃¯m,nr)+fm,n,\phi\left(\mathbf{r}\right)=-\frac{1}{2\sqrt{3}}\left(\mathbf{D}_{m,n}\overline{\mathbf{r}}+\overline{\mathbf{D}}_{m,n}r\right)+f_{m,n}, (6.15)

where

𝐃m,n=m+nω,\mathbf{D}_{m,n}=m+n\omega, (6.16)

and fm,nf_{m,n} is a real number, constant everywhere inside the patch. Here z¯\overline{z} denotes the complex conjugate of zz.

Each patch is characterized by a complex number 𝐃m,n\mathbf{D}_{m,n} which is the coefficient in the potential function ϕ(𝐫)\phi\left(\mathbf{r}\right) of the patch. In the complex 𝐃\mathbf{D}-plane, each patch with labels as in Fig. 6.7(a) can then be represented by a point. We connect two patches by a line if they share a common boundary. Then the resulting figure, shown in Fig. 6.13, is the adjacency graph of the patches.

Refer to caption
Figure 6.14: The 1/𝐑¯1/\mathbf{\bar{R}} transformation of the pattern in Fig. 6.10, where 𝐑¯\mathbf{\overline{R}} is the complex conjugate of 𝐑\mathbf{R}. Labels are the same as used in Fig. 6.7(a).

We can determine the connectivity structure of this graph, without knowing the full potential function in each patch. We first take 1/𝐑¯1/\mathbf{\bar{R}} transformation of the pattern. This is shown in Fig. 6.14. Some of the bigger patches are denoted by capital alphabets in Fig. 6.7(a) and their corresponding patches on the transformed pattern in Fig. 6.14. The patches A and A\textbf{A}^{\prime} in Fig. 6.7(a) are adjacent to the outer region O through the same vertical boundary. Matching the values of the function ϕ(𝐫)\phi(\mathbf{r}) and fixing the discontinuity in its normal derivatives at the boundary, it is easy to see that ϕ(𝐫)\phi(\mathbf{r}) has the same functional form in the patches A and A\textbf{A}^{\prime}. In fact, it is convenient to imagine that the boundary between O and A moved to the right by an infinitesimal amount, so that it does not touch the patches D and I\textbf{I}^{\prime}, and then A and A\textbf{A}^{\prime} would actually join to form a single connected patch A. We thus consider A and A\textbf{A}^{\prime} as one patch, and both can be represented as one point on the 𝐃\mathbf{D}-plane. Similarly, we identify B and B\textbf{B}^{\prime}, C and C\textbf{C}^{\prime}, etc. Then the adjacency graph can be constructed by joining the sites on the 𝐃\mathbf{D}-plane, according to the adjacency of patches in Fig. 6.14.

It turns out that the patches corresponding to m+n=2(m+n=2\left(\right.mod3)\left.3\right) do not appear in the pattern, and the adjacency graph, as shown in Fig. 6.13, is a hexagonal lattice with some extra edges shown in brown color. These extra edges connect all the vertices at same distance from the origin (0,0)\left(0,0\right) (in the L1L^{1} metric), and also connect some of the diagonally opposite sites on the rectangular faces of the graph as shown in figure.

The charge density Δρ(𝐫)\Delta\rho\left(\mathbf{r}\right) is zero inside the patches, and the excess grains due to addition are distributed along the patch boundaries, leading to nonzero line charge densities separating neighboring patches. Then the density function Δρ(𝐫)\Delta\rho\left(\mathbf{r}\right) is a superposition of the line charge densities along the patch boundaries. There are three kinds of line charges of charge density λ=1/3\lambda=-1/\sqrt{3}, 11, and 2/32/\sqrt{3}.

From the electrostatic analogy, it is seen that ϕ(𝐫)\phi\left(\mathbf{r}\right) is continuous across the common boundary between neighboring patches, and its normal derivative is discontinuous by an amount equal to the line charge density λ\lambda along the boundary. Let PP and PP^{\prime} be the two neighboring patches with the equation of the boundary between them

𝐫=|𝐫|exp(iθ)+𝐀,\mathbf{r}=|\mathbf{r}|\exp\left(i\theta\right)+\mathbf{A}, (6.17)

such that the patch PP^{\prime} is on the left of the boundary. Then using the continuity condition, it is easy to show that

𝐃p𝐃p\displaystyle\mathbf{D}_{p^{\prime}}-\mathbf{D}_{p} =\displaystyle= iλ3exp(iθ)and\displaystyle i\lambda\sqrt{3}\exp\left(i\theta\right)\rm{~and~}
fpfp\displaystyle f_{p^{\prime}}-f_{p} =\displaystyle= Re[𝐀¯(𝐃p𝐃p)]/3,\displaystyle Re[\overline{\mathbf{A}}\left(\mathbf{D}_{p^{\prime}}-\mathbf{D}_{p}\right)]/\sqrt{3}, (6.18)

where 𝐀¯\overline{\mathbf{A}} is the complex conjugate of 𝐀\mathbf{A}. We note that, there are only six different types of patch boundaries in the pattern, with angle θ\theta an integer multiple of π/6\pi/6.

It is easy to check that the matching conditions along the edges of hexagonal lattice (denoted by blue solid line in Fig. 6.13) are sufficient to determine Dm,nD_{m,n} for all the vertices. The line charge density λ=1/3\lambda=-1/\sqrt{3} for the patch boundaries corresponding to these edges. Also, the potential function ϕ=0\phi=0, for the vertex at the origin, and hence, DD and ff both vanishes. Then using the matching condition, it is easy to check that, the values of Dm,nD_{m,n} are consistent with the form in Eq. (6.16).

The function fm,nf_{m,n} satisfies the discrete Laplace’s equation on the underlying hexagonal lattice of the adjacency graph i.e.

m,nfm,n3fm,n=0 for (m,n)0,\sum_{m^{\prime},n^{\prime}}f_{m^{\prime},n^{\prime}}-3f_{m,n}=0\textrm{ ~ ~ ~ for }\left(m,n\right)\neq 0, (6.19)

where (m,n)\left(m^{\prime},n^{\prime}\right) denotes the three neighbors of the vertex (m,n)\left(m,n\right) on the hexagonal lattice. This can be checked from the concurrency condition of patch boundaries. For example consider the edges 𝐎𝐀\mathbf{OA}, 𝐃𝐀\mathbf{DA^{\prime}} and 𝐈𝐀\mathbf{I^{\prime}A} on the adjacency graph. The corresponding patch boundaries in the pattern intersect at the same point (Fig. 6.7(a)). Then it is easy to check using the matching condition in Eq.(6.18) that,

fO+fD+fI=3fA.f_{O}+f_{D}+f_{I}=3f_{A}. (6.20)

Similar equations hold for the other vertices.

In the region outside the pattern, where none of the sites toppled, the potential function ϕ(z)=0\phi\left(z\right)=0. This corresponds to m=n=0m=n=0, and f0,0=0f_{0,0}=0. The solution of the Laplace’s equation with the above boundary condition can be written in the following integral form [atkinson]

fm,n=I4π2ππππ1cos(k1(2mn)/3+k2n)1(cos2k2+2cosk1cosk2)/3𝑑k1𝑑k2,f_{m,n}=\frac{I}{4\pi^{2}}\int_{-\pi}^{\pi}\int_{-\pi}^{\pi}\frac{1-\cos\left(k_{1}(2m-n)/3+k_{2}n\right)}{1-\left(\cos{2k_{2}}+2\cos{k_{1}}\cos{k_{2}}\right)/3}dk_{1}dk_{2}, (6.21)

for m+n=0m+n=0 (mod 33), where II is a normalizing constant, which determines the pattern up to a scale factor. For the sites with m+n=1m+n=1 (mod 33), fm,nf_{m,n} are the average of those corresponding to the neighboring sites. As an example the potential function in region A, and C\textbf{C}^{\prime} is

ϕA(𝐫)\displaystyle\phi_{{}_{\textbf{A}}}(\mathbf{r}) =\displaystyle= I3ξ3,\displaystyle\frac{I}{3}-\frac{\xi}{\sqrt{3}}, (6.22)
ϕC(𝐫)\displaystyle\phi_{{}_{\textbf{C}^{\prime}}}(\mathbf{r}) =\displaystyle= I3+13(12ξ+32η),\displaystyle\frac{I}{3}+\frac{1}{\sqrt{3}}\left(\frac{1}{2}\xi+\frac{\sqrt{3}}{2}\eta\right), (6.23)

where 𝐫=ξ+iη\mathbf{r}=\xi+i\eta, and i=1i=\sqrt{-1}. Then the equation of the patch boundary between patches A and O is

ξ=I/3,\xi=I/\sqrt{3}, (6.24)

and that of the boundary between patches C\textbf{C}^{\prime} and O is

3ξ+3η+2I=0.\sqrt{3}\xi+3\eta+2I=0. (6.25)

Equivalently, the length of an edge of the bounding equilateral triangle of the pattern is equal to 2IN2IN, for large NN.

Refer to caption
Figure 6.15: The discrepancy 2ΔΛ2\Delta\Lambda between the actual height of bounding triangle, and the asymptotic value 2N/32N/\sqrt{3} plotted as a function of NN. The straight line shows a simple power-law fit with power 3/43/4.
Refer to caption
Figure 6.16: An example of five patches meeting at a point, for a pattern on the background of Class II, =2\ell=2. It is easy to check that the line charge density for the vertical boundary λ=1/3\lambda=-1/\sqrt{3}, same as in Fig. 6.11. The color code is same as in Fig. 6.10.

The constant II in Eq. (6.21) can be calculated using the form of the potential function near the site of addition. As noted, the function ϕ\phi can be considered as the potential due to line charges along the patch boundaries and a point charge of unit amount at the origin. Then, close to the origin the solution diverges logarithmically as ϕ~(𝐫)=(2π)1log(|𝐫|)\widetilde{\phi}\left(\mathbf{r}\right)=-\left(2\pi\right)^{-1}\log\left(|\mathbf{r}|\right), and the potential function is an approximation to this solution by a piece-wise linear function. Then, there are coordinates 𝐫𝐨\mathbf{r_{o}} inside each patch (m,n)\left(m,n\right) with |m|+|n||m|+|n| large, where the ϕ\phi and its first derivatives are equal to ϕ~\tilde{\phi} and its first derivatives, respectively. Then,

23𝐫¯ϕ~(𝐫)|𝐫𝐨\displaystyle 2\sqrt{3}\frac{\partial}{\partial\overline{\mathbf{r}}}\widetilde{\phi}\left(\mathbf{r}\right)|_{\mathbf{r_{o}}} \displaystyle\simeq 𝐃m,nand\displaystyle-\mathbf{D}_{m,n}\rm{~~and~~}
123{𝐃m,n𝐫𝐨¯+𝐃¯m,n𝐫𝐨}+fm,n\displaystyle-\frac{1}{2\sqrt{3}}\left\{\mathbf{D}_{m,n}\overline{\mathbf{r_{o}}}+\overline{\mathbf{D}}_{m,n}\mathbf{r_{o}}\right\}+f_{m,n} \displaystyle\simeq 12πlog(|𝐫𝐨|).\displaystyle-\frac{1}{2\pi}\log\left(|\mathbf{r_{o}}|\right).

The above two equations imply

fm,n12πlog(|m+nω|),f_{m,n}\simeq\frac{1}{2\pi}\log\left(|m+n\omega|\right), (6.27)

for |m|+|n||m|+|n| large. Comparing it with the Eq. (6.21) for large |m|+|n||m|+|n| we find that the numerical constant I=1/3I=1/\sqrt{3}. This determines the potential function completely, and thus characterizes the pattern. For example, as in figure 6.7(a), the equation of the rightmost boundary of the pattern, using Eq. (6.24) is x=N/3x=N/3. Equations of other boundaries of patches can be calculated similarly. For example, the reduced coordinates of the point where the patches DD and DD^{\prime} meet in Fig. 6.7(a), is determined by the condition that it is a common point of patches DD, JJ and AA^{\prime}, and that the function ϕ\phi is continuous.

f1,013ξ\displaystyle f_{1,0}-\frac{1}{\sqrt{3}}\xi =\displaystyle= f2,113(32ξ+32η)\displaystyle f_{2,1}-\frac{1}{\sqrt{3}}\left(\frac{3}{2}\xi+\frac{\sqrt{3}}{2}\eta\right) (6.28)
=\displaystyle= f3,113(52ξ+32η).\displaystyle f_{3,1}-\frac{1}{\sqrt{3}}\left(\frac{5}{2}\xi+\frac{\sqrt{3}}{2}\eta\right).

Then using the values f1,0=1/33f_{1,0}=1/3\sqrt{3}, f2,1=1/23f_{2,1}=1/2\sqrt{3}, and f3,1=7/631/πf_{3,1}=7/6\sqrt{3}-1/\pi [atkinson] we get the reduced coordinates of this point as

(ξ,η)=(233π,133+1π).\left(\xi,\eta\right)=\left(\frac{2}{3}-\frac{\sqrt{3}}{\pi},-\frac{1}{3\sqrt{3}}+\frac{1}{\pi}\right). (6.29)

Equivalently, the height of the bounding equilateral triangle increases as 2N/31.154N2N/\sqrt{3}\simeq 1.154N. The estimated slope of the fitting line in Fig. 6.8 is 1.1, in reasonable agreement with the theory. However, even though the exact function Λ(N)\Lambda(N) has large fluctuations of number theoretic origin, the estimated slope is noticeably lower than the calculated asymptotic value. To examine this discrepancy closer, we have plotted in Fig. 6.15 the discrepancy 2ΔΛ=2N/32Λ(N)2\Delta\Lambda=2N/\sqrt{3}-2\Lambda(N) as a function of NN. We find that this appears to increase with NN as N3/4N^{3/4}, for large NN. The reason for this behavior is not understood yet.

Refer to caption

Figure 6.17: A schematic representation of the periodic tiling of the plane using tilted rectangles. Background height patterns with such periodicities on the F-lattice give rise to non-compact growth with the growth-exponent between 1/21/2 and 11

For backgrounds, with l>1l>1, our numerical results suggest that there is a crossover length R(l)R^{\star}(l), and initially, for R<R(l)R<R^{\star}(l), the avalanches grow “explosively" in size. As a result, the number of particles inside a disc of radius RR^{\star} in the final pattern is less than that in the initial background. The net flux of particles going out of the disc increases with RR until the radius becomes of order RR^{\star}. After this, the large-scale properties of the pattern are the same as that of l=1l=1 pattern, with the number of particles added ANA_{\ell}N, where AA_{\ell} is an \ell-dependent constant. In particular, the size of the pattern is AA_{\ell} -times the size of the pattern for l=1l=1 with same NN. The crossover length RR^{\star} is expected to grows as N\sqrt{N}.

For a background with >1\ell>1, the basis vectors at the unit cell are e^1\ell\hat{e}_{1} and e^2\ell\hat{e}_{2}, where e^1\hat{e}_{1}, e^2\hat{e}_{2} are the basis vectors for =1\ell=1 background (see Eq. (6.9)). Then the reciprocal basis vectors are g^1/\hat{g}_{1}/\ell and g^2/\hat{g}_{2}/\ell. From the observed patterns, we find that the line charge densities remain same for any \ell (see Fig. 6.16 for an example of the patch boundaries). This implies that n1n_{1} and n2n_{2} in eq. (8) are constrained to be multiples of ll. Writing n1=lmn_{1}=lm, n2=lnn_{2}=ln, we see that the patches can be labeled by the same pair of integers (m,n)\left(m,n\right) as in the =1\ell=1 case, and the potential function ϕ(l)(𝐫)\phi_{(l)}\left(\mathbf{r}\right) for general ll is related to the l=1l=1 case by simple scaling:

ϕ()(𝐫)=Aϕ(1)(𝐫A),\phi_{(\ell)}\left(\mathbf{r}\right)=A_{\ell}\phi_{(1)}\left(\frac{\mathbf{r}}{A_{\ell}}\right), (6.30)

where AA_{\ell} is a scale factor. For =2\ell=2, 33, 44 and 55 the values of AA_{\ell} are approximately 2.342.34, 3.383.38, 4.414.41 and 5.375.37, respectively. We note that AA_{\ell} increases approximately linearly with \ell.

6.6  Non-compact patterns with exponent α<1\alpha<1.

On the F-lattice, after some experimentation, we found that the background pattern having the periodicity of the tiling of plane with tilted rectangles, shown in Fig. 6.17, produces patterns with interesting non-compact growth. We studied rectangles with aspect ratio l:(l+1)l:(l+1), and the rectangles are tilted by 4545^{\circ} to the x-axis. Two such periodic backgrounds are shown in Fig. 6.18. In these background patterns, the sites with height zero, are arranged along the boundaries of tilted rectangles with two possible orientations, and rest of the sites have height one. The stable height-patterns generated by adding NN particles and relaxing the configuration on these two backgrounds are shown in Fig. 6.19 and Fig. 6.20, respectively. The growing boundaries of the patches in the patterns are shown, in terms of the QQ variables, in Fig. 6.21 and 6.22, respectively. Again, we see that the patch boundaries are straight lines, with rational slopes. The plot of diameter 2Λ2\Lambda vs N, for these two patterns are shown in Fig. 6.23. We see that the growth exponent α\alpha is approximately 0.60.6 for figure 6.19 and 0.7250.725 for figure 6.20. In general, value of the exponent α\alpha is in range 1/2<α<11/2<\alpha<1, and approaches value 11 as density ρo\rho_{o} of the background becomes close to 11.

Refer to caption
Refer to caption
Figure 6.18: The two backgrounds studied on the F-lattice. Unit cells of the periodic distribution of particles are shown by gray rectangular shades. The filled circles represent height 0 and unfilled ones 11.
Refer to caption
Figure 6.19: The pattern produced on the first background in Fig. 6.18, by adding N=2200N=2200 grains at a single site, and relaxing the configuration. Color code: White=1=1 and Black=0=0. Details can be viewed in the electronic version using zoom in.
Refer to caption
Figure 6.20: The pattern produced on the second background in Fig. 6.18 by adding N=600N=600 grains at a single site, and relaxing the configuration. Color code: White=1=1 and Black=0=0. Details can be viewed in the electronic version using zoom in.
Refer to caption
Figure 6.21: The pattern in terms of Q(r)Q(r), showing the boundaries of patches corresponding to Fig. 6.19. Color code: White=0=0 and Red==Non-zero. Details can be viewed in the electronic version using zoom in.
Refer to caption
Figure 6.22: The pattern in terms of Q(r)Q(r), showing the boundaries of patches corresponding to Fig. 6.20. Color code: White=0=0 and Red==Non-zero. Details can be viewed in the electronic version using zoom in.

There are unresolved areas of apparent solid color in the patterns, taking up a sizable fraction of the total area, e.g., two large regions of red color on both sides of Fig. 6.21. In these regions, the pattern appears to be complex, suggesting either a large number of patch boundaries, or patches of non-zero areal excess charge density. However, the fractional area of these regions decreases with larger NN. Also on comparing patterns with different ll, we have seen that the fractional area of such regions decreases as ll increases. A more detailed study of these patterns seems like an interesting problem for future investigations.

6.7  Summary and concluding remarks

In this chapter, we have studied two dimensional patterns formed in Abelian sandpile models by adding particles at one site on an initial periodic background, where the diameter of the pattern grows as NαN^{\alpha}, with α>1/2\alpha>1/2. Using some features observed in the pattern of adjacency of patches as an input, we are able to determine the exact asymptotic pattern in the specific case with α=1\alpha=1, on a class II background.

Refer to caption
Figure 6.23: The change in diameter as a function of NN, for the patterns on the two backgrounds in Fig. 6.18. The numerical results fit well with straight lines of slope 0.60.6 and 0.7250.725, for the backgrounds one and two, respectively.

The patterns on class IIII backgrounds can also be characterized similarly. As noted earlier, some of the patches split into smaller parts. By using the 1/𝐑¯1/\overline{\mathbf{R}} transformation, we can again determine the structure of the adjacency graph. The graph for the pattern in Fig. 6.7(b) is shown in Fig. 6.24. It is a periodic lattice where half of the vertices of the hexagonal lattice are replaced by 33 vertices (colored in brown). The exact D-values for different patches can be easily determined. The determination of fm,nf_{m,n} for this pattern then requires the solution of the Laplace’s equation on this graph. It can be shown that a slight alteration of the graph, by drawing the missing edges in the small triangles shown in pink colors, does not change the pattern. Then the solution of the Laplace’s equation can be reduced to the solution of a resistor network on this modified graph. The later can be further reduced to the resistor network on a hexagonal lattice, discussed by Atkinson et.al. [atkinson], using the well-known YΔY-\Delta transformation. We present the analysis in the Appendix LABEL:apndx:laplace.

Refer to caption
Figure 6.24: The adjacency graph of the patches in the pattern in Fig. 6.7(b). The vertices corresponding to the brownish and greenish patches in the pattern (Fig.6.4) are denoted by different colors.

An important feature of the non-compact patterns is that, it can be characterized by a piece-wise linear function. This characterization is simpler than that of the patterns with compact growth, where one requires piece-wise quadratic polynomials. We have shown that there are infinitely many backgrounds, on which the patterns have non-compact growth. It would be desirable to determine the exact value of α\alpha for different backgrounds showing non-compact growth studied in section 6.6.

Refer to caption
Figure 6.25: Graph corresponding to the tropical function in equation (6.32)

Another interesting question is a possible connection of this problem to tropical algebra [tropical]. In tropical mathematics, one defines operations similar to ‘addition’ and ‘multiplication’ (denoted by \oplus and \otimes here) by

ab\displaystyle a\oplus b =\displaystyle= max{a,b},\displaystyle\textrm{max}\left\{a,b\right\},
ab\displaystyle a\otimes b =\displaystyle= a+b,\displaystyle a+b, (6.31)

where aa, bb are real parameters. Familiar properties of addition and multiplication operators, like commutativity, associativity, existence of identity, distributive property continues to hold in the new definition. One can then define polynomials in several variables. The graph of a tropical polynomial is a piecewise linear function which is also convex. For example, consider the tropical function

f(x)=ax2bxc.f(x)=a\otimes x^{2}\oplus b\otimes x\oplus c. (6.32)

In terms of standard algebra

f(x)=max{a+2x,bx,c}.f(x)=max\left\{a+2x,bx,c\right\}. (6.33)

The graph corresponding to this function is shown in Fig. 6.25

We note that for the pattern discussed in section 44, the potential function is piece-wise linear. It seems plausible that tropical polynomials may be useful to describe this function. In fact, tropical geometry have been discussed as possibly related to sandpile models [norine, propp2]. For small values of NN, our numerical study showed that ϕ\phi is convex, if restricted to one sextant. However, for larger NN, as shown in Fig. 6.26, we see that ϕ\phi is not convex even within one sextant.

Refer to caption
Figure 6.26: (color in the electronic copy) Three dimension plot of the integer toppling function TN(x,y)T_{N}\left(x,y\right) for a triangular pattern like in Fig. 6.10, but with N=800N=800. The plot shows a zoomed-in section in the region y0y\geq 0 and y+3x0y+\sqrt{3}x\geq 0.

We conclude that it is not possible to represent the potential ϕ\phi as a simple tropical polynomial.

Chapter 7 A continuous height sandpile model

Based on the paper [mypre] by Tridib Sadhu and Deepak Dhar.

  • Abstract:

    In this chapter, we study the Zhang model of sandpile, defined in the first chapter, on a one dimensional chain of length LL, driven by adding a random amount of height at a randomly chosen site at each addition step. We show that in spite of this randomness in the input height, the probability distribution function of height at a site in the steady state is sharply peaked, and the width of the peak decreases as L1/2{L}^{-1/2} for large LL.

    We also discuss how the height added at one time is distributed among different sites by topplings with time. We relate this distribution to the time-dependent probability distribution of the position of a marked grain in the one dimensional abelian model with discrete heights. We argue that in the large LL limit, the variance of height at site xx has a scaling form L1g(x/L)L^{-1}g(x/L), where g(ξ)g(\xi) varies as ln(1/ξ)\ln(1/\xi) for small ξ\xi, which agrees well with the results from numerical simulations.

7.1  Introduction

After Dhar first discovered the abelian property of the BTW model [dharprl], many more models in the general class known as abelian distributed processors, were studied, as the abelian property makes their theoretical study simpler [dharphysica06]. The original sandpile model of Bak et al. [btw], the Eulerian walkers model [euler], and the abelian variant [sasm] of the model originally proposed by Manna [manna] are all members of this class. Models which do not have the abelian property have been studied mostly by numerical simulations. As discussed in chapter 3, the Zhang model is one such model, and this is what we study in this chapter.

In the Zhang model, the amount of height added at a randomly chosen site at each addition step is not fixed, but random. In spite of this, the model in one dimension has the remarkable property that the height at a site in the steady state has a very sharply peaked distribution in which the width of the peak is much less than the spread in the input amount per time step, and the width decreases with increasing system size LL. This behavior was noticed by Zhang using numerical simulations in one and two dimension [zhang], and he called it the ‘emergence of quasi-units’ in the steady state of the model. He argued that for large systems, the behavior would be same as in the discrete model. Recently, A. Fey et al. [redig] have proved that for some choices of the distribution of input height, in one dimension, the variance of height does go to zero as the length of the chain LL goes to infinity. However, they did not study how fast the variance decreases with LL.

We study this emergence of ‘quasi-units’ in one dimensional Zhang sandpile by looking at how the added height is redistributed among different sites in the avalanche process. We show that the distribution function of the fraction of height, added at a site xx^{\prime}, reaching a site xx after tt time steps following the addition is exactly equal to the probability distribution that a marked grain in the one-dimensional height type BTW model added at site xx^{\prime}, reaches site xx in time tt. The latter problem was studied earlier [punya]. We use this to show that the variance of height asymptotically vanishes as 1/L1/L. We also discuss the spatial dependence of the variance along the system length. In the large LL limit, the variance at site xx has a scaling form L1g(x/L)L^{-1}g(x/L). We determine an approximate form of the scaling function g(ξ)g(\xi), which agrees very well with the results of our numerical simulations.

There have been other studies of the Zhang model earlier. Blanchard et al. [blanchard] have studied the steady state of the model where the amount of addition of height is fixed but the site of addition is chosen randomly, and found that the distribution of energies even for the two site problem is very complicated, and has a multi-fractal character. In two dimensions, the distribution of height seems to sharpen for larger LL, but the rate of decrease of the width is very slow [janosi]. Most other studies have dealt with the question as to whether the critical exponents of the avalanche distribution in this model are the same as in the discrete abelian model [lubeck, milshtein]. A. Fey et al.’s results imply that the asymptotic behavior of the avalanche distribution in one dimension, for specific cases, is identical to the discrete case, but the situation in higher dimension remains unclear [vespignaniz, guilera].

The plan of the chapter is as follows. In Section 7.2, we define the model precisely. In Section 7.3, we show that the way the height added at a site is distributed among different sites by toppling is same as the time-dependent probability distribution of the position of a marked grain in the discrete abelian sandpile model. This correspondence is used in Section 7.4 to determine the qualitative dependence of the variance of the height variable at a site on its position xx, and on the system size LL. We propose a simple extrapolation form that incorporates this dependence. We check our theoretical arguments with numerical simulations in Section 7.5. Section 7.6 contains a summary and concluding remarks. A detailed calculation of the solution of an equation, required in Section 7.4, is given in the Appendix C.

7.2  Definition and preliminaries

We consider our model on a linear chain of size LL. The sites are labelled by integers 11 to LL and a real continuous height variable is assigned to each site. Let h(x,t)h(x,t) be the height variable at site xx at the end of the time-step tt. We define a threshold height value hch_{c}, same for each site, and sites with h(x,t)hch(x,t)\geq h_{c} are called unstable, while those with h(x,t)<hch(x,t)<h_{c} are called stable. Starting from a configuration where all sites are stable, the dynamics is defined as follows.

(i) The system is driven by adding a random amount of height at the beginning of every time-step at a randomly chosen site. Let the amount of height added at time tt be Δt\Delta_{t}. We will assume that all Δ\Delta’s are independent, identically distributed random variables, each picked randomly from an uniform interval 1ϵΔt1+ϵ1-\epsilon\leq\Delta_{t}\leq 1+\epsilon. Let the site of addition chosen at time tt be denoted by ata_{t}.

(ii) We make a list of all sites whose height exceeds or becomes equal to the critical value hch_{c}. All these sites are relaxed in parallel by topplings. In a toppling, the height of the site is equally distributed to its two neighbors and the height at that site is reset to zero. If there is toppling at a boundary site, half of the height at that site before toppling is lost.

(iii) We iterate Step (ii) until all topplings stop. This completes one time step.

This is the slow driving limit, and we have assumed that all avalanche activity stops before the next addition event. In this limit, the model is characterized by two parameters ϵ\epsilon and hch_{c}. In the limit ϵ=0\epsilon=0, and 1<hc21<h_{c}\leq 2, the model reduces to the discrete case, where the behavior is well understood [ruelle]. For non-zero but small ϵ\epsilon, the behavior does not depend on the precise value of hch_{c}. In fact, starting with a recurrent configuration of the pile, and adding height at some chosen site, we get exactly the same sequence of topplings for a range of values of hch_{c} [redig]. To be precise, for any fixed initial configuration, and fixed driving sequence (of sites chosen for addition of height), whether a site xx topples at time tt or not is independent of hch_{c}, so long as we have 1+ϵ<hc22ϵ1+\epsilon<h_{c}\leq 2-2\epsilon. In the following, we assume for simplicity that hc=3/2h_{c}=3/2, and 0ϵ1/40\leq\epsilon\leq 1/4.

It was shown in [redig] that in this case, the stationary state has at most one site with height h(x,t)=0h(x,t)=0 and all other sites have height in the range 1ϵh(x,t)1+ϵ1-\epsilon\leq h(x,t)\leq 1+\epsilon. The position of the empty site is equally distributed among all the lattice points. There are also some recurrent configurations in which all sites have height h(x,t)1ϵh(x,t)\geq 1-\epsilon. In such cases, we shall say that the site with zero height is the site L+1L+1. Then, in the steady state, there is exactly one site with height equal to 0, and the L+1L+1 different positions of the site are equally likely.

If hch_{c} does not satisfy the inequality 1+ϵ<hc22ϵ1+\epsilon<h_{c}\leq 2-2\epsilon, this simple characterization of the steady state is no longer valid. However, our treatment can be easily extended to those cases. Since the qualitative behavior of the model is the same in all cases, we restrict ourselves to the simplest case here.

It is easy to see that the toppling rules are in general not abelian. For example, start with a two site model in configuration (1.6,2.0)(1.6,2.0) and hc=1.5h_{c}=1.5. The final configuration would be (1.4,0)(1.4,0), or (0,1.3)(0,1.3), depending on whether the first or the second site is toppled initially. In our model, using the parallel update rule, the final configuration would be (1.0,0.8)(1.0,0.8). A. Fey et al. [redig] have shown that only in one dimension, for 1+ϵ<hc1+\epsilon<h_{c}, the Zhang model has a restricted abelian character, namely, that the final state does not depend on the order of topplings within an avalanche. However, topplings in two different avalanches do not commute.

7.3  The propagator, and its relation to the discrete abelian model

It is useful to look at the Zhang model as a perturbation about the ϵ=0\epsilon=0 limit. For sufficiently small ϵ\epsilon, given the site of addition and initial configuration, the toppling sequence is independent of ϵ\epsilon. It is also independent of the amount of height of addition Δt\Delta_{t}, and is same as the model with ϵ=0\epsilon=0, which is the 11-dimensional abelian sandpile model with integer heights (hereafter referred to simply as ASM, without further qualifiers). We decompose the height variables as

h(x,t)=Nint[h(x,t)]+ϵη(x,t),h(x,t)=\mbox{Nint}[h(x,t)]+\epsilon\eta(x,t), (7.1)

where Nint refers to the nearest integer value. Then the integer part of the height evolves as in the ASM. We write

Δt=1+ϵut,forallt.\Delta_{t}=1+\epsilon u_{t},\mathrm{~for~~all~~}t. (7.2)

Here utu_{t} is uniformly distributed in the interval [1,+1][-1,+1]. The linearity of height transfer in toppling implies that the evolution of the variables η(x,t)\eta(x,t) is independent of ϵ\epsilon. Thus, η(x,t)\eta(x,t) is a linear function of utu_{t}; the precise function depends on the sequence of topplings that took place. These are determined by the sequence of addition sites {at}\{a_{t}\} up to the time tt, and the initial configuration C0C_{0}. These together will be called the evolution history of the system up to time tt, and denoted by t\mathcal{H}_{t}. We assume that at the starting time t=0t=0, the variables η(x,t=0)\eta(x,t=0) are zero for all xx, and the initial configuration is a recurrent configuration C0C_{0} of the ASM. Then, from the linearity of the toppling rules, we can write η(x,t)\eta(x,t) as a linear function of {ut}\{u_{t^{\prime}}\} for 1tt1\leq t^{\prime}\leq t, and we can write for a given history t\mathcal{H}_{t},

η(x,t|{ut},t)=t=1tG(x,t|at,t,t)ut.\eta(x,t|\{u_{t}\},\mathcal{H}_{t})=\sum_{t^{\prime}=1}^{t}G(x,t|a_{t^{\prime}},t^{\prime},\mathcal{H}_{t})u_{t^{\prime}}. (7.3)

This defines the matrix elements G(x,t|at,t,t)G(x,t|a_{t^{\prime}},t^{\prime},\mathcal{H}_{t}). These can be understood in terms of the probability distribution of the position of a marked grain in the ASM as follows. Consider the motion of a marked grain in the one dimensional height type BTW model. We start with configuration C0C_{0} and add grains at sites according to the sequence {at}\{a_{t}\}. All grains are identical except the one added at time tt^{\prime}, which is marked. In each toppling, the marked grain jumps to one of its two neighbors with equal probability. Consider the probability that the marked grain will be found at site xx after a sequence of relaxation processes at time tt. We denote this probability as Prob(x,t|at,t,t){\rm Prob}(x,t|a_{t^{\prime}},t^{\prime},\mathcal{H}_{t}). From the toppling rules in both the models, it is easy to see that

G(x,t|at,t,t)=Prob(x,t|at,t,t).G(x,t|a_{t^{\prime}},t^{\prime},\mathcal{H}_{t})={\rm Prob}(x,t|a_{t^{\prime}},t^{\prime},\mathcal{H}_{t}). (7.4)

Averaging over different histories t\mathcal{H}_{t}, we get the probability that a marked grain added at x=atx^{\prime}=a_{t^{\prime}} at time tt^{\prime} is found at a position xx at time ttt\geq t^{\prime} in the steady state of the ASM. Denoting the latter probability by ProbASM(x,t|x,t)\mathrm{Prob_{ASM}}(x,t|x^{\prime},t^{\prime}), we get

G(x,t|x=at,t,t)¯=ProbASM(x,t|x,t),\overline{G(x,t|x^{\prime}=a_{t^{\prime}},t^{\prime},\mathcal{H}_{t})}=\mathrm{Prob_{ASM}}(x,t|x^{\prime},t^{\prime}), (7.5)

where the over bar denotes averaging over different histories t\mathcal{H}_{t}, consistent with the specified constraints. Here, the constraint is that t\mathcal{H}_{t} must satisfy at=xa_{t^{\prime}}=x^{\prime}. At other places, the constraints may be different, and will be specified if not clear from the context.

We shall denote the variance of a random variable ξ\xi by Var[ξ]Var[\xi]. For the specific case with ϵ=0\epsilon=0, using the definition in Eq. (7.1), it is easy to show that Var[h(x,t)]=L/(L+1)2Var[h(x,t)]=L/(L+1)^{2}. For non-zero ϵ\epsilon, in addition to the previous term, there will be a term proportional to ϵ2\epsilon^{2}, as the term linear in ϵ\epsilon vanishes. Hence, we can write

Var[h(x,t)]=L/(L+1)2+ϵ2Var[η(x,t)].Var[h(x,t)]=L/(L+1)^{2}+\epsilon^{2}Var[\eta(x,t)]. (7.6)

Different utu_{t} are independent random variables, also independent of t\mathcal{H}_{t} and have zero mean. Let Var[ut]=σ2Var[u_{t}]=\sigma^{2}. For the case when utu_{t} has a uniform distribution between 1-1 and +1+1, we have σ2=1/3\sigma^{2}=1/3. Then, from Eq. (7.3), we get

Var[η(x,t)]=σ2t=1tG2(x,t|at,t,t)¯.Var[\eta(x,t)]=\sigma^{2}\sum_{t^{\prime}=1}^{t}\overline{G^{2}(x,t|a_{t^{\prime}},t^{\prime},\mathcal{H}_{t})}. (7.7)

As tt\rightarrow\infty, the system tends to a steady state, and the average in the right hand side of Eq. (7.7) becomes a function of ttt-t^{\prime}. Also, for a given tt^{\prime}, all values of ata_{t^{\prime}} are equally likely. We define

F(x,τ)1LlimtxG2(x,t+τ|x,t,t)¯.F(x,\tau)\equiv\frac{1}{L}\lim_{t^{\prime}\rightarrow\infty}\sum_{x^{\prime}}\overline{G^{2}(x,t^{\prime}+\tau|x^{\prime},t^{\prime},\mathcal{H}_{t})}. (7.8)

Then, for large LL, in the steady state (tt large), the variance of height at site xx is 1/L+ϵ2Σ2(x)1/L+\epsilon^{2}\Sigma^{2}(x), where

Σ2(x)=limtVar[η(x,t)]=σ2τ=0F(x,τ).\Sigma^{2}(x)=\lim_{t\rightarrow\infty}Var[\eta(x,t)]=\sigma^{2}\sum_{\tau=0}^{\infty}F(x,\tau). (7.9)

We define Σ2¯\overline{\Sigma^{2}} to be the average of Σ2(x)\Sigma^{2}(x) over xx as

Σ2¯=1LxΣ2(x).\overline{\Sigma^{2}}=\frac{1}{L}\sum_{x}\Sigma^{2}(x). (7.10)

Evaluation of G(x,t|x,t,t)G(x,t|x^{\prime},t^{\prime},\mathcal{H}_{t}) for a given history t\mathcal{H}_{t} and averaging over t\mathcal{H}_{t} is quite tedious for t>1t>1 or 22. For G¯\overline{G}, the problem has been studied in the context of residence times of grains in sand piles, and some exact results are known in specific cases [punya]. For G2¯\overline{G^{2}}, the calculations are much more difficult. However, some simplifications occur in large LL limit. We discuss these in the next section.

7.4  Calculation of Σ2(x)\Sigma^{2}(x) in large-LL limit

In order to find the quantity F(x,τ)F(x,\tau) in Eq. (8), we have to average G2(x,t|x,t,t)G^{2}(x,t|x^{\prime},t^{\prime},\mathcal{H}_{t}) over all possible histories t\mathcal{H}_{t}, which is quite difficult to evaluate exactly. However, we can determine the leading behavior of F(x,τ)F(x,\tau) in this limit.

We use the fact that the path of a marked grain in the ASM is a random walk [punya]. Consider a particle that starts away from the boundaries at x=ξLx^{\prime}=\xi L, with LL large, and 0<ξ<10<\xi<1. If it undergoes r(t)r(\mathcal{H}_{t}) topplings between the time tt^{\prime} and t=t+τt=t^{\prime}+\tau under some particular history t\mathcal{H}_{t}, then its probability distribution is approximately a Gaussian, centered at xx^{\prime} with width r\sqrt{r}. Then, we have

G(x,t|x,t,t)12πr(t)exp((xx)22r(t)).G(x,t|x^{\prime},t^{\prime},\mathcal{H}_{t})\simeq\frac{1}{\sqrt{2\pi r(\mathcal{H}_{t})}}\exp\left(-\frac{(x-x^{\prime})^{2}}{2r(\mathcal{H}_{t})}\right). (7.11)

Using this approximation for GG, summing over xx^{\prime}, we get

xG2(x,t|x,t,t)12πr(t).\sum_{x^{\prime}}G^{2}(x,t|x^{\prime},t^{\prime},\mathcal{H}_{t})\simeq\frac{1}{2\sqrt{\pi r(\mathcal{H}_{t})}}. (7.12)

Thus, we have to calculate the average of 1/r(t)1/\sqrt{r(\mathcal{H}_{t})} over different histories. Here r(t)r(\mathcal{H}_{t}) was defined as the number of topplings undergone by the marked grain. Different possible trajectories of a marked grain, for a given history, do not have the same number of topplings. However, if the typical displacement of the grain is much smaller than its distance from the end, differences between these are small, and can be neglected. There are typically 𝒪(L){\cal O}(L) topplings per grain per avalanche in the model, and a grain moves a typical distance of 𝒪(L){\cal O}(\sqrt{L}) in one avalanche. Then, we can approximate r(t)r(\mathcal{H}_{t}) by N(x)N(x^{\prime}), the number of topplings at xx^{\prime}.

Let the number of topplings at xx^{\prime} at time steps τ=0,1,2,\tau=0,1,2,\ldots be denoted by N0,N1,N2,N_{0},N_{1},N_{2},\ldots. Then, N(x)=N0+N1+N2+N(x^{\prime})=N_{0}+N_{1}+N_{2}+\cdots. It can be shown that the number of topplings in different avalanches in the one dimensional ASM are nearly uncorrelated (In fact the correlation function between NiN_{i} and NjN_{j} varies as (1/L)|ij|(1/L)^{|i-j|}.). By the central limit theorem for sum of weakly correlated random variables, the mean value of NN grows linearly with τ\tau, but the standard deviation increases only as τ\sqrt{\tau}. Then, for τ0\tau\gg 0, the distribution is sharply peaked about the mean, and 1/N1/N\langle 1/\sqrt{N}\rangle\simeq 1/\sqrt{\langle N\rangle}.

Clearly, for τ0\tau\gg 0, N=τn¯(x)\langle N\rangle=\tau\bar{n}(x^{\prime}), where n¯(x)\bar{n}(x^{\prime}) is the mean number of topplings per avalanche at xx^{\prime} in the ASM, given by

n¯(x=ξL)=Lξ(1ξ)/2.\bar{n}(x=\xi L)=L\xi(1-\xi)/2. (7.13)

The upper limit on τ\tau for the validity of the above argument comes from the requirement that the width of the Gaussian be much less than the distance from the boundary, (without any loss of generality, we can assume that ξ<1/2\xi<1/2, so that it is the left boundary ), else we cannot neglect events where the marked grain leaves the pile. This gives τn¯(x)ξL\sqrt{\tau\bar{n}(x)}\ll\xi L, or equivalently, τξL.\tau\ll\xi L. Thus we get,

F(x,τ)C1L[τLξ(1ξ)]1/2,for0τξL,F(x,\tau)\simeq\frac{C_{1}}{L}[\tau L\xi(1-\xi)]^{-1/2},\mathrm{~for~~}0\ll\tau\ll\xi L, (7.14)

where C1C_{1} is some constant.

Also, we know that for τL\tau\gg L, the probability that the grain stays in the pile decays exponentially as exp(τ/L)\exp(-\tau/L) [punya]. Thus, G¯\overline{G}, and also G2¯\overline{G^{2}} will decay exponentially with τ\tau, for τL\tau\gg L. Thus, we have, for some constants C2C_{2} and aa,

F(x,τ)C2L2exp(aτ/L),forτL.F(x,\tau)\simeq\frac{C_{2}}{L^{2}}\exp(-a\tau/L),\mathrm{~~for~}\tau\gg L. (7.15)

It only remains to determine the behavior of F(x,τ)F(x,\tau), for ξLτL\xi L\ll\tau\ll L. In this case, in the ASM, there is a significant probability that the marked grain leaves the pile from the end. This results in a faster decay of GG, and hence of FF with time. We argue below that the behavior of the function F(x,τ)F(x,\tau) is given by

F(x,τ)C3Lτ,forξLτL,F(x,\tau)\sim\frac{C_{3}}{L\tau},\mathrm{~~for~~}\xi L\ll\tau\ll L, (7.16)

where C3C_{3} is some constant. This can be seen as follows: Let us consider the special case when the particle starts at a site close to the boundary. Then n¯(x)\bar{n}(x) is approximately a linear function of xx for small xx. Its spatial variation cannot be neglected, and Eq. (7.12) is no longer valid. We will now argue that in this case

G(x,t+τ|x,t,t)¯xτ2exp(x/τ),\overline{G(x,t^{\prime}+\tau|x^{\prime},t^{\prime},\mathcal{H}_{t})}\simeq x^{\prime}\tau^{-2}\exp(-x/\tau), (7.17)

for 0τL0\ll\tau\ll L. The time evolution of ProbASM(x,t|x,t)Prob_{ASM}(x,t|x^{\prime},t^{\prime}) in Eq. (7.5) is well described as a diffusion with diffusion coefficient proportional to n¯(x)\bar{n}(x) which is the mean number of topplings per avalanche at xx in the ASM [punya]. For understanding the long-time survival probability in this problem, we can equivalently consider the problem in a continuous-time version: consider a random walk on a half line where sites are labelled by positive integers, and the jump rate out of a site xx is proportional to xx. A particle starts at site x=x0x=x_{0} at time t=0t=0. If Pj(t)P_{j}(t) is the probability that the particle is at jj at time tt, then the equations for the time-evolution of Pj(t)P_{j}(t) are, for all j>0j>0,

ddtPj(t)=(j+1)Pj+1(t)+(j1)Pj1(t)2jPj(t).\frac{d}{dt}P_{j}(t)=(j+1)P_{j+1}(t)+(j-1)P_{j-1}(t)-2jP_{j}(t). (7.18)

The long time solution starting with Pj(0)=δj,x0P_{j}(0)=\delta_{j,x_{0}} is

Pj(t)x0t2exp(j/t)P_{j}(t)\simeq x_{0}t^{-2}\exp(-j/t) (7.19)

for tx0t\gg x_{0} and large jj. The probability that the particle survives till time tt decreases as 1/t1/t for large tt. We have discussed the calculation in the Appendix C.

Using Eq. (7.5), we see that G(j,t+τ|x0,t)¯\overline{G(j,t^{\prime}+\tau|x_{0},t^{\prime})} scales as x0/τ2x_{0}/\tau^{2}. It seems reasonable to assume that G2¯\overline{G^{2}} will scale as G¯2\overline{G}^{2}. Then, each term in the summation for F(x,τ)F(x,\tau) in Eq. (7.8) scales as x02/τ4x_{0}^{2}/\tau^{4}, and there are τ\tau such terms, as the sum over x0x_{0} has an upper cutoff proportional to τ\tau, and so F(x,τ)F(x,\tau) varies as 1/τ1/\tau for Lτx0L\gg\tau\gg x_{0}. This concludes the argument.

We can put these three limiting behaviors into a single functional form that interpolates between these, as

F(x,τ)1LKexp(aτ/L)τ+BτLξ(1ξ),F(x,\tau)\simeq\frac{1}{L}\frac{K\exp(-a\tau/L)}{\tau+B\sqrt{\tau L\xi(1-\xi)}}, (7.20)

where KK, aa and BB are some constants. In Section V, we will see that results from numerical simulation are consistent with this phenomenological expression.

Using this interpolation form in Eq. (7.9), and converting the sum over τ\tau to an integration over a variable u=τ/Lu=\tau/L, we can write

Σ2(x=ξL)σ2L0𝑑uKexp(au)u+Buξ(1ξ).\Sigma^{2}(x=\xi L)\simeq\frac{\sigma^{2}}{L}\int_{0}^{\infty}du\frac{K\exp(-au)}{u+B\sqrt{u\xi(1-\xi)}}. (7.21)

This integral can be simplified by a change of variable au=z2au=z^{2}, giving

Σ2(x=ξL)Kσ2LI(Bξ(1ξ)),\Sigma^{2}(x=\xi L)\simeq\frac{K\sigma^{2}}{L}I\left(B^{\prime}\sqrt{\xi(1-\xi)}\right), (7.22)

where K,BK,B^{\prime} are constants, and I(y)I(y) is a function defined by

I(y)=20𝑑zexp(z2)z+y.I(y)=2\int_{0}^{\infty}dz\frac{\exp(-z^{2})}{z+y}. (7.23)

It is easy to verify that I(y)I(y) diverges as ln(1/y)\ln(1/y) for small yy. In particular, we note that the exponential term in the integral expression for I(y)I(y) has a significant contribution only for zz near 11. We may approximate this by dropping the exponential factor, and changing the upper limit of the integral to 11. The resulting integral is easily done, giving

Σ2(x=ξL)Kσ2Lln(1+1Bξ(1ξ)),\Sigma^{2}(x=\xi L)\simeq\frac{K^{\prime}\sigma^{2}}{L}\ln\left(1+\frac{1}{B^{\prime}\sqrt{\xi(1-\xi)}}\right), (7.24)

where KK^{\prime} is some constant. Averaging Σ2(x)\Sigma^{2}(x) over xx, we get a behavior Σ2¯1/L\overline{\Sigma^{2}}\simeq 1/L. Of course, the answer is not exact, and one could have constructed other interpolation forms that have the same asymptotic behavior. We will see in the next Section that results from numerical simulations for Σ2(x)\Sigma^{2}(x) can be fitted very well to the phenomenological expression in Eq. (7.24).

7.5  Numerical results

We have tested our non-rigorous theoretical arguments against results obtained from numerical simulations. In Fig. 7.1, we have plotted the probability distribution 𝒫L(h)\mathcal{P}_{L}(h) of height at a site, averaged over all sites. We used L=200L=200, 500500 and 10001000, and averaged over 10810^{8} different configurations in the steady state. We plot the scaled distribution function 𝒫L(h)/L\mathcal{P}_{L}(h)/\sqrt{L} versus the scaled height (hh¯)L(h-\bar{h})\sqrt{L}, where h¯\bar{h} is the average height per site. Using law of mass balance it is easy to show that the average height per site is exactly equal to the average value of the addition of height, hence h¯=1.0\bar{h}=1.0 in our case. A good collapse is seen, which verifies the fact that the width of the peak varies as L1/2{L^{-1/2}}.

Refer to caption
Figure 7.1: Scaling collapse of the probability distribution 𝒫L(h)\mathcal{P}_{L}(h) of height per site in the steady state for different systems of size 200200, 500500 and 10001000. The distribution is well described by a Gaussian of width 0.1360.136.

The dependence of the variance of h(x,t)h(x,t) on xx is plotted in Fig. 7.2 for systems of length 200200, 300300 and 400400. The data was obtained by averaging over 10810^{8} avalanches. We plot (L+λ)Σ2(x)/σ2(L+\lambda)\Sigma^{2}(x)/\sigma^{2} versus xeff/Leffx_{eff}/L_{eff}, where xeffx_{eff} differs from xx by an amount δ\delta to take into account the corrections due to end effects. Then, for consistency, LL is replaced by Leff=L+2δL_{eff}=L+2\delta. For the specific choice of λ=5±1\lambda=5\pm 1 and δ=1.0±0.2\delta=1.0\pm 0.2, we get a good collapse of the curves for different LL. We also show a fit to the proposed interpolation form in Eq. (7.24), with K=1.00±0.01K^{\prime}=1.00\pm 0.01 and B=1.5±0.2B^{\prime}=1.5\pm 0.2. We see that the fit is very good.

Refer to caption
Figure 7.2: Scaling collapse of Σ2(x)/σ2\Sigma^{2}(x)/\sigma^{2} at site xx for systems of different length LL.

In order to check the logarithmic dependence of Σ2(x)\Sigma^{2}(x) on xx for small xx, we re-plot the data in Fig. 7.3 using logarithmic scale for xx. We get a good collapse of the data for different LL, supporting our proposed dependence in Eq. (7.24).

Refer to caption
Figure 7.3: The same plot in Fig. 7.2 resolved more at the left boundary of the model and taking xx axis in log scale.

7.6  Concluding remarks

To summarize, we have studied the emergence of quasi-units in the one-dimensional Zhang sandpile model. The variance of height variables in the steady state is governed by the balance between two competing processes. The randomness in the drive i.e., the height of addition, tends to increase the variance in time. On the other hand, the topplings of height variables tend to equalize the excess height by distributing it to the nearby sites. There are on an average O(L2)O(L^{2}) topplings per avalanche. Hence, in one dimension there are, on an average, O(L)O(L) topplings per site per avalanche. For large system size, the second process dominates over the first and the variance becomes low. We have shown that the variance vanishes as 1/L1/L with increasing system size and the probability distribution of height concentrates around a non-random value which depends on the height of addition. We have also proposed a functional form for the spatial dependence of variance of height which incorporates the correct limiting behaviors, and matches very well with the numerical data.

An interesting question is whether one can extend these arguments to the two-dimensional Zhang model. There is some numerical evidence for the sharpening of height peaks as the system size is increased [lubeck]. In the simplest scenario [lubeck], there are z1z-1 peaks located at multiples of the quasi-unit h0=hc(z+1)/z2h_{0}=h_{c}(z+1)/z^{2}, where zz is the lattice coordination number. This would imply that the asymptotic behavior of the two dimensional Zhang model is same as the height type BTW model in two dimension. However, this simple scenario can not be fully correct. During an avalanche, there is a finite probability that a site receives height from two neighbors in the previous time-step. If the height at the site before was (z1)h0(z-1)h_{0}, it will tranfer an height approximately equal to h0=(z+1)h0/zh_{0}^{\prime}=(z+1)h_{0}/z to its neighbors. As such events occur with nonzero probability, in the one site height distribution function, there would have to be peaks around h0h_{0}^{\prime}, h0+h0,h_{0}+h_{0}^{\prime},\cdots also. These peaks then give rise to other peaks. With many peaks, the definition of the width of a peak becomes somewhat ambiguous. As the number of topplings per site varies only as lnL\ln L, the width is expected to decrease much more slowly with LL than in one dimension.

Chapter 8 Stochastic sandpile models

Based on the paper [myjsp1] by Tridib Sadhu and Deepak Dhar.

  • Abstract:

    In this chapter, we study the steady state of the abelian sandpile models with stochastic toppling rules. The particle addition operators commute with each other, but in general these operators need not be diagonalizable. We use their abelian algebra to determine their eigenvalues, and the Jordan block structure. These are then used to determine the probability of different configurations in the steady state. We illustrate this procedure by explicitly determining the numerically exact steady state for a one dimensional example, for systems of size 12\leq 12, and also study the change in density of particles along the lattice, in the steady state.

8.1  Introduction

Sandpile models with stochastic toppling rules are important subclass of sandpile models [dharphysica06]. The first such model was studied by Manna [manna], and these are usually known as Manna models in the literature. They are able to describe the avalanche behavior seen experimentally in the piles of granular media much better than the deterministic models [osloexpt]. Also, in numerical studies, one gets better scaling collapse, and consequently, more reliable estimates for the values of the critical exponents, than for models with deterministic toppling rules [stochnum].

Unfortunately, the theoretical understanding of models with stochastic toppling rules is much less than that of their deterministic counterparts, e.g. the Bak-Tang -Wiesenfeld (BTW) model [btw]. For example, there is no analogue of the burning test to distinguish the transient and the recurrent states of a general Manna model. For the deterministic case, it is known that all the recurrent configurations occur with equal probability in the steady state. A similar characterization of the steady state is not known in the Manna case. The steady state has been explicitly determined only for the fully directed stochastic models [asap, rittenberg, kloster, paczuski]. In some cases, one can formally characterize the recurrent states of the model, e.g. the 11-dimensional Oslo rice pile model, but a straightforward direct depth-first calculation of the exact probabilities of different configurations in the steady state takes 𝒪(exp(L3))\mathcal{O}(exp{(L^{3})}) steps where LL is the system length [dharoslo]. While the exact values of the critical exponents have been conjectured for (1+1)(1+1) dimensional directed Manna model [kloster, paczuski], the prototypical undirected Manna model in one dimension has resisted an exact solution so far [dickman1, dickman2, dickman3]. In higher dimensions, most of the studies are only numerical.

The conditions under which different scaling behaviors are seen in stochastic models is a long debated issue. Initial studies suggested that the stochastic sandpile model and the BTW model exhibit similar scaling behavior [guilera, pietronero, vespignani]. However later large scale simulations showed that the stochastic sandpile models constitute a universality class different from their deterministic counterparts: the critical exponents, scaling functions and geometrical features are different for the two classes of models [biham, lubeck1, milshtein, lubeck3, tebaldi, campelo]. Further evidence came from the qualitative differences in their avalanche distribution which has a multi-fractal nature for BTW model, whereas it follows simple finite size scaling [dickman1, tebaldi, campelo] for the Manna model. Also the directed version of the above models exhibit different scaling behavior than their undirected counterparts [satorras]. Numerical results suggest that both the abelian and non-abelian Manna model constitute a universality class [biham2] different from Directed-Percolation (DP) [bonachela1]. However, the corresponding fixed points are unstable with respect to introduction of perturbation (“stickiness”) and with stickiness the critical behavior flows to the DP universality class [mohanty1, bonachela2, mohanty2]. While there is a controversy about the generic DP behavior of undirected stochastic sandpile models; for the directed case, the numerical evidence for asymptotic DP behavior is quite convincing.

While the original Manna model did not have the abelian property of the BTW model, one can construct stochastic toppling rules with abelian property [sasm]. In this paper, we discuss this abelian version of the stochastic Manna model. We shall use the terms Deterministic abelian Sandpile Models (DASM) (see Ch. 3) and Stochastic abelian Sandpile Models (SASM), if we need to distinguish between these two classes of models. In DASM the relaxation rules satisfy pair wise balance [barma], which makes the model analytically tractable and the recurrent configurations become equally probable in the steady state. However the stochastic models do not have this property, and the steady state can not be determined easily.

We use the algebra of the addition operators to determine the steady state of the model. This algebraic approach provides a computationally efficient method to determine the Markov evolution matrix of the model. The addition operators of SASM are not necessarily diagonalizable even if we restrict ourselves to the space of recurrent configurations. Using the abelian algebra we determine a generalized eigenvector basis in which the operators reduce to Jordan block form. We also define a transformation matrix between this basis and the configuration basis, and express the steady state in the latter. This procedure is illustrated by explicitly working out the case of a one dimensional Manna model. In this special case, we can show that each Jordan block is at most of dimension 22. We determine the numerically exact steady state of the model for systems of size up to 1212 and determine the asymptotic density profile by extrapolating the results.

This chapter is organized as follows: In section 8.2, we define the model precisely. In section 8.3 we recapitulate the algebra of addition operators for DASM, and use it to determine the steady state. For the stochastic models same definition for the addition operators does not work and need to be redefined. We do this in section 8.4, and discuss their algebra. Calculation of the eigenvalues and the Jordan block structure of the addition operators are given in section 8.5. The transformation matrix between the generalized eigenvector basis and the configuration basis is determined in section 8.6, and is used to determine the steady state vector in the configuration basis in section 8.7. The exact numerical determination of the steady state is discussed in section 8.8 with some concluding remarks in section 8.9.

8.2  The Model

We define a generalized Manna model on a graph of NN sites with a non-negative integer height variable ziz_{i} defined at each site ii. Let the threshold height at ii be zicz_{i}^{c}, and the site is unstable if zizicz_{i}\geq z_{i}^{c}. If the system is stable, a sand grain is added at a randomly chosen site which increases the height by 11. For each site ii, there is a set of αimax\alpha_{i}^{max} lists Eα,iE_{\alpha,i} with α=1,2,,αimax\alpha=1,2,\cdots,\alpha_{i}^{max}. If a site is unstable, it relaxes by the following toppling rule: we decrease its height by zicz_{i}^{c}. Then, with probability pα,ip_{\alpha,i}, we select the list Eα,iE_{\alpha,i}, independent of any previous selections, and then add one grain to each site in that list. If a site occurs more than once in the list, we add that many grains to that site.

Toppling at a site can make other sites unstable and they topple in their turn, until all the lattice sites are stable. Using an argument given in [sasm], it can be easily shown that the above toppling rule is abelian. Then, it follows from the abelian property that the probabilities of different final stable configurations are independent of the order in which different unstable sites are toppled.

We illustrate these rules with some examples below.

  • Model A (The one dimensional Manna model): The graph is LL sites on a line and zic=2z_{i}^{c}=2, for all sites. On toppling each grain is transfered to its neighbors with equal probability. Hence we have αimax=3\alpha_{i}^{max}=3, for all ii, with E1,i={i1,i1}E_{1,i}=\{i-1,i-1\}, E2,i={i1,i+1}E_{2,i}=\{i-1,i+1\}, and E3,i={i+1,i+1}E_{3,i}=\{i+1,i+1\} and p1,i=p3,i=1/4p_{1,i}=p_{3,i}=1/4 and p2,i=1/2p_{2,i}=1/2. Also grains can move out of the system if toppling occurs at a boundary site.

  • Model B (The one dimensional dissipative Manna model): Same as model A except that on toppling a grain can move out of the system with probability ϵ\epsilon. Then αimax=6\alpha_{i}^{max}=6 and the lists of neighbors E1={i1,i1}E_{1}=\{i-1,i-1\}, E2={i1,i+1}E_{2}=\{i-1,i+1\}, E3={i+1,i+1}E_{3}=\{i+1,i+1\}, E4={i1}E_{4}=\{i-1\}, E5={i+1}E_{5}=\{i+1\} and E6=ΦE_{6}=\Phi, where Φ\Phi is an empty set. The corresponding probabilities are p1,i=p3,i=(1ϵ)2/4p_{1,i}=p_{3,i}=(1-\epsilon)^{2}/4, p2,i=(1ϵ)2/2p_{2,i}=(1-\epsilon)^{2}/2, p4,i=p5,i=ϵ(1ϵ)p_{4,i}=p_{5,i}=\epsilon(1-\epsilon) and p6,i=ϵ2p_{6,i}=\epsilon^{2}.

    In this case, one can use periodic boundary conditions, as there is dissipation at all sites. the steady state is critical only in the limit ϵ0\epsilon\rightarrow 0. For the models A and B, it is easy to see that all stable configurations occur in the steady state with non-zero probability. We can also define stochastic models where the recurrent configurations form only an exponentially small fraction of all stable configurations. An example of this type is

  • Model C: The graph is a square lattice with NN sites and z𝐢c=2z_{\mathbf{i}}^{c}=2. Under toppling, with equal probability two particles are transfered to either horizontal or vertical neighbors. Hence αimax=2\alpha_{i}^{max}=2 with E1,𝐢={𝐢+𝐞x,𝐢𝐞x}E_{1,\mathbf{i}}=\{\mathbf{i}+\mathbf{e}_{x},\mathbf{i}-\mathbf{e}_{x}\} and E2,𝐢={𝐢+𝐞y,𝐢𝐞y}E_{2,\mathbf{i}}=\{\mathbf{i}+\mathbf{e}_{y},\mathbf{i}-\mathbf{e}_{y}\} with p1,𝐢=p2,𝐢=1/2p_{1,\mathbf{i}}=p_{2,\mathbf{i}}=1/2.

In the following we will mostly confine ourselves to Model A. Extensions to other cases present no special difficulties.

8.3  Determination of the steady state for a DASM

Before we carry out the analysis of the SASM, we recapitulate how the steady state for the DASM, defined in section 3.2.1, can be determined using the operator algebra of addition operators [dharphysica06]. Let us denote the space of stable states (see section 3.2.1) in the DASM as Γ\Gamma spanned by Ω=i=1Nzic\Omega=\prod_{i=1}^{N}z_{i}^{c} basis vectors labeled by CC. We define P(C,t)P(C,t) as the probability of finding the system in the basis CC at time tt. The time is in driving steps, i.e., it increases by one when a grain is added and the system is fully relaxed. To each set {P(C,t)}\{P(C,t)\}, we associate a vector |P(t)|P(t)\rangle belonging to the vector space Γ\Gamma, and write

|P(t)=CP(C,t)|C.|P(t)\rangle=\sum_{C}P(C,t)|C\rangle. (8.1)

This defines a state of the system at time tt. Recall that, in section 3.2.1, we have defined the particle addition operators ai\textbf{a}_{i}, for all ii, which correspond to adding a sand grain at site ii when the system is in state configuration CC, and relaxing it until a stable configuration is reached. Thus, these are linear operators which act on the vector space Γ\Gamma and maps a configuration CC, in it, to another configuration aiCa_{i}C, which is reached by the avalanche.

The time-evolution of the system is Markovian [vkampen] and the evolution operator 𝐖\mathbf{W} is defined by the master equation

|P(t+1)=𝐖|P(t),|P\left(t+1\right)\rangle=\mathbf{W}|P\left(t\right)\rangle, (8.2)

We can write the time-evolution operator in terms of the addition operators as

𝐖=1Li𝐚i,\mathbf{W}=\frac{1}{L}\sum_{i}\mathbf{a}_{i}, (8.3)

where LL is the number of sites on the lattice. To solve the time evolution, in general, we have to diagonalize the evolution operator 𝐖\mathbf{W}. Now, we have shown in section 3.2.1, that the addition operators commute with each other. Then all the addition operators {𝐚i}\left\{\mathbf{a}_{i}\right\} and hence, also 𝐖\mathbf{W} have a common set of eigenvectors. Let |ψ|\psi\rangle be one such simultaneous eigenvector of the operators {𝐚i}\left\{\mathbf{a}_{i}\right\}, with eigenvalues {eiψi}\left\{e^{i\psi_{i}}\right\}, respectively. Then

𝐚i|ψ=eiψi|ψ.\mathbf{a}_{i}|\psi\rangle=e^{i\psi_{i}}|\psi\rangle. (8.4)

Recall the definition of the toppling matrix Δi,j\Delta_{i,j}, introduced in section 3.2.1, for the DASM. Then, from the toppling rule, one can easily show, that

𝐚iΔi,i=ji𝐚jΔi,j.\mathbf{a}_{i}^{\Delta_{i,i}}=\prod_{j\neq i}\mathbf{a}_{j}^{-\Delta_{i,j}}. (8.5)

Also, recall, we have shown in section 3.2.1, that within the recurrent state space, each addition operator has an inverse. Then, the above relation can be written as

j𝐚jΔi,j=𝟏, for all i.\prod_{j}\mathbf{a}_{j}^{\Delta_{i,j}}=\mathbf{1},\textrm{ for all }i. (8.6)

Applying the LHS to the eigenvector |ψ|\psi\rangle gives exp(ijΔi,jψj)=1\exp\left(i\sum_{j}\Delta_{i,j}\psi_{j}\right)=1, for every ii, so that jΔi,jψj=2πmi\sum_{j}\Delta_{i,j}\psi_{j}=2\pi m_{i}, where mim_{i}’s are arbitrary integers. Then inverting,

ψj=2πi[Δ1]j,imi,\psi_{j}=2\pi\sum_{i}\left[\Delta^{-1}\right]_{j,i}m_{i}, (8.7)

where Δ1\Delta^{-1} is the inverse of Δ\Delta.

The particular eigenstate |0|0\rangle, corresponding to ψj=0\psi_{j}=0 for all jj, is invariant under the action of all the 𝐚\mathbf{a}’s, i.e., 𝐚i|0=|0\mathbf{a}_{i}|0\rangle=|0\rangle. Thus this must be the stationary state of the system.

8.4  Algebra of the addition operators for SASM

We use the same notations, as in the last section, but this time for a SASM. So, Γ\Gamma is the space of stable states and C{zi}C\equiv\left\{z_{i}\right\} is a stable height configuration constituting a complete set of basis vectors.

For stochastic toppling rules, the resulting state from the action of 𝐚i\mathbf{a}_{i} on a basis vector CC, is not necessarily another basis vector, but a linear combination of them. So, the addition operators have to be redefined. If the resulting configuration is CC^{\prime} with probability Pi(C|C)P_{i}(C^{\prime}|C), we define

𝐚i|C=CPi(C|C)|C,\mathbf{a}_{i}|C\rangle=\sum_{C^{\prime}}P_{i}(C^{\prime}|C)|C^{\prime}\rangle, (8.8)

for all CC. Note that the action of any of these operators on a given configuration gives a unique probability state vector.

Eq. (8.8) is a formal definition of the operators {𝐚i}\{\mathbf{a}_{i}\}. One can think of these as Ω×Ω\Omega\times\Omega matrices, but, unlike the DASM, it is quite non-trivial to actually determine the matrix elements Pi(C|C)P_{i}(C^{\prime}|C) explicitly from the toppling rules. This is because of the non-zero probability of an arbitrary large number of toppling before a steady state is reached.

For an example, consider the avalanches in model A for system of size L=3L=3. Consider the 232^{3} stable configurations as the basis vectors and denote them by their height values |z1,z2,z3|z_{1},z_{2},z_{3}\rangle. The action of a2\textbf{a}_{2} on |0,1,0|0,1,0\rangle will generate a unstable state |0,2,0|0,2,0\rangle. Using the toppling rules we can write the following set of equations for three unstable states

|0,2,0\displaystyle|0,2,0\rangle =\displaystyle= 14|2,0,0+12|1,0,1+14|0,0,2,\displaystyle\frac{1}{4}|2,0,0\rangle+\frac{1}{2}|1,0,1\rangle+\frac{1}{4}|0,0,2\rangle,
|2,0,0\displaystyle|2,0,0\rangle =\displaystyle= 14|0,2,0+12|0,1,0+14|0,0,0,\displaystyle\frac{1}{4}|0,2,0\rangle+\frac{1}{2}|0,1,0\rangle+\frac{1}{4}|0,0,0\rangle,
|0,0,2\displaystyle|0,0,2\rangle =\displaystyle= 14|0,2,0+12|0,1,0+14|0,0,0.\displaystyle\frac{1}{4}|0,2,0\rangle+\frac{1}{2}|0,1,0\rangle+\frac{1}{4}|0,0,0\rangle. (8.9)

We see that there is a nonzero probability that the avalanche can continue for more than ss toppling, for any finite ss. e.g. in the sequence |0,2,0|2,0,0|0,2,0|0,2,0\rangle\rightarrow|2,0,0\rangle\rightarrow|0,2,0\rangle\cdots. Thus straight forward application of the relaxation rules does not result in a finite procedure to determine the unstable vector |0,2,0|0,2,0\rangle in terms of the stable configurations. Instead, we have to write Eq. (8.9) as a matrix equation

M[|0,2,0|2,0,0|0,0,2]=[|1,0,1|0,1,0|0,0,0],\displaystyle\textbf{M}\begin{bmatrix}|0,2,0\rangle\\ |2,0,0\rangle\\ |0,0,2\rangle\end{bmatrix}=\begin{bmatrix}|1,0,1\rangle\\ |0,1,0\rangle\\ |0,0,0\rangle\end{bmatrix}, (8.10)

and then invert it. More generally, the determination of P(C|C)P(C^{\prime}|C) involves working in a larger space of unstable configurations.

For example in model A, there are 2L2^{L} stable configurations, where each site has 0 or 11 particle. Total number of particles is at most LL. On adding one particle, the number of particles can become L+1L+1, where initially, only one site will have height 22. However, it is easy to verify that by toppling one can generate configurations where the number of particles at a site is much greater than 22. In fact, all the L+1L+1 particles could be at the same site. Then the total number of stable and unstable configurations Ω\Omega^{\prime} is the number of ways one can distribute L+1L+1 or less particles on LL sites. It is easily seen that Ω\Omega^{\prime} varies as 4L4^{L}, and one needs to invert a matrix of size Ω×Ω\Omega^{\prime}\times\Omega^{\prime}.

There are models, generally known as the restricted sandpile models [restr1, restr2, restr3], where the toppling rules ensure that the heights do not exceed a fixed value. For these, the space of allowed configurations is much smaller. However, the height restriction makes the model non-abelian.

In this chapter we will use the operator algebra to obtain an efficient method to determine the probabilities P(C|C)P(C^{\prime}|C) explicitly which requires inverting a matrix only of size 2L×2L2^{L}\times 2^{L}. It has been shown [sasm] that the addition operators for different sites commute i.e.

[𝐚i,𝐚j]=0,foralli,j.[\mathbf{a}_{i},\mathbf{a}_{j}]=0\rm{,~~~for~all~}i,j. (8.11)

The proof uses the fact that any stochastic toppling event can be simulated by a pseudo-random generator. This essentially makes the toppling deterministic, which has the abelian property.

However, unlike the DASM, the inverse operators {𝐚i1}\{\mathbf{a}^{-1}_{i}\} for SASM need not exist, even if we restrict ourselves to the set of recurrent configurations. This is because among the recurrent states, one can have two different initial probability vectors that yield the same resultant vector. This makes the determination of the matrix form of the operators difficult for this model.

Apart from the abelian property, the operators also satisfy a set of algebraic equations, like the Eq. (8.5) in DASM. For simplicity of presentation, now on we consider zic=zcz_{i}^{c}=z_{c} and pα,i=pαp_{\alpha,i}=p_{\alpha} for all sites. Then consecutive addition of zcz_{c} grains at a site ensures that the site will topple once and transfers zcz_{c} grains to its neighbors, irrespective of the initial height. Then the operators obey the following equation

𝐚izc=αpα𝐚Eα,ifor1iN,\mathbf{a}_{i}^{z_{c}}=\sum_{\alpha}p_{\alpha}\mathbf{a}^{E_{\alpha,i}}\rm{~for~}1\leq i\leq N, (8.12)

where we have used the notation 𝐚E=xϵE𝐚x\mathbf{a}^{E}=\displaystyle\prod_{x\epsilon E}\mathbf{a}_{x} for any list EE, and

𝐚i=𝟏,\mathbf{a}_{i}=\mathbf{1}, (8.13)

for sites ii outside the lattice. In particular for the examples in section 8.4, these equations are as follows

𝐚i2\displaystyle\mathbf{a}_{i}^{2} =\displaystyle= 14(𝐚i1+𝐚i+1)2forModelA,\displaystyle\frac{1}{4}(\mathbf{a}_{i-1}+\mathbf{a}_{i+1})^{2}\rm{~~~~~~~~~~~~~~~~~~~~~~~for~Model~A,} (8.14)
𝐚i2\displaystyle\mathbf{a}_{i}^{2} =\displaystyle= [1ϵ2𝐚i1+1ϵ2𝐚i+1+ϵ𝟏]2forModelB,and\displaystyle[\frac{1-\epsilon}{2}\mathbf{a}_{i-1}+\frac{1-\epsilon}{2}\mathbf{a}_{i+1}+\epsilon\mathbf{1}]^{2}\rm{~~~~~for~Model~B,~and~} (8.15)
𝐚𝐢2\displaystyle\mathbf{a}_{\mathbf{i}}^{2} =\displaystyle= 12(𝐚𝐢𝐞x𝐚𝐢+𝐞x+𝐚𝐢𝐞y𝐚𝐢+𝐞y)forModelC.\displaystyle\frac{1}{2}(\mathbf{a}_{\mathbf{i}-\mathbf{e}_{x}}\mathbf{a}_{\mathbf{i}+\mathbf{e}_{x}}+\mathbf{a}_{\mathbf{i}-\mathbf{e}_{y}}\mathbf{a}_{\mathbf{i}+\mathbf{e}_{y}})\rm{~~~~~~~~for~Model~C.} (8.16)

8.5  Jordan Block structure of the addition operators

In general the matrices {𝐚i}\{\mathbf{a}_{i}\} need not be diagonalizable. However, using the abelian property, we can construct a common set of generalized eigenvectors for all the operators {ai}\{a_{i}\} such that in this basis the matrices simultaneously reduce to Jordan block form. These generalized eigenvectors split the vector space Γ\Gamma into disjoint subspaces, each corresponding to distinct set of eigenvalues.

Lemma 8.5.1

There will be at least one common eigenvector in each subspace, for all the addition operators.

  • Proof

    Consider one of the operators, say 𝐚1\mathbf{a}_{1}. Let Γ1\Gamma_{1} be the subspace of Γ\Gamma spanned by the (right) generalized eigenvectors of 𝐚1\mathbf{a}_{1} corresponding to the eigenvalue a1a_{1}. There is at least one such generalized eigenvector, so Γ1\Gamma_{1} is non-null. We pick one of the other addition operators, say 𝐚2\mathbf{a}_{2}. From the fact that 𝐚2\mathbf{a}_{2} commutes with 𝐚1\mathbf{a}_{1}, it immediately follows that 𝐚2\mathbf{a}_{2} acting on any vector in the subspace Γ1\Gamma_{1} leaves it within the same subspace. Diagonalizing 𝐚2\mathbf{a}_{2} within this subspace, we construct a possibly smaller but still non-null subspace Γ2\Gamma_{2} which is spanned by simultaneous generalized eigenvectors of 𝐚1\mathbf{a}_{1} and 𝐚2\mathbf{a}_{2} with eigenvalues a1a_{1} and a2a_{2}. Repeating this argument with the other operators, one can construct vectors which are simultaneous eigenvectors of all the {𝐚i}\{\mathbf{a}_{i}\}.    

Let |ψ|\psi\rangle be such an eigenvector, with

𝐚i|ψ=ai|ψ,for1iN.\mathbf{a}_{i}|\psi\rangle=a_{i}|\psi\rangle\rm{,~~~for~}\rm{~}\rm{~}1\leq i\leq N. (8.17)

Then from Eq.(66)the eigenvalues satisfy the following set of equations

aizc=αpαaEα,ifor1iN,a_{i}^{z_{c}}=\sum_{\alpha}p_{\alpha}a^{E_{\alpha,i}}\rm{~~~for~}\rm{~}\rm{~}1\leq i\leq N, (8.18)

where we have used the notation aE=xϵEaxa^{E}=\displaystyle\prod_{x\epsilon E}a_{x}, for any list EE.

Rather than work with this general case, we will consider the special case in model A for simplicity. No extra complications occur in the more general case. Then, from Eq.(8.14), the corresponding eigenvalue equation is

ai2=14(ai1+ai+1)2,for1iLa_{i}^{2}=\frac{1}{4}(a_{i-1}+a_{i+1})^{2}\rm{,~~~for~}\rm{~}\rm{~}1\leq i\leq L (8.19)

These are L coupled quadratic equations in LL complex variables {ai}\{a_{i}\}. We can reduce them to LL linear equations by taking square root

ηiai=12(ai1+ai+1),\eta_{i}a_{i}=\frac{1}{2}(a_{i-1}+a_{i+1}), (8.20)

where ηi=±1\eta_{i}=\pm 1. The Eq. (8.13) sets the values for the eigenvalues of 𝐚0\mathbf{a}_{0} and 𝐚L+1\mathbf{a}_{L+1} which are

a0=aL+1=1.a_{0}=a_{L+1}=1. (8.21)

There are 2L2^{L} different choices for the set of LL different η\eta’s and for each such choice, we get a set of eigenvalues {ai}\{a_{i}\}. In general, there will be degenerate sets of eigenvalues and the degeneracy arises if one of the aia_{i} is zero. Using the triangular inequality in (8.20) we get

2|ai||ai1|+|ai+1|,2|a_{i}|\leq|a_{i-1}|+|a_{i+1}|, (8.22)

i.e. |ai||a_{i}| are convex functions of discrete variables ii. Then, given the boundary condition in Eq. (8.21), there could at most be one ai=0a_{i}=0 in the solution for a given {ηi}\{\eta_{i}\}, which means that each eigenvalue set can be at most doubly degenerate.

Finding the number of degeneracies of solutions is interesting but difficult in general. We show that

Lemma 8.5.2

For L=3L=3 (mod 44) the number of degenerate sets of eigenvalues 2(L+1)/2\geq 2^{(L+1)/2}.

  • Proof

    Consider the system of length L=4m+3L=4m+3, with mm being a non negative integer. For any given set {ηi}\{\eta_{i}\}, i=1i=1 to 2m+22m+2, it is possible to construct a solution {bi}\{b_{i}\} of Eq. (8.20) with i2m+2i\leq 2m+2 which satisfies b0=1b_{0}=1 and b2m+2=0b_{2m+2}=0. Clearly, from Eq.(8.20), if we have the solution {ai}\{a_{i}\} corresponding to a particular set {ηj}\{\eta_{j}\}, one can construct the solution {ai}\{a_{i}^{\prime}\} corresponding to {ηj=ηj}\{\eta_{j}^{\prime}=-\eta_{j}\} using aj=(1)jaja_{j}^{\prime}=(-1)^{j}a_{j}. Using this symmetry we extend {bi}\{b_{i}\} (i=1i=1 to (L+1)/2(L+1)/2) to form a set {ai}\{a_{i}\} for i=1i=1 to LL as follows:

    ai\displaystyle a_{i} =\displaystyle= bifori2m+2,\displaystyle b_{i}\rm{~~~~~~~~~~~~~~~~~for~}i\leq 2m+2, (8.23)
    =\displaystyle= (1)ibL+1ifori>2m+2.\displaystyle(-1)^{i}b_{L+1-i}\rm{~~~for~}i>2m+2. (8.24)

    This is a solution of Eq.(8.20) for the set {ηi}\{\eta^{\prime}_{i}\} with

    ηi\displaystyle\eta_{i}^{\prime} =\displaystyle= ηifori2m+2,\displaystyle\eta_{i}\rm{~~~~~~~~~~~~~~~~~for~}i\leq 2m+2, (8.25)
    =\displaystyle= ηL+1ifori>2m+2.\displaystyle-\eta_{L+1-i}\rm{~~~~~~~~for~}i>2m+2. (8.26)

    and this solution {ai}\{a_{i}\} satisfies the boundary conditions a0=1a_{0}=1, aL+1=1a_{L+1}=1, and a2m+2=0a_{2m+2}=0 (Fig.11). There are 22m+22^{2m+2} such solutions possible corresponding to all possible sets of {ηi}\{\eta_{i}^{\prime}\}, and this gives the lower bound for the number of degenerate solutions.   

Refer to caption
Figure 8.1: The filled circles denote a dependence of the eigenvalues aia_{i} on ii for L=11L=11 with a6=0a_{6}=0. The unfilled circles show the results obtained by an inversion of aia_{i}, with i6i\leq 6, around the central site. The eigenvalues on the right-half of the lattice are obtained by multiplying (1)i(-1)^{i} to the values of the unfilled circles.

A direct numerical calculation for L20L\leq 20 shows that if L3L\neq 3 (mod 44), all 2L2^{L} sets of eigenvalues are distinct. We present the degeneracies of the solutions in Table.11. Calculation for simple choices of η\eta shows that the degeneracies are possible only if L=3L=3 (mod 44).

For example, consider ηi=1\eta_{i}=-1 for i=Li=L and for the rest of the sites it is 11. Then aia_{i} is of the form ai=1αia_{i}=1-\alpha i, for all ii. If we want this to be zero for i=ki=k, we must have α=1/k\alpha=1/k. Then, requiring that the equation (8.20) be satisfied at i=Li=L, gives 3L=4k+13L=4k+1, i.e. L=3L=3 (mod 44). Similarly for the set with ηL1=1\eta_{L-1}=-1 and 11 for rest of the sites imposes a condition on length 3L=8k+13L=8k+1, which is also a subset of L=3L=3 (mod 44). Finding a general proof that degeneracies occur only if L=3L=3 (mod 44) remain an open problem.

For each degenerate subspace there is a generalized eigenvector linearly independent of the eigenvector corresponding to the eigenvalue of the subspace. In general, let us denote them by |{ai};n|\{a_{i}\};n\rangle, where n=1n=1 for the eigenvector and n=2n=2 for the generalized eigenvector. For non-degenerate subspace nn can only be 11. The vectors satisfy the following equations

𝐚i|{aj};1\displaystyle\mathbf{a}_{i}|\{a_{j}\};1\rangle =\displaystyle= ai|{aj};1,\displaystyle a_{i}|\{a_{j}\};1\rangle,
𝐚i|{aj};2\displaystyle\mathbf{a}_{i}|\{a_{j}\};2\rangle =\displaystyle= ai|{aj};2+αi|{aj};1,\displaystyle a_{i}|\{a_{j}\};2\rangle+\alpha_{i}|\{a_{j}\};1\rangle, (8.27)

where α\alpha’s are complex numbers. Then using the Eq. (8.20) it can be shown easily that α\alpha’s satisfy the following equation

ηiαi=12(αi1+αi+1).\eta_{i}\alpha_{i}=\frac{1}{2}(\alpha_{i-1}+\alpha_{i+1}). (8.28)

This is similar to the Eq. (8.20), except the boundary conditions which are

α0=αL+1=0.\alpha_{0}=\alpha_{L+1}=0. (8.29)

For a given set of {ηi}\{\eta_{i}\}, these are LL simultaneous set of homogeneous linear equations. If {αi}\left\{\alpha_{i}\right\} is a solution, then {λαi}\left\{\lambda\alpha_{i}\right\} is also a solution. Thus there are infinitely many possible solutions, each corresponding to different choices of λ\lambda. In order to get a single solution we choose αi=1\alpha_{i}=1 if ai=0a_{i}=0, without loss of generality. This corresponds to choosing a particular normalization of the rank 22 eigenvectors. The solution of both the equations (8.20) and (8.28) can be easily obtained numerically. The generalized eigenvectors and the Jordan block form of the addition operators for the system of size L=3L=3 are given in the appendix.

 L gg N1N_{1} N2N_{2} N3N_{3} N4N_{4} N5N_{5} N6N_{6} N7N_{7} N8N_{8} N9N_{9} N10N_{10}
3 4 0 4
7 40 0 0 8 24
11 136 0 0 0 8 0 120
15 1304 0 0 0 4 32 48 288 560
19 3024 0 0 0 0 0 8 0 288 0 2432
Table 8.1: Degeneracies arise if one of the aia_{i} is zero in a solution of Eq.(8.20). In the table, gg denotes the total number of solutions with one of the ai=0a_{i}=0 i.e. the total number of degenerate sets of solution. NiN_{i} is the number of solutions with the eigenvalue ai=0a_{i}=0. Values for the other half of the system can be obtained using symmetry.

8.6  Matrix representation in the configuration basis

Given the well-defined action of the addition operators on the generalized eigenvectors it is possible to define a transformation matrix 𝐌\mathbf{M} between the configuration basis and the generalized eigenvector basis.

|{zi}=j𝐌{zi},j|ψj,|\{z_{i}\}\rangle=\sum_{j}\mathbf{M}_{\{z_{i}\},j}|\psi_{j}\rangle, (8.30)

where |{zi}|\{z_{i}\}\rangle is the basis vector of Γ\Gamma corresponding to the height configuration {zi}\{z_{i}\} and |ψj|\psi_{j}\rangle is the jjth generalized eigenvector. Let us express the configuration |{0}|\{0\}\rangle, with all sites empty, as a linear combination of all the generalized eigenvectors.

|{0}=jcj|ψj,|\{0\}\rangle=\sum_{j}c_{j}|\psi_{j}\rangle, (8.31)

where cjc_{j}s are constants. Then all the stable configurations can be obtained by adding grains at properly chosen sites in |{0}|\{0\}\rangle.

|{zi}=i𝐚izi|{0}=jcji𝐚izi|ψj,|\{z_{i}\}\rangle=\prod_{i}\mathbf{a}_{i}^{z_{i}}|\{0\}\rangle=\sum_{j}c_{j}\prod_{i}\mathbf{a}_{i}^{z_{i}}|\psi_{j}\rangle, (8.32)

and hence

𝐌{zi},j={zi}|i𝐚izi|ψj.\mathbf{M}_{\{z_{i}\},j}=\langle\{z_{i}\}|\prod_{i}\mathbf{a}_{i}^{z_{i}}|\psi_{j}\rangle. (8.33)

The action of the addition operators on the generalized eigenvectors, for example Eq.(8.27) for model A, would generate the elements of the matrix 𝐌\mathbf{M}. Given 𝐌\mathbf{M}, we can get the eigenvectors of 𝐚i\mathbf{a}_{i}, in the configuration basis, in particular, the steady state vector, by the inverse transformation

|ψj=𝐌1|{zi}.|\psi_{j}\rangle=\mathbf{M}^{-1}|\{z_{i}\}\rangle. (8.34)

The addition operators in the configuration basis are obtained using the similarity transformation 𝐌𝐚iJ𝐌1\mathbf{M}\mathbf{a}^{J}_{i}\mathbf{M}^{-1}. An explicit form of 𝐌\mathbf{M} for model A of length L=3L=3 is given in the appendix.

8.7  Determination of the steady state vector

Just like the DASM in section 8.3, the time-evolution of the system is Markovian and the evolution operator can be written in terms of the addition operators as

𝐖=1Li𝐚i.\mathbf{W}=\frac{1}{L}\sum_{i}\mathbf{a}_{i}. (8.35)

Then the common eigenvector of all the addition operators corresponding to eigenvalue 11 is the steady state vector of the system. The steady state vector can be determined in the stable configuration basis using the matrix 𝐌1\mathbf{M}^{-1}. For model A of length L=3L=3 the steady state vector is

|S=\displaystyle|S\rangle= 13392|0,0,0+116|1,0,0+47392|0,1,0+316|1,1,0\displaystyle\frac{13}{392}|0,0,0\rangle+\frac{1}{16}|1,0,0\rangle+\frac{47}{392}|0,1,0\rangle+\frac{3}{16}|1,1,0\rangle (8.36)
+116|0,0,1+1398|1,0,1+316|0,1,1+314|1,1,1,\displaystyle+\frac{1}{16}|0,0,1\rangle+\frac{13}{98}|1,0,1\rangle+\frac{3}{16}|0,1,1\rangle+\frac{3}{14}|1,1,1\rangle,

where the stable configurations are denoted by |z1,z2,z3|z_{1},z_{2},z_{3}\rangle with ziz_{i} as the height of the iith site. The amplitude of each term in the expansion is the probability of finding the corresponding height configuration in the steady state.

Refer to caption
Figure 8.2: The ratio of the probability of the most probable configuration CmaxC_{max} (all occupied) and the least probable configuration CminC_{min} (all sites empty) plotted as a function of the system length LL. The fitting function f(x)=abL+cLlogLf(x)=a-bL+cL\log L, with a=1.50,b=0.80a=1.50,b=0.80 and c=0.94c=0.94.

8.8  Numerical Results

Here we describe the results of numerical calculations for the exact steady state of model A for different system lengths and discuss its properties. As shown in Eq. (8.20) and Eq. (8.28) the eigenvalues {ai}\{a_{i}\} and the off-diagonal matrix elements {αi}\{\alpha_{i}\} form sets of linear equations for a given set of {ηi}\{\eta_{i}\}. We solve them by LU decomposition method. Because of the tridiagonal structure of the equations, only 𝒪(2L)\mathcal{O}(2^{L}) number of steps are required to get the solution. The maximum number of steps (𝒪(23L)\mathcal{O}(2^{3L})) are required for the inversion of the transformation matrix 𝐌\mathbf{M}. We have used the Gauss-Jordan elimination method for the inversion. It is important to note that, the maximum system length LL, possible to treat by this method, is determined by the limited memory of the computers, and not by the computation time. Using desktop computers we were able to determine 𝐌\mathbf{M} exactly for systems of size L12L\leq 12.

Refer to caption
Figure 8.3: The amplitudes, normalized with its largest value, corresponding to the basis vectors in the steady state plotted as a function of the rank of the basis vectors. The vectors are arranged in decreasing orders of their amplitudes. The plot is given for the configuration basis and the optimized basis for model A of size L=12L=12.

We note that as LL is increased, the second largest eigenvalue of 𝐖\mathbf{W} tends to 1/21/2. Thus, the gap between the largest and the next largest eigenvalue of the relaxation matrix does not tend to zero. This gap measures the relaxation time of the system in terms of the macro-time unit of interval between addition of grains. However, the average duration of an avalanche measured in terms of micro-time unit of duration of a single toppling event does diverge, as system size increases.

An interesting question is the extent of variation between probabilities of different configurations in the steady state. In the one-dimensional Oslo model, for a system of LL sites, the ratio of probabilities of the most probable to the least probable configuration varies as exp(L3)\exp(L^{3})[dharoslo]. However in model A, we find that the ratio is not quit as large, and it only varies approximately as exp(0.94LlogL)\exp(0.94L\log L) (Fig.8.2) for large LL.

This suggests that the exact steady state is not a product measure state. To check this we define a product basis |ψ=i|ψi|\psi^{\prime}\rangle=\displaystyle\prod_{i}|\psi_{i}^{\prime}\rangle, where |ψi|\psi_{i}^{\prime}\rangle could be any one of the two orthogonal vectors

|1\displaystyle|1^{\prime}\rangle =\displaystyle= cosϕi|1+sinϕi|0,\displaystyle\cos\phi_{i}|1\rangle+\sin\phi_{i}|0\rangle,
|0\displaystyle|0^{\prime}\rangle =\displaystyle= sinϕi|1cosϕi|0,\displaystyle\sin\phi_{i}|1\rangle-\cos\phi_{i}|0\rangle, (8.37)

with ϕi\phi_{i} a real number. Then in this basis the steady state can be written as

|S=ψP(ψ)|ψ.|S\rangle=\sum_{\psi^{\prime}}P(\psi^{\prime})|\psi^{\prime}\rangle. (8.38)

We choose {ϕi}\{\phi_{i}\} so that the ratio between the amplitudes of basis vectors with next-largest and largest amplitudes becomes as small as possible (this would become zero, if the state was a product measure state). In Fig.8.3, we have plotted for system of size L=12L=12, the relative amplitudes in both configuration basis and the optimized product basis as a function of the rank of the basis vectors with the vectors arranged in decreasing orders of their amplitudes. In the optimized basis the second highest probability is only 1010 times smaller than the highest probability. This shows that the steady state measure is not a product measure.

Refer to caption
Figure 8.4: Average steady state density ρL(i)\rho_{L}(i) at site ii for model A of different length LL.
L~~~~~L~~~~~ ρ¯L~~~~~~\bar{\rho}_{L}~~~~~~ ρL(xm)~~~~~~\rho_{L}(x_{m})~~~~~~
2 0.583333 0.583333
3 0.634354 0.709184
4 0.669262 0.737000
5 0.695210 0.769704
6 0.715472 0.786491
7 0.731879 0.805897
8 0.745514 0.816009
9 0.757080 0.827217
10 0.767051 0.834600
11 0.775760 0.842665
12 0.783451 0.848054
Table 8.2: The values of particle density in the steady state for the model A of different length LL. Here ρ¯L\bar{\rho}_{L} denotes the steady state particle density averaged over all sites and ρL(xm)\rho_{L}(x_{m}) denotes the steady state particle density at the central site.
 L 1/ρ¯1/\bar{\rho}_{\infty} BB ν\nu_{\perp}
3     1.061     1.128     0.656
4 1.049 1.132 0.641
5 1.053 1.132 0.646
6 1.049 1.131 0.640
7 1.050 1.131 0.641
8 1.049 1.130 0.639
9 1.049 1.130 0.639
10 1.049 1.130 0.639
11 1.049 1.130 0.639
Table 8.3: The sequential fit of the functional form in Eq. (8.40) to the data for average particle density for model A of different length LL given in Table 22.

The steady state density for different sites are plotted in Fig. 8.4 for different system sizes. Amongst the different fitting forms that we tried, the following functional form gives the best fit

1ρL(x)=1ρ¯+b[1(x+d)ν+1(L+1x+d)ν],\frac{1}{\rho_{L}(x)}=\frac{1}{\bar{\rho}_{\infty}}+b[\frac{1}{(x+d)^{\nu_{\perp}}}+\frac{1}{(L+1-x+d)^{\nu_{\perp}}}], (8.39)

where ρ¯,b,ν\bar{\rho}_{\infty},b,\nu_{\perp} and dd are real numbers. Using this functional form the steady state particle density averaged over all sites for system of size LL can be written as

1ρ¯L=1ρ¯+B(L+δ)ν,\frac{1}{\bar{\rho}_{L}}=\frac{1}{\bar{\rho}_{\infty}}+\frac{B}{(L+\delta)^{\nu_{\perp}}}, (8.40)

where BB is a real number and ρ¯\bar{\rho}_{\infty} is the asymptotic value of the average particle density. The exact value of ρ¯L\bar{\rho}_{L} and the particle density at the central site ρL(xm)\rho_{L}(x_{m}) are listed in the Table 22 for different system sizes. The sequential fitting method is used to find the values of ρ¯\bar{\rho}_{\infty}, BB, ν\nu_{\perp} and δ\delta from these data. For a given choice of δ\delta, these values are obtained numerically by solving the Eq. (8.40) for three consecutive lengths L1L-1, LL and L+1L+1. Best convergence of the values of ρ¯\bar{\rho}_{\infty}, BB and ν\nu_{\perp} are obtained for δ=1.1\delta=1.1, which are tabulated in Table 33. The asymptotic value of the average particle density converges to ρ¯=0.953\bar{\rho}_{\infty}=0.953 which is close to the more precise estimate 0.94885(7)0.94885(7), from Monte Carlo simulations [dickman1].

8.9  Concluding remarks.

For a general SASM with NN sites, the calculation of eigenvalues involves solving NN coupled polynomial equations in NN variables. This can be done in time polynomial in Ω\Omega, the number of stable configurations of the model. These are then used to construct the transformation matrix 𝐌{\bf M} of size Ω×Ω\Omega\times\Omega. Finally inverting the matrix 𝐌{\bf M} gives us the eigenvectors of the evolution operator, in particular the steady state.

Of course, to determine the steady state of any Markov chain on Ω\Omega states, we need to determine the eigenvectors of the evolution matrix of size Ω×Ω\Omega\times\Omega. The point here is that the specification of the toppling rules does not directly specify the evolution matrix, and determining the matrix elements of the latter from the toppling rules is computationally very nontrivial. Using the abelian property, we are able to tackle this problem.

For a generic model with some parameters, e.g. the model B, except for special symmetries, one does not expect degeneracies in eigenvalues to occur for a generic value of the parameters. For special values of the parameters, if there is a non-trivial Jordan block structure of the evolution operator, it would show up in the time-dependent correlation functions of the model by the presence of terms of the type texp(λjt)t\exp(-\lambda_{j}t), in addition to the usual sum of terms of the type exp(λjt)\exp(-\lambda_{j}t).

In particular we have explicitly calculated the steady state for a specific model (model A in section 2) of length L12\leq 12. Extrapolating the results we determined the asymptotic density profile in the steady state. The power-law profile of deviations from the mean value near the ends would be important for determining the avalanche exponents of the model [lubeck4]. This remains an interesting open problem.

Appendix A Solution of Laplace’s equation on hexagonal lattice

We follow the calculation given in [atkinson]. Let FrF_{r} be the solution of the Poisson equation

rFrmFr=Ir,\sum_{r^{\prime}}F_{r^{\prime}}-mF_{r}=I_{r}, (A.1)

defined on a lattice, where the sum is carried over the nearest neighbors of the vertex rr and mm is the total number of them. For a hexagonal lattice m=3m=3 and for a triangular lattice m=6m=6. Clearly a hexagonal lattice can be constructed from a triangular lattice by a ΔY\Delta-Y transformation as shown in the Fig.A.1. Let FrhexF_{r}^{hex} and FrtriF_{r}^{tri} are the solutions of the Poisson equation with same IrI_{r} defined at the common vertices and Ir=0I_{r}=0 for the additional vertices in the hexagonal lattice. It is easy to check that Frhex=3FrtriF_{r}^{hex}=3F_{r}^{tri} for the common vertices and for the additional ones the solution is the average of its value at the neighboring sites (see Fig.A.2). We first detrmine FtriF^{tri} and then use the relation to determine FhexF^{hex}.

Refer to caption
Figure A.1: A hexagonal lattice can be constructed from a triangular lattice by a ΔY\Delta-Y transformation. Blue solid lines form a triangular lattice and the red dotted lines form a hexagonal lattice.
Refer to caption
Figure A.2: If FrF_{r} is a solution of the Poisson equation on the triangle with charge Ir-I_{r} defined at the vertices, then 3Fr3F_{r} is a solution on the YY shaped graph with the same charges.

Consider a triangular lattice with lattice edges of length 11. Each vertex on the lattice is denoted by a pair of integers (p,q)\left(p,q\right) where the complex coordinate of a site is

z=p32+iq12,z=p\frac{\sqrt{3}}{2}+iq\frac{1}{2}, (A.2)

with p+q=p+q= even. The Poisson equation on this lattice is

Fp+1,q+1tri+Fp+1,q1tri+Fp1,q+1tri+Fp1,q1tri+Fp,q+2tri+Fp,q2tri6Fp,qtri=Ip,qF^{tri}_{p+1,q+1}+F^{tri}_{p+1,q-1}+F^{tri}_{p-1,q+1}+F^{tri}_{p-1,q-1}+F^{tri}_{p,q+2}+F^{tri}_{p,q-2}-6F^{tri}_{p,q}=I_{p,q} (A.3)

Define the discrete Fourier transformation

V(k1,k2)=pqexp[i(32k1p+12k2q)]Fp,qV\left(k_{1},k_{2}\right)=\sum_{p}\sum_{q}\exp\left[-i\left(\frac{\sqrt{3}}{2}k_{1}p+\frac{1}{2}k_{2}q\right)\right]F_{p,q} (A.4)
Fp,q=32π32π3dk14π2π2πdk24πexp[i(32k1p+12k2q)]V(k1,k2)F_{p,q}=\sqrt{3}\int_{-\frac{2\pi}{\sqrt{3}}}^{\frac{2\pi}{\sqrt{3}}}\frac{dk_{1}}{4\pi}\int_{-2\pi}^{2\pi}\frac{dk_{2}}{4\pi}\exp\left[i\left(\frac{\sqrt{3}}{2}k_{1}p+\frac{1}{2}k_{2}q\right)\right]V\left(k_{1},k_{2}\right) (A.5)

Using the expression in equation A.5 it can be shown that

V(k1,k2)=I~(k1,k2)4cos(3k1/2)cos(k2/2)+2cos(k2)6,V\left(k_{1},k_{2}\right)=\frac{\widetilde{I}\left(k_{1},k_{2}\right)}{4\cos\left(\sqrt{3}k_{1}/2\right)\cos\left(k_{2}/2\right)+2\cos\left(k_{2}\right)-6}, (A.6)

where I~(k1,k2)\widetilde{I}\left(k_{1},k_{2}\right) is the discrete Fourier transformation of Ip,qI_{p,q}. We are interested in a solution with Ip,q=Iδp,0δq,0I_{p,q}=I\delta_{p,0}\delta_{q,0}, where II is normalization constant. Also considering the condition that the function Fp,qtri=0F_{p,q}^{tri}=0, at the origin, it can be shown that

Fp,qtri=I396π22π32π32π2π1cos(3k1p/2+k2q/2)1(2cos(3k1/2)cos(k2/2)+cos(k2)).F^{tri}_{p,q}=\frac{I\sqrt{3}}{96\pi^{2}}\int_{-\frac{2\pi}{\sqrt{3}}}^{\frac{2\pi}{\sqrt{3}}}\int_{-2\pi}^{2\pi}\frac{1-\cos\left(\sqrt{3}k_{1}p/2+k_{2}q/2\right)}{1-\left(2\cos\left(\sqrt{3}k_{1}/2\right)\cos\left(k_{2}/2\right)+\cos\left(k_{2}\right)\right)}. (A.7)

Using the relation between FrhexF_{r}^{hex} and FrtriF_{r}^{tri} and with a simple change of variables we get the expression in equation 6.21.

Appendix B Relation to the theory of discrete analytic functions

The sandpile patterns we studied are characterized in terms of discrete analytic functions (DAF) on different discretizations of the complex plane. For the pattern in Fig. 6.10, it is the DAF on a hexagonal lattice, which increases logarithmically at large distances as in Eq. (6.27).

Studies of DAF started with the work of Kirchhoff on resistor networks [hu, cserti, Doyle], and has been studied subsequently by many others [duffin, mercat]. However, we have not encountered any work on DAF on many sheeted Riemann surfaces. In the following we present a way to determine DAF on a square discretization of Riemann surfaces.

Consider a square grid of points z=mϵ+inϵz=m\epsilon+in\epsilon, where m,nm,n are integers and ϵ\epsilon is the lattice spacing. Let f(mϵ,nϵ)f\left(m\epsilon,n\epsilon\right) be a complex function defined at every site on the grid. The function ff is defined to be discrete analytic [laszlo] if it satisfies the discrete Cauchy Riemann condition

f(z3)f(z1)z3z1=f(z4)f(z2)z4z2,\frac{f\left(z_{3}\right)-f\left(z_{1}\right)}{z_{3}-z_{1}}=\frac{f\left(z_{4}\right)-f\left(z_{2}\right)}{z_{4}-z_{2}}, (B.1)

at all elementary squares on the grid as shown in Fig. B.1.

In complex analysis, simple examples of analytic functions are znz^{n}, and any polynomial of znz^{n} is also analytic. For DAF, it is clear, using the linearity of equation (B.1), that sum of DAF is also discrete analytic. However, not all positive integer powers of zz are discrete analytic. It is easy to check that the functions 11, zz, z2z^{2}, z3z^{3} are discrete analytic, but z4z^{4} is not. We can however construct polynomial functions of Re(z)Re(z) and Im(z)Im(z), that are discrete analytic. Two such examples are z4zz¯ϵ2z^{4}-z\overline{z}\epsilon^{2} and z55z2z¯ϵ2/2z^{5}-5z^{2}\overline{z}\epsilon^{2}/2.

Refer to caption
Figure B.1: A square grid on the complex plane.

We define a function Fn(z,ϵ)F_{n}(z,\epsilon) as a homogeneous polynomial in zz, z¯\overline{z} and ϵ\epsilon, of degree nn, which is a DAF. Using homogeneity, we have

Fn(z,ϵ)=anFn(za,ϵa),F_{n}(z,\epsilon)=a^{n}F_{n}(\frac{z}{a},\frac{\epsilon}{a}), (B.2)

and then using a=ϵa=\epsilon, we can express Fn(z,ϵ)F_{n}(z,\epsilon) in terms of Fn(z,1)F_{n}(z,1). This fixes Fn(z,ϵ)F_{n}(z,\epsilon) up to a multiplicative constant. The normalization is fixed by requiring that as ϵ\epsilon tends to zero, Fn(z,ϵ)znF_{n}\left(z,\epsilon\right)\rightarrow z^{n}. Then using Cauchy Riemann conditions it is easily seen that Fn(z,ϵ)F_{n}(z,\epsilon), for all integers n0n\geq 0, has a series expansion in ϵ2\epsilon^{2} of the form

Fn(z,ϵ)=zn[1+ϵ2z2g1(n)(z¯z)+12!ϵ4z4g2(n)(z¯z)+],F_{n}(z,\epsilon)=z^{n}\left[1+\frac{\epsilon^{2}}{z^{2}}g_{1}^{(n)}(\frac{\overline{z}}{z})+\frac{1}{2!}\frac{\epsilon^{4}}{z^{4}}g_{2}^{(n)}(\frac{\overline{z}}{z})+\cdots\right], (B.3)

where

g1(n)(x)\displaystyle g_{1}^{(n)}(x) =\displaystyle= 1n3(n4)x,\displaystyle-\frac{1}{n-3}\binom{n}{4}x, (B.4)
g2(n)(x)\displaystyle g_{2}^{(n)}(x) =\displaystyle= 7!(4!)21n6(n7)x2,\displaystyle\frac{7!}{(4!)^{2}}\frac{1}{n-6}\binom{n}{7}x^{2}, (B.5)
g3(n)(x)\displaystyle g_{3}^{(n)}(x) =\displaystyle= 10!(4!)31n9(n10)x327n7(n8)x,\displaystyle-\frac{10!}{(4!)^{3}}\frac{1}{n-9}\binom{n}{10}x^{3}-\frac{27}{n-7}\binom{n}{8}x,

and so on. For an integer nn, this series will terminate after a finite number of terms, and all of them can be determined iteratively.

It is possible to analytically continue the functions for rational values of nn. For example,

g1(n)(x)=Γ(n+1)4!Γ(n2)x.g_{1}^{(n)}(x)=-\frac{\Gamma(n+1)}{4!\Gamma(n-2)}x. (B.7)

Then, this analytic continuation of Fn(z,ϵ)F_{n}(z,\epsilon) provides us the discrete analytic functions which in the limit |z||z|\rightarrow\infty grows as znz^{n}, for any real positive values of nn. It is interesting to note that the function Dm,nD_{m,n}, used in [myepl] to characterize the pattern in Fig. 1.3(b), is equal to F1/2(z=m+in,ϵ=1)F_{1/2}(z=m+in,\epsilon=1), up to a multiplicative constant. The patterns in the presence of a line of sinks, or near wedges studied in [myjsp] involve other rational values. For example, for the pattern near a line sink, one requires the function F1/3(z,1)F_{1/3}(z,1).

Appendix C Solution of the Eq. (5.18)

Here we discuss the solution of the Eq. (7.18) for the starting values given by

Pj(t=0)=αj1.P_{j}(t=0)=\alpha^{j-1}. (C.1)

We start with an ansatz Pj(t)=btexp(atj)P_{j}(t)=b_{t}\exp(-a_{t}j), where both ata_{t} and btb_{t} are functions only of tt. This form satisfies the Eq. (7.18) for all jj, t>0t>0, if ata_{t} and btb_{t} satisfy

datdt\displaystyle\frac{da_{t}}{dt} =\displaystyle= 2eateat,\displaystyle 2-e^{a_{t}}-e^{-a_{t}}, (C.2)
dbtdt\displaystyle\frac{db_{t}}{dt} =\displaystyle= bt(eateat).\displaystyle b_{t}(e^{-a_{t}}-e^{a_{t}}). (C.3)

To solve the Eq. (C.2), we first make a change of variable z=eatz=e^{-a_{t}}. In terms of zz, the equation becomes dz/dt=(1z)2dz/dt=(1-z)^{2}, which can be easily integrated to give

eat=t+A1t+A,e^{-a_{t}}=\frac{t+A-1}{t+A}, (C.4)

where AA is an integration constant. To satisfy the initial condition in Eq. (C.1), we choose

A=(1α)1.A=(1-\alpha)^{-1}. (C.5)

Similarly, to solve the equation for btb_{t}, we use the form of eate^{-a_{t}} given in Eq. (C.4) and get

dbtdt=bt12(t+A)(t+A)(t+A1).\frac{db_{t}}{dt}=b_{t}\frac{1-2(t+A)}{(t+A)(t+A-1)}. (C.6)

This can be integrated to give

bt=B(t+A)(t+A1),b_{t}=\frac{B}{(t+A)(t+A-1)}, (C.7)

where BB is an integration constant. Then the probability can be written as

Pj(t)=B(t+A1)j1(t+A)j+1,P_{j}(t)=B\frac{(t+A-1)^{j-1}}{(t+A)^{j+1}}, (C.8)

where to satisfy the initial condition at t=0t=0, we have used the integration constant B=(1α)2B=(1-\alpha)^{-2}. Then, with these values of AA and BB, we have the solution for all jj, t>0t>0, given by

Pj(t)\displaystyle P_{j}(t) =\displaystyle= [(1α)t+α]j1[(1α)t+1]j+1\displaystyle\frac{\left[(1-\alpha)t+\alpha\right]^{j-1}}{\left[(1-\alpha)t+1\right]^{j+1}} (C.9)
=\displaystyle= ϕj(α,t),say.\displaystyle\phi_{j}(\alpha,t),\mathrm{~~~~~say}.

Now, as ϕj(α,t)\phi_{j}(\alpha,t) satisfies the Eq. (7.18),

ψj,n(α,t)=1(n1)!n1ϕj(t)αn1\psi_{j,n}(\alpha,t)=\frac{1}{(n-1)!}\frac{\partial^{n-1}\phi_{j}(t)}{\partial\alpha^{n-1}} (C.10)

will also satisfy the equation for any natural number nn. In addition,

ψj,n(α=0,t=0)=δj,n.\psi_{j,n}(\alpha=0,t=0)=\delta_{j,n}. (C.11)

Hence, we see that the solution of the Eq. (7.18), starting with Pj(t)=δj,nP_{j}(t)=\delta_{j,n} at t=0t=0 is

Pj(t)=ψj,n(α=0,t)=1(n1)!n1ϕj(α,t)αn1α=0,P_{j}(t)=\psi_{j,{n}}(\alpha=0,t)=\frac{1}{(n-1)!}\frac{\partial^{n-1}\phi_{j}(\alpha,t)}{\partial\alpha^{n-1}}\mid_{\alpha=0}, (C.12)

for all jj, t>0t>0, where ϕj(α,t)\phi_{j}(\alpha,t) is given in Eq. (C.9) and nn is any natural number.

From (C.9) and (C.12) it easily follows that for large tt and jj, the solution asymptotically is Pj(t)nt2exp(j/t)P_{j}(t)\simeq nt^{-2}\exp(-j/t).

Appendix D Jordon Block for L=3 SASM

Here we give some details of the explicit calculation of the steady state, and the matrix representation of addition operators for model A of length L=3L=3.

The eight sets of eigenvalues obtained by solving Eq.(8.20) are (1,1,1)(1,1,1), (1,1,1)(-1,1,-1), (13,13,13)(\frac{1}{3},-\frac{1}{3},\frac{1}{3}), (13,13,13)(-\frac{1}{3},-\frac{1}{3},-\frac{1}{3}), (12,0,12)(\frac{1}{2},0,-\frac{1}{2}), and (12,0,12)(-\frac{1}{2},0,\frac{1}{2}) with the last two sets repeated twice.

For writing the matrix structure of the addition operators, we choose the order of the eigenvectors same as the order of the eigenvalues mentioned above. For the degenerate subspace we order the eigenvector |{ai};1|\{a_{i}\};1\rangle, defined in Eq.(8.27), before the generalized eigenvector |{ai};2|\{a_{i}\};2\rangle. Then in this basis the matrices corresponding to the addition operators have the following Jordan block form.

a1J=(100000000100000000130000000013000000001212000000012000000001212000000012),\displaystyle\textbf{a}^{J}_{1}=\begin{pmatrix}1~&~0~&~0~&~0~&~0~&~0~&~0~&~0\\ 0~&-1&~0~&~0~&~0~&~0~&~0~&~0\\ 0~&~0~&~\frac{1}{3}~&~0~&~0~&~0~&~0~&~0\\ 0~&~0~&~0~&-\frac{1}{3}&~0~&~0~&~0~&~0\\ 0~&~0~&~0~&~0~&~\frac{1}{2}~&~\frac{1}{2}~&~0~&~0\\ 0~&~0~&~0~&~0~&~0~&~\frac{1}{2}~&~0~&~0\\ 0~&~0~&~0~&~0~&~0~&~0~&-\frac{1}{2}&-\frac{1}{2}\\ 0~&~0~&~0~&~0~&~0~&~0~&~0~&-\frac{1}{2}\end{pmatrix}, (D.1)
a2J=(100000000100000000130000000013000000000100000000000000000100000000),\displaystyle\textbf{a}^{J}_{2}=\begin{pmatrix}1~&~0~&~0~&~0~&~0~&~0~&~0~&~0\\ 0~&~1~&~0~&~0~&~0~&~0~&~0~&~0\\ 0~&~0~&-\frac{1}{3}&~0~&~0~&~0~&~0~&~0\\ 0~&~0~&~0~&-\frac{1}{3}&~0~&~0~&~0~&~0\\ 0~&~0~&~0~&~0~&~0~&~1~&~0~&~0\\ 0~&~0~&~0~&~0~&~0~&~0~&~0~&~0\\ 0~&~0~&~0~&~0~&~0~&~0~&~0~&~1\\ 0~&~0~&~0~&~0~&~0~&~0~&~0~&~0\end{pmatrix}, (D.2)
a3J=(100000000100000000130000000013000000001212000000012000000001212000000012),\displaystyle\textbf{a}^{J}_{3}=\begin{pmatrix}1~&~0~&~0~&~0~&~0~&~0~&~0~&~0\\ 0~&-1&~0~&~0~&~0~&~0~&~0~&~0\\ 0~&~0~&~\frac{1}{3}~&~0~&~0~&~0~&~0~&~0\\ 0~&~0~&~0~&-\frac{1}{3}&~0~&~0~&~0~&~0\\ 0~&~0~&~0~&~0~&-\frac{1}{2}&-\frac{1}{2}&~0~&~0\\ 0~&~0~&~0~&~0~&~0~&-\frac{1}{2}&~0~&~0\\ 0~&~0~&~0~&~0~&~0~&~0~&~\frac{1}{2}~&~\frac{1}{2}\\ 0~&~0~&~0~&~0~&~0~&~0~&~0~&~\frac{1}{2}\end{pmatrix}, (D.3)

The transformation matrix 𝐌\mathbf{M}, discussed in section 55, between the generalized eigenvector basis and the configuration basis has the following form

M=(11111111111/31/311/211/2111/31/31010111/91/91/201/20111/31/311/211/2111/91/93/41/43/41/4111/91/91/201/20111/271/271/401/40),\displaystyle\textbf{M}=\begin{pmatrix}1~&~1~&~1~&~1~&~1~&~1~&~1~&~1\\ 1~&-1~&~1/3~&-1/3~&~1~&~1/2~&-1~&-1/2\\ 1~&~1~&-1/3~&-1/3~&~1~&~0~&~1~&~0\\ 1~&-1~&-1/9~&~1/9~&~1/2~&~0~&-1/2~&~0\\ 1~&-1~&~1/3~&-1/3~&-1~&-1/2~&~1~&~1/2\\ 1~&~1~&~1/9~&~1/9~&-3/4~&-1/4~&-3/4~&-1/4\\ 1~&-1~&-1/9~&~1/9~&-1/2~&~0~&~1/2~&~0\\ 1~&~1~&-1/27~&-1/27~&-1/4~&~0~&-1/4~&~0\end{pmatrix}, (D.4)

where the configuration basis vectors are chosen in the following order (0,0,0)(0,0,0), (1,0,0)(1,0,0), (0,1,0)(0,1,0), (1,1,0)(1,1,0), (0,0,1)(0,0,1), (1,0,1)(1,0,1), (0,1,1)(0,1,1), and (1,1,1)(1,1,1). The matrix is non-singular, and the inverse can be calculated numerically. Using the similarity transformation 𝐌𝐚1J𝐌1\mathbf{M}\mathbf{a}_{1}^{J}\mathbf{M}^{-1} we find matrix representation of the addition operator 𝐚1\mathbf{a}_{1} in the configuration basis.

a1=(02704490000100001240190470224900000010011201972000007240190170164910000000071203772000170010),\displaystyle\textbf{a}_{1}=\begin{pmatrix}0~&~\frac{2}{7}~&~0~&~\frac{4}{49}~&~0~&~0~&~0~&~0\\ 1~&~0~&~0~&~0~&~0~&~\frac{1}{24}~&~0~&~\frac{1}{9}\\ 0~&~\frac{4}{7}~&~0~&~\frac{22}{49}~&~0~&~0~&~0~&~0\\ 0~&~0~&~1~&~0~&~0~&~\frac{1}{12}~&~0~&~\frac{19}{72}\\ 0~&~0~&~0~&~0~&~0~&~\frac{7}{24}~&~0~&~\frac{1}{9}\\ 0~&~\frac{1}{7}~&~0~&~\frac{16}{49}~&~1~&~0~&~0~&~0\\ 0~&~0~&~0~&~0~&~0~&~\frac{7}{12}~&~0~&~\frac{37}{72}\\ 0~&~0~&~0~&~\frac{1}{7}~&~0~&~0~&~1~&~0\end{pmatrix}, (D.5)

The other operators can also be determined similarly.

Bibliography

  • [AD95] Agha Afsar Ali and Deepak Dhar, Breakdown of simple scaling in abelian sandpile models in one dimension, Phys. Rev. E 51 (1995), no. 4, R2705–R2708.
  • [Ali95a] Agha Afsar Ali, Self-organized criticality in a sandpile model with threshold dissipation, Phys. Rev. E 52 (1995), no. 5, R4595–R4598.
  • [Ali95b]   , Self-organized criticality in a sandpile model with threshold dissipation, Phys. Rev. E 52 (1995), no. 5, R4595–R4598.
  • [AR08] F. C. Alcaraz and V. Rittenberg, Directed abelian algebras and their application to stochastic models, Phys. Rev. E 78 (2008), no. 4, 041126.
  • [AS99] D. Atkinson and F.J.van Steenwijk, Infinite resistive lattices, Am. J. Phys. 67 (1999), no. 6, 486–492.
  • [Bak96a] P. Bak, How nature works, first ed., ch. 1, p. 14, Copernicus, New York, 1996.
  • [Bak96b]   , How nature works, first ed., ch. 1, p. 31, Copernicus, New York, 1996.
  • [BCF+01] Jayanth R. Banavar, Francesca Colaiori, Alessandro Flammini, Amos Maritan, and Andrea Rinaldo, Scaling, optimality, and landscape evolution, Journal of Statistical Physics 104 (2001), 1–48.
  • [BCK97] Ph. Blanchard, B. Cessac, and T. Krüger, A dynamical system approach to soc models of Zhang’s type, Journal of Statistical Physics 88 (1997), 307–318.
  • [BHB96a] A. Ben-Hur and O. Biham, Universality in sandpile models, Phys. Rev. Lett. 53 (1996), 1317–1320.
  • [BHB96b] Asa Ben-Hur and Ofer Biham, Universality in sandpile models, Phys. Rev. E 53 (1996), no. 2, R1317–R1320.
  • [BMM01] Ofer Biham, Erel Milshtein, and Ofer Malcai, Evidence for universality within the classes of deterministic and stochastic sandpile models, Phys. Rev. E 63 (2001), no. 6, 061309.
  • [BMn08] Juan A. Bonachela and Miguel A. Muñoz, Confirming and extending the hypothesis of universality in sandpiles, Phys. Rev. E 78 (2008), no. 4, 041102.
  • [BMQR08] A. F. Boer, R. Meester, C. Quant, and F. Redig, A probabilistic approach to Zhang’s sandpile model, Communications in Mathematical Physics 280 (2008), 351–388.
  • [BN07] Matthew Baker and Serguei Norine, Riemann-roch and abel-jacobi theory on a finite graph, Advances in Mathematics 215 (2007), no. 2, 766 – 788.
  • [BR02] Yvan Le Borgne and Dominique Rossin, On the identity of the sandpile group, Discrete Math. 256 (2002), no. 3, 775–790.
  • [BRC+06] Juan A. Bonachela, José J. Ramasco, Hugues Chaté, Ivan Dornic, and Miguel A. Muñoz, Sticky grains do not change the universality class of isotropic sandpiles, Phys. Rev. E 74 (2006), no. 5, 050102.
  • [BS93] Per Bak and Kim Sneppen, Punctuated equilibrium and criticality in a simple model of evolution, Phys. Rev. Lett. 71 (1993), no. 24, 4083–4086.
  • [BTW87] P. Bak, C. Tang, and K. Wiesenfeld, Self-organized criticality: An explanation of the 1/f noise, Phys. Rev. Lett. 59 (1987), no. 4, 381–384.
  • [CGMP09] L. Corté, S. J. Gerbode, W. Man, and D. J. Pine, Self-organized criticality in sheared suspensions, Phys. Rev. Lett. 103 (2009), no. 24, 248301.
  • [CPS08] Sergio Caracciolo, Guglielmo Paoletti, and Andrea Sportiello, Explicit characterization of the identity configuration in an abelian sandpile model, Journal of Physics A: Mathematical and Theoretical 41 (2008), no. 49, 495003.
  • [Cre91] M. Creutz, Abelian sandpiles, Comput. Phys. 5 (1991), 198–203.
  • [Cse00] József Cserti, Application of the lattice green’s function for calculating the resistance of an infinite network of resistors, Amer. J. Phys. 68 (2000), no. 10, 896–906.
  • [CVZ99] A. Chessa, A. Vespignani, and S. Zapperi, Critical exponents in stochastic sandpile models, Computer Physics Communications 121-122 (1999), 299 – 302.
  • [DAAMn+01] Ronald Dickman, Mikko Alava, Miguel A. Muñoz, Jarkko Peltola, Alessandro Vespignani, and Stefano Zapperi, Critical behavior of a one-dimensional fixed-energy stochastic sandpile, Phys. Rev. E 64 (2001), no. 5, 056104.
  • [DBM95] G. Durin, G. Bertotti, and A. Magni, Fractals, scaling and the question of self-organized criticality in magnetization processes, Fractals 3 (1995), no. 2, 351–370.
  • [DC03] R. Dickman and J. M. M. Campelo, Avalanche exponents and corrections to scaling for a stochastic sandpile, Phys. Rev. E 67 (2003), no. 6, 066111.
  • [DD97] Deepak Dhar and Abhishek Dhar, Distribution of sizes of erased loops for loop-erased random walks, Phys. Rev. E 55 (1997), no. 3, R2093–R2096.
  • [Dha90] Deepak Dhar, Self-organized critical state of sandpile automaton models, Phys. Rev. Lett. 64 (1990), no. 14, 1613–1616.
  • [Dha99a] D. Dhar, Studying Self-Organized Criticality with Exactly Solved Models, arXiv:cond-mat/9909009 (1999).
  • [Dha99b] Deepak Dhar, The abelian sandpile and related models, Physica A: Statistical Mechanics and its Applications 263 (1999), no. 1-4, 4 – 25.
  • [Dha99c]   , Some results and a conjecture for manna’s stochastic sandpile model, Physica A: Statistical Mechanics and its Applications 270 (1999), no. 1-2, 69 – 81.
  • [Dha04]   , Steady state and relaxation spectrum of the Oslo rice-pile model, Physica A: Statistical Mechanics and its Applications 340 (2004), no. 4, 535 – 543.
  • [Dha06]   , Theoretical studies of self-organized criticality, Physica A: Statistical and Theoretical Physics 369 (2006), no. 1, 29 – 70.
  • [Dic06] Ronald Dickman, Critical exponents for the restricted sandpile, Phys. Rev. E 73 (2006), no. 3, 036131.
  • [DM90] D Dhar and S N Majumdar, Abelian sandpile model on the bethe lattice, Journal of Physics A: Mathematical and General 23 (1990), no. 19, 4333.
  • [DMS00] Mario De Menech and Attilio L. Stella, From waves to avalanches: Two different mechanisms of sandpile dynamics, Phys. Rev. E 62 (2000), no. 4, R4528–R4531.
  • [DP04] D. Dhar and P. Pradhan, Probability distribution of residence times of grains in sand-pile models, Journal of Statistical Mechanics: Theory and Experiment 2004 (2004), no. 05, P05002.
  • [DR99] Peter Sheridan Dodds and Daniel H. Rothman, Unified view of scaling laws for river networks, Phys. Rev. E 59 (1999), no. 5, 4865–4877.
  • [DS84] Peter G. Doyle and J. Laurie Snell, Random walks and electric networks, Mathematical Association of America, Washington, DC, 1984.
  • [DS86] B. Duplantier and H. Saleur, Exact surface and wedge exponents for polymers in two dimensions, Phys. Rev. Lett. 57 (1986), no. 25, 3179–3182.
  • [DS92] B. Drossel and F. Schwabl, Self-organized critical forest-fire model, Phys. Rev. Lett. 69 (1992), no. 11, 1629–1632.
  • [DSC09] D. Dhar, T. Sadhu, and S. Chandra, Pattern formation in growing sandpiles, Europhys. Lett. 85 (2009), no. 4, 48002.
  • [dSdO09] Evandro F da Silva and Mário J de Oliveira, An asymmetric sandpile model with height restriction, Journal of Physics A: Mathematical and Theoretical 42 (2009), no. 38, 385003.
  • [dSV92] Maria de Sousa Vieira, Self-organized criticality in a deterministic mechanical model, Phys. Rev. A 46 (1992), no. 10, 6288–6293.
  • [DTdO02] Ronald Dickman, Tânia Tomé, and Mário J. de Oliveira, Sandpiles with height restrictions, Phys. Rev. E 66 (2002), no. 1, 016111.
  • [Duf56] R. J. Duffin, Basic properties of discrete analytic functions., Duke Mathematical Journal 23 (1956), no. 2, 335–363.
  • [FCMS+96] V. Frette, K. Christensen, A. Malthe-Sorenssen, J. Feder, T. Jossang, and P. Meakin, Avalanche dynamics in a pile of rice, nature 379 (1996), 49–52.
  • [FdBR08] Anne Fey-den Boer and Frank Redig, Limiting shapes for deterministic centrally seeded growth models, Journal of Statistical Physics 130 (2008), 579–597.
  • [Fei78] Mitchell J. Feigenbaum, Quantitative universality for a class of nonlinear transformations, Journal of Statistical Physics 19 (1978), 25–52.
  • [FLP10] Anne Fey, Lionel Levine, and Yuval Peres, Growth rates and explosions in sandpiles, Journal of Statistical Physics 138 (2010), 143–159.
  • [FV06] Maurizio Falcone and Stefano Finzi Vita, A finite-difference approximation of a two-layer system for growing sandpiles, SIAM Journal on Scientific Computing 28 (2006), no. 3, 1120–1132.
  • [FWNL95] Stuart Field, Jeff Witt, Franco Nori, and Xinsheng Ling, Superconducting vortex avalanches, Phys. Rev. Lett. 74 (1995), no. 7, 1206–1209.
  • [GDG98] Achille Giacometti and Albert Díaz-Guilera, Dynamical properties of the Zhang model of self-organized criticality, Phys. Rev. E 58 (1998), no. 1, 247–253.
  • [GH02] G. Pruessner and H. Jeldtoft Jensen, A solvable non-conservative model of self-organised criticality, Europhys. Lett. 58 (2002), no. 2, 250–256.
  • [GQ00] J. Gravner and J. Quastel, Internal DLA and the stefan problem., Ann. Prob. 28 (2000), no. 4, 1528–1562.
  • [GR56] B. Gutenberg and C. F. Richter, Ann. Geophysics. 9 (1956), 1.
  • [GZ96] Peter Grassberger and Yi-Cheng Zhang, Self-organized formulation of standard percolation phenomena, Physica A: Statistical and Theoretical Physics 224 (1996), no. 1-2, 169 – 179.
  • [Her86a] H. J. Herrmann, Geometrical cluster growth models and kinetic gelation, Physics Reports 136 (1986), no. 3, 153 – 224.
  • [Her86b] H. J. Herrmann, Geometrical cluster growth models and kinetic gelation, Physics Reports 136 (1986), no. 3, 153 – 224.
  • [HK99] K. P. Hadeler and C. Kuttler, Dynamical models for granular matter., vol. 2, pp. 9–18, Springer-Verlag, Berlin, 1999.
  • [J9́0] Imre M. Jánosi, Effect of anisotropy on the self-organized critical state, Phys. Rev. A 42 (1990), no. 2, 769–774.
  • [J.98] Jensen H. J., Self-organized criticality: Emergent complex behavior in physical and biological systems, Cambridge University Press, 1998.
  • [JLN89] H. M. Jaeger, Chu-heng Liu, and Sidney R. Nagel, Relaxation at the angle of repose, Phys. Rev. Lett. 62 (1989), no. 1, 40–43.
  • [JNB96] Heinrich M. Jaeger, Sidney R. Nagel, and Robert P. Behringer, Granular solids, liquids, and gases, Rev. Mod. Phys. 68 (1996), no. 4, 1259–1273.
  • [Kam07] NG Van Kampen, Stochastic processes in physics and chemistry, North Holland, 2007.
  • [Kin85] W. Kinzel, Phase transitions of cellular automata, Zeitschrift für Physik B Condensed Matter 58 (1985), 229–244.
  • [KMT01] Morten Kloster, Sergei Maslov, and Chao Tang, Exact solution of a stochastic directed sandpile model, Phys. Rev. E 63 (2001), no. 2, 026111.
  • [KNWZ89] Leo P. Kadanoff, Sidney R. Nagel, Lei Wu, and Su-min Zhou, Scaling and universality in avalanches, Phys. Rev. A 39 (1989), no. 12, 6524–6537.
  • [L9̈7] S. Lübeck, Large-scale simulations of the Zhang sandpile model, Phys. Rev. E 56 (1997), no. 2, 1590–1594.
  • [L0̈0]   , Moment analysis of the probability distribution of different sandpile models, Phys. Rev. E 61 (2000), no. 1, 204–209.
  • [LD01] S. Lübeck and D. Dhar, Continuously varying exponents in a sandpile model with dissipation near surface, Journal of Statistical Physics 102 (2001), 1–14.
  • [LE95] Barabasi L. and Stanley H. E., Fractal concepts in surface growth, Cambridge University Press, 1995.
  • [LHG07] A. Levina, J. M. Herrmann, and T. Geisel, Dynamical synapses causing self-organized criticality in neural networks, Nat Phys 3 (2007), 857–860.
  • [LKG90] S. H. Liu, Theodore Kaplan, and L. J. Gray, Geometry and dynamics of deterministic sand piles, Phys. Rev. A 42 (1990), no. 6, 3207–3212.
  • [LLT91] S.-C. Lee, N. Y. Liang, and W.-J. Tzeng, Exact solution of a deterministic sandpile model in one dimension, Phys. Rev. Lett. 67 (1991), no. 12, 1479–1481.
  • [Lov04] L. Lova´\acute{a}sz, Discrete analytic functions: An exposition., second ed., pp. 241–273, Int. Press, Somerville, MA, 2004.
  • [LP07] L. Levine and Y. Peres, Scaling limits for internal aggregation models with multiple sources, arXiv:0712.3378v2 (2007).
  • [LP08]   , Spherical asymptotics for the rotor-router model in d\mathbb{Z}^{d}, Indiana Univ. Math. J. 57 (2008), 431–450.
  • [LP10] L. Levine and J. Propp, What is a sandpile?, Notices of the AMS 57 (2010), 976–979.
  • [LU97a] S. Lübeck and K. D. Usadel, Numerical determination of the avalanche exponents of the Bak-Tang-Wiesenfeld model, Phys. Rev. E 55 (1997), 4095–4099.
  • [LU97b] S. Lübeck and K. D. Usadel, Numerical determination of the avalanche exponents of the Bak-Tang-Wiesenfeld model, Phys. Rev. E 55 (1997), no. 4, 4095–4099.
  • [Lüb00] S. Lübeck, Moment analysis of the probability distribution of different sandpile models, Phys. Rev. E 61 (2000), no. 1, 204–209.
  • [Man91] S S Manna, Two-state model of self-organized criticality, Journal of Physics A: Mathematical and General 24 (1991), no. 7, L363.
  • [MBS98a] E. Milshtein, O. Biham, and S. Solomon, Universality classes in isotropic, abelian, and non-abelian sandpile models, Phys. Rev. E 58 (1998), no. 1, 303–310.
  • [MBS98b] Erel Milshtein, Ofer Biham, and Sorin Solomon, Universality classes in isotropic, abelian, and non-abelian sandpile models, Phys. Rev. E 58 (1998), no. 1, 303–310.
  • [MD92] S.N. Majumdar and Deepak Dhar, Equivalence between the abelian sandpile model and the q–>0 limit of the Potts model, Physica A: Statistical Mechanics and its Applications 185 (1992), no. 1-4, 129 – 145.
  • [MD02] P. K. Mohanty and Deepak Dhar, Generic sandpile models have directed percolation exponents, Phys. Rev. Lett. 89 (2002), no. 10, 104303.
  • [MD07] P.K. Mohanty and Deepak Dhar, Critical behavior of sandpile models with sticky grains, Physica A: Statistical Mechanics and its Applications 384 (2007), no. 1, 34 – 38.
  • [Mer01] C. Mercat, Discrete Riemann surfaces and the Ising model., Commun. Math. Phys. 218 (2001), 177–216.
  • [MG97] S. S. Manna and D. Giri, Sandpile model with activity inhibition, Phys. Rev. E 56 (1997), no. 5, R4914–R4917.
  • [MS00] M. D. Menech and A. L. Stella, From waves to avalanches: Two different mechanisms of sandpile dynamics, Phys. Rev. E 62 (2000), no. 4, R4528–R4531.
  • [MT99] Bruce D. Malamud and Donald L. Turcotte, Self-organized criticality applied to natural hazards, Natural Hazards 20 (1999), 93–116.
  • [MZ96] Sergei Maslov and Yi-Cheng Zhang, Self-organized critical directed percolation, Physica A: Statistical and Theoretical Physics 223 (1996), no. 1-2, 1 – 6.
  • [OFC92] Zeev Olami, Hans Jacob S. Feder, and Kim Christensen, Self-organized criticality in a continuous, nonconservative cellular automaton modeling earthquakes, Phys. Rev. Lett. 68 (1992), no. 8, 1244–1247.
  • [ORN98] C. J. Olson, C. Reichhardt, and Franco Nori, Fractal networks, braiding channels, and voltage noise in intermittently flowing rivers of quantized magnetic flux, Phys. Rev. Lett. 80 (1998), no. 10, 2197–2200.
  • [Ost03] Srdjan Ostojic, Patterns formed by addition of grains to only one site of an abelian sandpile, Physica A: Statistical Mechanics and its Applications 318 (2003), no. 1-2, 187 – 199.
  • [PB96] Maya Paczuski and Stefan Boettcher, Universality in sandpiles, interface depinning, and earthquake models, Phys. Rev. Lett. 77 (1996), no. 1, 111–114.
  • [PB00] Maya Paczuski and Kevin E. Bassler, Theoretical results for sandpile models of self-organized criticality with multiple topplings, Phys. Rev. E 62 (2000), no. 4, 5347–5352.
  • [PDDK96] V. B. Priezzhev, Deepak Dhar, Abhishek Dhar, and Supriya Krishnamurthy, Eulerian walkers as a model of self-organized criticality, Phys. Rev. Lett. 77 (1996), no. 25, 5079–5082.
  • [Pea93] John E. Pearson, Complex Patterns in a Simple System, Science 261 (1993), no. 5118, 189–192.
  • [PN06] Ole Peters and J. David Neelin, Critical phenomena in atmospheric precipitation, Nat Phys (2006), 393–396.
  • [PPH03] A. M. Povolotsky, V. B. Priezzhev, and Chin-Kun Hu, The asymmetric avalanche process, Journal of Statistical Physics 111 (2003), 1149–1182.
  • [Pri00] V. B. Priezzhev, The upper critical dimension of the abelian sandpile model, Journal of Statistical Physics 98 (2000), 667–684.
  • [PSV00] Romualdo Pastor-Satorras and Alessandro Vespignani, Universality classes in directed sandpile models, Journal of Physics A: Mathematical and General 33 (2000), no. 3, L33.
  • [PZL+05] Gui-Jun Pan, Duan-Ming Zhang, Zhi-Hua Li, Hong-Zhang Sun, and Yan-Ping Ying, Critical behavior in non-abelian deterministic directed sandpile, Physics Letters A 338 (2005), no. 3-5, 163 – 168.
  • [RA00] R. Pastor-Satorras and A. Vespignani, Anomalous scaling in the Zhang model, Eur. Phys. J. B 18 (2000), no. 2, 197–200.
  • [RMAS00] R. Dickman, M.A. Muñuz, A. Vespignani, and S. Zapperi, Paths to self-organised criticality, Brazilian Journal of physics 30 (2000), no. 1, 27–41.
  • [RS92] P Ruelle and S Sen, Toppling distributions in one-dimensional abelian sandpiles, Journal of Physics A: Mathematical and General 25 (1992), no. 22, L1257.
  • [Sad10] T. Sadhu, A self-organized critical model of rearranging hydrogen-bonded network in ice, arXiv:1009.5995 (2010).
  • [SD08] T. Sadhu and D. Dhar, Emergence of quasiunits in the one-dimensional zhang model, Phys. Rev. E 77 (2008), no. 3, 031122.
  • [SD09]   , Steady state of stochastic sandpile models, Journal of Statistical Physics 134 (2009), 427–441.
  • [SD10]   , Pattern formation in growing sandpiles with multiple sources or sinks, Journal of Statistical Physics 138 (2010), 815–837.
  • [SD12] Tridib Sadhu and Deepak Dhar, Pattern formation in fast-growing sandpiles, Phys. Rev. E 85 (2012), 021107.
  • [SDK+93] James P. Sethna, Karin Dahmen, Sivan Kartha, James A. Krumhansl, Bruce W. Roberts, and Joel D. Shore, Hysteresis and hierarchies: Dynamics of disorder-driven first-order phase transformations, Phys. Rev. Lett. 70 (1993), no. 21, 3347–3350.
  • [SDV04] Jürgen F Stilck, Ronald Dickman, and Ronaldo R Vidigal, Series expansion for a stochastic sandpile, Journal of Physics A: Mathematical and General 37 (2004), no. 4, 1145.
  • [Sne95] Kim Sneppen, Extremal dynamics and punctuated co-evolution, Physica A: Statistical and Theoretical Physics 221 (1995), no. 1-3, 168 – 179.
  • [Sor94] Didier Sornette, Sweeping of an instability : an alternative to self-organized criticality to get powerlaws without parameter tuning, J. Phys. I France 4 (1994), no. 2, 209–221.
  • [Spi01] F. Spitzer, Principles of random walk, second ed., ch. 3, p. 148, Springer, New York, 2001.
  • [SRB96] Gunter M Schütz, Ramakrishna Ramaswamy, and Mustansir Barma, Pairwise balance and invariant measures for generalized exclusion processes, Journal of Physics A: Mathematical and General 29 (1996), no. 4, 837.
  • [SS78] L. S. Schulman and P. E. Seiden, Statistical mechanics of a dynamical system based on Conway’s game of life, Journal of Statistical Physics 19 (1978), 293–314.
  • [SS99] Dietrich Stauffer and Didier Sornette, Self-organized percolation model for stock market fluctuations, Physica A: Statistical Mechanics and its Applications 271 (1999), no. 3-4, 496 – 506.
  • [SS09] D. Speyer and B. Sturmfels, Tropical mathematics, Mathematics Magazine 82 (2009), 163–173(11).
  • [Tak89] Hideki Takayasu, Steady-state distribution of generalized aggregation system with injection, Phys. Rev. Lett. 63 (1989), no. 23, 2563–2565.
  • [TI92] Hideki Takayasu and Hajime Inaoka, New type of self-organized criticality in a model of erosion, Phys. Rev. Lett. 68 (1992), no. 7, 966–969.
  • [VD05] Ronaldo Vidigal and Ronald Dickman, Asymptotic behavior of the order parameter in a stochastic sandpile, Journal of Statistical Physics 118 (2005), 1–25.
  • [VDMnZ98] Alessandro Vespignani, Ronald Dickman, Miguel A. Muñoz, and Stefano Zapperi, Driving, conservation, and absorbing states in sandpiles, Phys. Rev. Lett. 81 (1998), no. 25, 5676–5679.
  • [VZP95] Alessandro Vespignani, Stefano Zapperi, and Luciano Pietronero, Renormalization approach to the self-organized critical behavior of sandpile models, Phys. Rev. E 51 (1995), no. 3, 1711–1724.
  • [WS83] T. A. Witten and L. M. Sander, Diffusion-limited aggregation, Phys. Rev. B 27 (1983), no. 9, 5686–5697.
  • [Wu82] F. Y. Wu, The potts model, Rev. Mod. Phys. 54 (1982), no. 1, 235–268.
  • [ZCDS98] Stefano Zapperi, Pierre Cizeau, Gianfranco Durin, and H. Eugene Stanley, Dynamics of a ferromagnetic domain wall: Avalanches, depinning transition, and the Barkhausen effect, Phys. Rev. B 58 (1998), no. 10, 6353–6366.
  • [Zha89] Yi-Cheng Zhang, Scaling theory of self-organized criticality, Phys. Rev. Lett. 63 (1989), no. 5, 470–473.