Percolation in the Boolean model with convex grains in high dimension
From MaRDI portal
Publication:6177569
Abstract: We investigate percolation in the Boolean model with convex grains in high dimension. For each dimension d, one fixes a compact, convex and symmetric set K R d with non empty interior. In a first setting, the Boolean model is a reunion of translates of K. In a second setting, the Boolean model is a reunion of translates of K or K for a further parameter (1, 2). We give the asymptotic behavior of the percolation probability and of the percolation threshold in the two settings.
Recommendations
Cites work
- A central limit theorem for convex sets
- A probabilistic approach to the geometry of the \(\ell^n_p\)-ball
- Analysis.
- Continuum Percolation
- Continuum percolation and Euclidean minimal spanning trees in high dimensions
- Continuum percolation in high dimensions
- Continuum percolation with steps in the square or the disc
- scientific article; zbMATH DE number 2119076 (Why is no real title available?)
- scientific article; zbMATH DE number 837692 (Why is no real title available?)
- scientific article; zbMATH DE number 227027 (Why is no real title available?)
- scientific article; zbMATH DE number 3417266 (Why is no real title available?)
- Lectures on the Poisson Process
- Nonoptimality of constant radii in high dimensional continuum percolation
- Oriented percolation in two dimensions
- The Brunn-Minkowski inequality
This page was built for publication: Percolation in the Boolean model with convex grains in high dimension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6177569)