The Annals of Applied Probability

Diffusion limited aggregation on the Boolean lattice

Alan Frieze and Wesley Pegden

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text


In the Diffusion Limited Aggregation (DLA) process on $\mathbb{Z}^{2}$, or more generally $\mathbb{Z}^{d}$, particles aggregate to an initially occupied origin by arrivals on a random walk. The scaling limit of the result, empirically, is a fractal with dimension strictly less than $d$. Very little has been shown rigorously about the process, however.

We study an analogous process on the Boolean lattice $\{0,1\}^{n}$, in which particles take random decreasing walks from $(1,\dots,1)$, and stick at the last vertex before they encounter an occupied site for the first time; the vertex $(0,\dots,0)$ is initially occupied. In this model, we can rigorously prove that lower levels of the lattice become full, and that the process ends by producing an isolated path of unbounded length reaching $(1,\dots,1)$.

Article information

Ann. Appl. Probab., Volume 28, Number 6 (2018), 3528-3557.

Received: May 2017
Revised: December 2017
First available in Project Euclid: 8 October 2018

Permanent link to this document

Digital Object Identifier

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier

Primary: 60C05: Combinatorial probability
Secondary: 82C24: Interface problems; diffusion-limited aggregation

DLA Boolean cube


Frieze, Alan; Pegden, Wesley. Diffusion limited aggregation on the Boolean lattice. Ann. Appl. Probab. 28 (2018), no. 6, 3528--3557. doi:10.1214/18-AAP1392.

Export citation


  • [1] Adamchik, V. S. (2004). Symbolic and numeric computations of the Barnes function. Comput. Phys. Commun. 157 181–190.
  • [2] Benjamini, I. and Yadin, A. (2017). Upper bounds on the growth rate of diffusion limited aggregation. arXiv:1705.06095v1.
  • [3] Bollobás, B. and Kohayakawa, Y. (1997). On Richardson’s model on the hypercube. In Combinatorics, Geometry and Probability (Cambridge, 1993) 129–137. Cambridge Univ. Press, Cambridge.
  • [4] Boucheron, S., Lugosi, G. and Massart, P. (2013). Concentration Inequalities: A Nonasymptotic Theory of Independence. Oxford Univ. Press, Oxford.
  • [5] Eberz-Wagner, D. M. (1999). Discrete Growth Models. ProQuest LLC, Ann Arbor, MI. (Ph.D. thesis—University of Washington.)
  • [6] Eldan, R. (2015). Diffusion-limited aggregation on the hyperbolic plane. Ann. Probab. 43 2084–2118.
  • [7] Fill, J. A. and Pemantle, R. (1993). Percolation, first-passage percolation and covering times for Richardson’s model on the $n$-cube. Ann. Appl. Probab. 3 593–629.
  • [8] Kesten, H. (1987). How long are the arms in DLA? J. Phys. A 20 L29–L33.
  • [9] Martinsson, A. (2016). Unoriented first-passage percolation on the $n$-cube. Ann. Appl. Probab. 26 2597–2625.
  • [10] Witten, T. A. and Sander, L. M. (1983). Diffusion-limited aggregation. Phys. Rev. B 27 5686–5697.