BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-82-933
       ENTRY:: June 01, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: An algorithmic method for studying percolation clusters
        TYPE:: Technical Report
      AUTHOR:: Klein, Shmuel T.
      AUTHOR:: Shamir, Eli
        DATE:: September 1982
       PAGES:: 16
    ABSTRACT:: In percolation theory one studies configurations, based on
               some infinite lattice, where the sites of the lattice are
               randomly made F (full) with probability p or E (empty) with
               probability 1-p. For p > $p_c$, the set of configurations
               which contain an infinite cluster (a connectivity component)
               has probability 1. Using an algorithmic method and a
               rearrangement lemma for Bernoulli sequences, we compute the
               boundary-to-body quotient of infinite clusters and prove it
               has the definite value (1-p)/p with probability 1.
       NOTES:: [Adminitrivia V1/Prg/19950601]
         END:: STAN//CS-TR-82-933