No label defined (Q4026016)

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 124392
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 124392

      Statements

      21 February 1993
      0 references
      connectivity
      0 references
      percolation
      0 references
      random graph
      0 references
      connectedness
      0 references
      0 references
      [For the entire collection see Zbl 0746.00063.] Let \(V(d,e)=\mathbb{Z}^ d\times\mathbb{Z}^ e_ +\), where \(d,e\geq 0\), and connect two vertices \(u\) and \(v\) by an edge with probability \(p(v-u)\); assume all possible edges occur independently of one another. Denote the resulting graph by \(G(d,e)\). It was shown by \textit{M. Keane}, \textit{J. M. Marstrand} and the reviewer [Math. Proc. Camb. Phil. Soc. 96, 151-166 (1984; Zbl 0543.60016)] that, subject to mild conditions on \(p\), the graph \(G(d,0)\) is a.s. disconnected (respectively connected) if \(\sum_ up(u)<\infty\) (respectively \(\sum_ up(u)=\infty)\). This result is generalized in this paper to a corresponding conclusion for \(G(d,e)\) where \(d,e\geq 0\). The basic argument is a generalization of the beautiful technique of \textit{S. Kalikow} and \textit{B. Weiss} [Isr. J. Math. 62, No. 3, 257-268 (1988; Zbl 0672.05071)].
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references