Line Percolation in Finite Projective Planes
From MaRDI portal
Abstract: We study combinatorial parameters of a recently introduced bootstrap percolation problem in finite projective planes. We present sharp results on the size of the minimum percolating sets and the maximal non-percolating sets. Additional results on the minimal and maximal percolation time as well as on the critical probability in the projective plane are also presented.
Recommendations
- Percolation on the projective plane
- Line percolation
- Exceptional planes of percolation
- Percolation in the hyperbolic plane
- Percolation, perimetry, planarity
- Percolation of random nodal lines
- Continuum line-of-sight percolation on Poisson-Voronoi tessellations
- Percolation on uniform infinite planar maps
Cites work
- Bootstrap percolation in living neural networks
- Bootstrap percolation on the Hamming torus
- Finite geometry and combinatorial applications
- Growth rates and explosions in sandpiles
- scientific article; zbMATH DE number 3121305 (Why is no real title available?)
- Line percolation
- Maximum Percolation Time in Two-Dimensional Bootstrap Percolation
- Noisy Contagion Without Mutation
- On the maximum running time in graph bootstrap percolation
- Random graphs and complex networks. Volume 1
- The sharp threshold for bootstrap percolation in all dimensions
- The time of graph bootstrap percolation
- Upper tails for counting objects in randomly induced subhypergraphs and rooted random graphs
This page was built for publication: Line Percolation in Finite Projective Planes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4637326)
