摘要 We present an algorithm to compute the exact prob

本頁只刊出中文翻譯與中文說明；英文原文請見下方原文連結。

原文連結

• SFI 頁面
• DOI

論文資訊

• 類型：已發表論文
• 日期：2021-12-09

摘要

We present an algorithm to compute the exact probability Rn(p) for a site 滲流 cluster to span an n × n square lattice at occupancy p. The algorithm has time and space complexity O(λn) with λ ≈ 2.6. It allows us to compute Rn(p) up to n = 24. We use the data to compute estimates for the 滲流 threshold pc that are several orders of magnitude more precise than estimates based on Monte-Carlo simulations.

※ 此為已發表論文，全文需透過期刊付費取得