Nucleation and growth in two dimensions
From MaRDI portal
Publication:5113932
Abstract: We consider a dynamical process on a graph , in which vertices are infected (randomly) at a rate which depends on the number of their neighbours that are already infected. This model includes bootstrap percolation and first-passage percolation as its extreme points. We give a precise description of the evolution of this process on the graph , significantly sharpening results of Dehghanpour and Schonmann. In particular, we determine the typical infection time up to a constant factor for almost all natural values of the parameters, and in a large range we obtain a stronger, sharp threshold.
Recommendations
- Bootstrap percolation on \(G(n,p)\) revisited
- A sharper threshold for bootstrap percolation in two dimensions
- The second term for two-neighbour bootstrap percolation in two dimensions
- The sharp threshold for bootstrap percolation in all dimensions
- Maximum Percolation Time in Two-Dimensional Bootstrap Percolation
Cited In (5)
This page was built for publication: Nucleation and growth in two dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5113932)