No label defined (Q4385835)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1143618
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1143618 |
Statements
12 November 1998
0 references
critical probability
0 references
random graphs
0 references
percolation
0 references
Menger sponge
0 references
pre-Sierpinski carpet
0 references
upper bound for site percolation
0 references
0 references
0.7649838
0 references
0.7643447
0 references
0.75983953
0 references
The author studies the asymptotic behaviour of the critical probability of bond and site percolation of the Menger sponge, which is a generalization of the pre-Sierpiński carpet and can be imbedded in \({\mathbf Z}^n\), for large dimension \(n\). For the \(n\)-dimensional \(\gamma\)-cavity Menger sponge \({\mathbf M}= {\mathbf M}(n, \gamma)\), where \(\gamma\) is a sequence of positive integers less than \(n\), he states the inequalities \[ 1/(2n- 1)\leq p^{\text{bond}}_c({\mathbf M})\leq p^{\text{site}}_c({\mathbf M})\leq (1+\varepsilon)/2(n-| \gamma|) \] with \(\varepsilon= \varepsilon(n)\to 0\) and \(\varepsilon n^{1/3}\to\infty\), as \(n\to\infty\), and \(n\) sufficiently large in dependence on \(|\gamma|/n\). The first inequality obviously follows from the same lower bound for bond percolation in \({\mathbf Z}^n\) and the second one generally holds. The main task of the paper is the proof of the third one. The author applies methods from random graphs, which \textit{B. Bollobás} and \textit{Y. Kohayakawa} [Eur. J. Comb. 15, No. 2, 113-125 (1994; Zbl 0789.60093)] used to derive an upper bound for site percolation in \({\mathbf Z}^n\).
0 references