English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

We describe in detail a new and highly efficient algorithm for studying siteor bond percolation on any lattice. The algorithm can measure an observablequantity in a percolation system for all values of the site or bond occupationprobability from zero to one in an amount of time which scales linearly withthe size of the system. We demonstrate our algorithm by using it to investigatea number of issues in percolation theory, including the position of thepercolation transition for site percolation on the square lattice, thestretched exponential behavior of spanning probabilities away from the criticalpoint, and the size of the giant component for site percolation on randomgraphs.

Fast Monte Carlo algorithm for site or bond percolation