View Item 

Show simple item record

Percolation and cluster distribution. III. Algorithms for the site-bond problem
dc.contributor.authorKlymko, Paul W.en_US
dc.contributor.authorHoshen, Josephen_US
dc.contributor.authorKopelman, Raoulen_US
dc.date.accessioned2006-09-11T15:43:04Z
dc.date.available2006-09-11T15:43:04Z
dc.date.issued1979-11en_US
dc.identifier.citationHoshen, J.; Klymko, P.; Kopelman, R.; (1979). "Percolation and cluster distribution. III. Algorithms for the site-bond problem." Journal of Statistical Physics 21(5): 583-600. <http://hdl.handle.net/2027.42/45140>en_US
dc.identifier.issn0022-4715en_US
dc.identifier.issn1572-9613en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/45140
dc.description.abstractAlgorithms for estimating the percolation probabilities and cluster size distribution are given in the framework of a Monte Carlo simulation for disordered lattices for the generalized site-bond problem. The site-bond approach is useful when a percolation process cannot be exclusively described in the context of pure site or pure bond percolation. An extended multiple labeling technique (ECMLT) is introduced for the generalized problem. The ECMLT is applied to the site-bond percolation problem for square and triangular lattices. Numerical data are given for lattices containing up to 16 million sites. An application to polymer gelation is suggested.en_US
dc.format.extent877527 bytes
dc.format.extent3115 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypetext/plain
dc.language.isoen_US
dc.publisherKluwer Academic Publishers-Plenum Publishers; Plenum Publishing Corporation ; Springer Science+Business Mediaen_US
dc.subject.otherTreeen_US
dc.subject.otherStatistical Physicsen_US
dc.subject.otherMonte Carloen_US
dc.subject.otherPhysicsen_US
dc.subject.otherPhysical Chemistryen_US
dc.subject.otherQuantum Physicsen_US
dc.subject.otherMathematical and Computational Physicsen_US
dc.subject.otherPercolation Zoneen_US
dc.subject.otherSite-bonden_US
dc.subject.otherUNION Operationen_US
dc.subject.otherFIND Operationen_US
dc.titlePercolation and cluster distribution. III. Algorithms for the site-bond problemen_US
dc.typeArticleen_US
dc.subject.hlbsecondlevelPhysicsen_US
dc.subject.hlbsecondlevelMathematicsen_US
dc.subject.hlbtoplevelScienceen_US
dc.description.peerreviewedPeer Revieweden_US
dc.contributor.affiliationumDepartment of Chemistry, University of Michigan, Ann Arbor, Michiganen_US
dc.contributor.affiliationumDepartment of Chemistry, University of Michigan, Ann Arbor, Michiganen_US
dc.contributor.affiliationumDepartment of Chemistry, University of Michigan, Ann Arbor, Michiganen_US
dc.contributor.affiliationumcampusAnn Arboren_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/45140/1/10955_2005_Article_BF01011170.pdfen_US
dc.identifier.doihttp://dx.doi.org/10.1007/BF01011170en_US
dc.identifier.sourceJournal of Statistical Physicsen_US
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Name:
10955_2005_Article_BF01011170.pdf
Size:
856.9KB
Format:
PDF
View/Open

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.