Incipient Spanning Clusters in Square and Cubic Percolation

Simple item page
dc.creatorShchur, Lev N.
dc.date1999-06-01
dc.date1999-06-08
dc.date.accessioned2026-07-07T03:13:35Z
dc.date.available2026-07-07T03:13:35Z
dc.descriptionThe analysis of extensive numerical data for the percolation probabilities of incipient spanning clusters in two dimensional percolation at criticality are presented. We developed an effective code for the single-scan version of the Hoshen-Kopelman algorithm. We measured the probabilities on the square lattice forming samples of rectangular strips with widths from 8 to 256 sites and lengths up to 3200 sites. At total of more than $10^{15}$ random numbers are generated for the sampling procedure. Our data confirm the proposed exact formulaes for the probability exponents conjectured recently on the base of 2D conformal field theory. Some preliminary results for 3D percolation are also discussed.
dc.description18 pages, 6 figures, 12th Annual Workshop on Computer Simulation Studies in Condensed Matter Physics, Athens, 8-12 March, 1999
dc.identifierhttps://arxiv.org/abs/cond-mat/9906013
dc.identifierhttp://arxiv.org/abs/cond-mat/9906013
dc.identifierin Springer Proceedings in Physics, volume 85, Eds. D.P. Landau, S.P. Lewis, and H.B. Schuettler, (Springer Verlag, Heidelberg, Berlin, 2000)
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/29352
dc.subjectStatistical Mechanics
dc.subjectDisordered Systems and Neural Networks
dc.titleIncipient Spanning Clusters in Square and Cubic Percolation
dc.typetext

Files

Collections

arXiv