Abstract
We consider generalizations of Mandelbrot's percolation process. For the process which we call the random Sierpinski carpet, we show that it passes through several different phases as its parameter increases from zero to one. The final section treats the percolation phase.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. T. Chayes, L. Chayes, and R. Durrett, Connectivity properties of Mandelbrot's percolation process,Prob. Theory Rel. Fields 77:307–324 (1988).
F. M. Dekking, Recurrent sets,Adv. Math. 44:78–104 (1982).
F. M. Dekking and G. R. Grimmett, Superbranching processes and projections of random Cantor sets,Prob. Theory Rel. Fields 78:335–355 (1988).
K. Falconer, Random fractals,Math. Proc. Cambr. Phil. Soc. 100:559–582 (1986).
K. Falconer, Projections of random Cantor sets,J. Theor. Prob. 2:65–70 (1989).
G. R. Grimmett,Percolation (Springer-Verlag, Berlin, 1989).
B. B. Mandelbrot,The Fractal Geometry of Nature (Freeman, San Francisco, 1983).
G. Rozenberg and A. Salomaa,The Mathematical Theory of L-Systems (Academic Press, New York, 1980).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Dekking, F.M., Meester, R.W.J. On the structure of Mandelbrot's percolation process and other random cantor sets. J Stat Phys 58, 1109–1126 (1990). https://doi.org/10.1007/BF01026566
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01026566