Line percolation
From MaRDI portal
Abstract: We study a new geometric bootstrap percolation model, line percolation, on the -dimensional integer grid . In line percolation with infection parameter , infection spreads from a subset of initially infected lattice points as follows: if there exists an axis-parallel line with or more infected lattice points on it, then every lattice point of on gets infected, and we repeat this until the infection can no longer spread. The elements of the set are usually chosen independently, with some density , and the main question is to determine , the density at which percolation (infection of the entire grid) becomes likely. In this paper, we determine up to a multiplicative factor of and up to a multiplicative constant as for every fixed . We also determine the size of the minimal percolating sets in all dimensions and for all values of the infection parameter.
Recommendations
- Bernoulli line percolation
- Line-of-sight percolation
- Percolation of random nodal lines
- Line Percolation in Finite Projective Planes
- Subcritical percolation with a line of defects
- scientific article; zbMATH DE number 1552074
- scientific article; zbMATH DE number 2125073
- scientific article; zbMATH DE number 806906
- Percolation
Cited in
(8)- Percolating sets in bootstrap percolation on the Hamming graphs and triangular graphs
- Triangle percolation on the grid
- Bootstrap percolation on the Hamming graphs
- Bootstrap percolation on the product of the two-dimensional lattice with a Hamming square
- Two-dimensional supercritical growth dynamics with one-dimensional nucleation
- Lower bounds for graph bootstrap percolation via properties of polynomials
- Maximal spanning time for neighborhood growth on the Hamming plane
- Line Percolation in Finite Projective Planes
This page was built for publication: Line percolation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4584912)