A lower bound on the box-counting dimension of crossings in fractal percolation
From MaRDI portal
Publication:1805743
DOI10.1016/S0304-4149(97)00117-8zbMath0932.60085MaRDI QIDQ1805743
Publication date: 18 November 1999
Published in: Stochastic Processes and their Applications (Search for Journal in Brave)
Interacting random processes; statistical mechanics type models; percolation theory (60K35) Percolation (82B43)
Related Items (4)
Fractal percolation is unrectifiable ⋮ Chemical distances for percolation of planar Gaussian free fields and critical random walk loop soups ⋮ Liouville first passage percolation: geodesic length exponent is strictly larger than 1 at high temperatures ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- On the structure of Mandelbrot's percolation process and other random Cantor sets
- Connectivity properties of Mandelbrot's percolation process
- On the geometry of random Cantor sets and fractal percolation
- On the length of the shortest crossing in the super-critical phase of Mandelbrot's percolation process
- On the absence of directed fractal percolation
This page was built for publication: A lower bound on the box-counting dimension of crossings in fractal percolation
