Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

Fast Monte Carlo algorithm for site or bond percolation.

M E Newman1, R M Ziff

  • 1Santa Fe Institute, 1399 Hyde Park Road, Santa Fe, New Mexico 87501, USA.

Physical Review. E, Statistical, Nonlinear, and Soft Matter Physics
|July 20, 2001
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Suspected intramedullary bone infarct subsequent to tibial plateau levelling osteotomy in a dog.

Australian veterinary journal·2015
Same author

Retention capacity of correlated surfaces.

Physical review. E, Statistical, nonlinear, and soft matter physics·2014
Same author

The barrier method: a technique for calculating very long transition times.

The Journal of chemical physics·2010
Same author

Adenosine binding sites in brain; relationship to endogenous levels of adenosine and to its physiological and regulatory roles.

Neurochemistry international·2010
Same author

Harmonic measure for critical Potts clusters.

Physical review. E, Statistical, nonlinear, and soft matter physics·2009
Same author

Convergence of threshold estimates for two-dimensional percolation.

Physical review. E, Statistical, nonlinear, and soft matter physics·2002

A new algorithm efficiently studies percolation systems, measuring quantities across all occupation probabilities. This method scales linearly with system size, enabling faster exploration of percolation phenomena.

Area of Science:

  • Statistical Physics
  • Computational Physics
  • Complex Systems

Background:

  • Percolation theory studies the behavior of connected components in random systems.
  • Efficient algorithms are crucial for simulating large-scale percolation phenomena.
  • Previous methods faced limitations in computational time and scope.

Purpose of the Study:

  • To introduce a novel, efficient algorithm for site and bond percolation studies.
  • To enable measurement of observable quantities across the full probability range (0 to 1).
  • To demonstrate the algorithm's utility in addressing key percolation problems.

Main Methods:

  • Development of a novel algorithm for site and bond percolation.
  • Linear-time scaling with system size for computational efficiency.

Related Experiment Videos

  • Application to diverse percolation models including square lattices and random graphs.

    • Main Results:

    • The algorithm accurately measures system properties across all occupation probabilities.
    • Demonstrated linear scaling of computation time with system size.
    • Successfully investigated percolation transitions, spanning probabilities, and giant component sizes.

    Conclusions:

    • The developed algorithm offers a significant advancement in the efficiency of percolation studies.
    • It provides a powerful tool for exploring critical phenomena and system behavior.
    • The method is broadly applicable to various lattices and random graph structures.