Diffusion limited aggregation on the Boolean lattice

DOI10.1214/18-AAP1392MaRDI QIDQ1634178zbMATH OpenFDO

Authors Wesley Pegden, Alan Frieze

Publication date 17 December 2018

Published in The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1705.00692, https://projecteuclid.org/euclid.aoap/1538985628

zbMATH Keywords

Boolean cubedla

Mathematics Subject Classification ID

Combinatorial probability (60C05) Interface problems; diffusion-limited aggregation in time-dependent statistical mechanics (82C24)

Abstract: In the Diffusion Limited Aggregation (DLA) process on 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)$.

Recommendations

• scientific article; zbMATH DE number 218618
• Internal diffusion limited aggregation
• Diffusion-limited aggregation on the hyperbolic plane
• scientific article; zbMATH DE number 19291
• Diffusion limited aggregation on a cylinder

Cites work

• Concentration inequalities. A nonasymptotic theory of independence
• Diffusion-limited aggregation on the hyperbolic plane
• scientific article; zbMATH DE number 1047716 (Why is no real title available?)
• Percolation, first-passage percolation and covering times for Richardson's model on the \(n\)-cube
• Symbolic and numeric computations of the Barnes function
• Unoriented first-passage percolation on the n-cube

Cited in

(4)

• Aggregation under local reinforcement: From lattice to continuum
• scientific article; zbMATH DE number 218618 (Why is no real title available?)
• Computational Complexity of Biased Diffusion-Limited Aggregation
• Rotor-router aggregation on the layered square lattice

This page was built for publication: Diffusion limited aggregation on the Boolean lattice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1634178)