Abstract
Improved hull walking algorithms for two-dimensional percolation are proposed. In these algorithms a walker explores the external perimeter of percolation clusters. With our modifications very large systems (sizeL) can be studied with finite and small memory requirement and in computation time τ∼L7/4. Applications in determining spanning probabilities, continuum percolation, and percolation with nonuniform occupation probability are pointed out.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
