Abstract: Start with a graph with a subset of vertices called {it the border}. A particle released from the origin performs a random walk on the graph until it comes to the immediate neighbourhood of the border, at which point it joins this subset thus increasing the border by one point. Then a new particle is released from the origin and the process repeats until the origin becomes a part of the border itself. We are interested in the total number of particles to be released by this final moment. We show that this model covers OK Corral model as well as the erosion model, and obtain distributions and bounds for in cases where the graph is star graph, regular tree, and a dimensional lattice.
Recommendations
Cites work
- scientific article; zbMATH DE number 3934150 (Why is no real title available?)
- scientific article; zbMATH DE number 4060392 (Why is no real title available?)
- scientific article; zbMATH DE number 3517666 (Why is no real title available?)
- scientific article; zbMATH DE number 3560403 (Why is no real title available?)
- Coalescing particles on an interval
- Fluctuations for internal DLA on the comb
- Hitting probabilities of random walks on \({\mathbb{Z}}^ d\)
- Internal DLA and the Gaussian free field
- Internal DLA in higher dimensions
- Lower bounds on fluctuations for internal DLA
- Martingales in the Ok Corral
- Probability. Theory and examples.
- Random walk: A modern introduction
- Reinforced random walk
- Solution to the OK Corral model via decoupling of Friedman's urn
- Sublogarithmic fluctuations for internal DLA
- The Ok Corral and the Power of the Law (A Curious Poisson-Kernel Formula for a Parabolic Equation)
Cited in
(3)
This page was built for publication: Border aggregation model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1661564)