Diffusion limited aggregation on the Boolean lattice
From MaRDI portal
Publication:1634178
DOI10.1214/18-AAP1392zbMATH Open1404.60021arXiv1705.00692MaRDI QIDQ1634178FDOQ1634178
Authors: Wesley Pegden, Alan Frieze
Publication date: 17 December 2018
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Abstract: In the Diffusion Limited Aggregation (DLA) process on on , or more generally , 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 . Very little has been shown rigorously about the process, however. We study an analogous process on the Boolean lattice , in which particles take random decreasing walks from , and stick at the last vertex before they encounter an occupied site for the first time; the vertex 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 .
Full work available at URL: https://arxiv.org/abs/1705.00692
Recommendations
Combinatorial probability (60C05) Interface problems; diffusion-limited aggregation in time-dependent statistical mechanics (82C24)
Cites Work
- Concentration inequalities. A nonasymptotic theory of independence
- Symbolic and numeric computations of the Barnes function
- Diffusion-limited aggregation on the hyperbolic plane
- Unoriented first-passage percolation on the \(n\)-cube
- Percolation, first-passage percolation and covering times for Richardson's model on the \(n\)-cube
- Title not available (Why is that?)
Cited In (3)
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)