2017
DOI: 10.1090/bull/1573
|View full text |Cite
|
Sign up to set email alerts
|

Laplacian growth, sandpiles, and scaling limits

Abstract: Laplacian growth is the study of interfaces that move in proportion to harmonic measure. Physically, it arises in fluid flow and electrical problems involving a moving boundary. We survey progress over the last decade on discrete models of (internal) Laplacian growth, including the abelian sandpile, internal DLA, rotor aggregation, and the scaling limits of these models on the lattice Z d as the mesh size goes to zero. These models provide a window into the tools of discrete potential theory: harmonic function… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
17
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 23 publications
(17 citation statements)
references
References 75 publications
0
17
0
Order By: Relevance
“…• allows to consider constant time basic operations, • preserves the "dynamical complexity", within P and with P-hard problems. Unbounded values bring considerations of another kind (namely, of computing fixed points from a single column of sand grains, as in [45,46,47,58]) not necessary to capture the intrinsic complexity of the problem. Cell positions are also admitted to be given using O(log(n d )) bits which is o(n d ) (see Lemma 3 for a polynomial bound on the most distant cell that can receive a grain).…”
Section: Stable Prediction Problem (S-pred)mentioning
confidence: 99%
“…• allows to consider constant time basic operations, • preserves the "dynamical complexity", within P and with P-hard problems. Unbounded values bring considerations of another kind (namely, of computing fixed points from a single column of sand grains, as in [45,46,47,58]) not necessary to capture the intrinsic complexity of the problem. Cell positions are also admitted to be given using O(log(n d )) bits which is o(n d ) (see Lemma 3 for a polynomial bound on the most distant cell that can receive a grain).…”
Section: Stable Prediction Problem (S-pred)mentioning
confidence: 99%
“…Sandpiles are a lattice model of self-organized criticality, introduced by Bak, Tang and Wiesenfeld [3], and have been studied in both physics and mathematics. See the surveys [10], [15], [23], [9], [6]. Although the model can easily be defined on an arbitrary finite connected graph, in this paper we will restrict to subsets of Z d .…”
Section: Definitions and Backgroundmentioning
confidence: 99%
“…The limit shape of the divisible sandpile cluster was identified on ℤ in [LP09], on homogeneous trees in [Lev09], and on the comb lattice in [HS12]. See also the recent survey [LP16] for an introduction to the divisible sandpile model. The aim of this paper is to identify the limit shape of the divisible sandpile cluster on the doubly-infinite Sierpinski gasket graph SG, by making strong use of the property of SG of being finitely ramified, which means that it can be disconnected by removing a finite number of points.…”
Section: Introductionmentioning
confidence: 99%