The critical probability for confetti percolation equals 1/2
From MaRDI portal
Publication:4978434
DOI10.1002/rsa.20675zbMath1370.60191arXiv1504.07879OpenAlexW2226815080MaRDI QIDQ4978434
Publication date: 10 August 2017
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.07879
Related Items (4)
Leaves on the line and in the plane ⋮ Phase transitions and noise sensitivity on the Poisson space via stopping sets and decision trees ⋮ Percolation of even sites for enhanced random sequential adsorption ⋮ Criticality and covered area fraction in confetti and Voronoi percolation
Cites Work
- Unnamed Item
- Exceptional planes of percolation
- The critical probability for random Voronoi percolation in the plane is 1/2
- A Harris-Kesten theorem for confetti percolation
- Percolation
- Sharp thresholds of graph properties, and the $k$-sat problem
- Every monotone graph property has a sharp threshold
- Analysis of Boolean Functions
- The dead leaves model: a general tessellation modeling occlusion
This page was built for publication: The critical probability for confetti percolation equals 1/2