Site percolation : Frontier curvature of clusters

1973 ◽  
Vol 34 (5-6) ◽  
pp. 341-344 ◽  
Author(s):  
H. Ottavi ◽  
J.P. Gayda
Keyword(s):  
Site Percolation

Estimates of critical percolation probabilities for a set of two-dimensional lattices

1972 ◽  
Vol 71 (1) ◽  
pp. 97-106 ◽  
Author(s):  
D. G. Neal
Keyword(s):  
Monte Carlo ◽  
Two Dimensions ◽  
Two Dimensional ◽  
Critical Percolation ◽  
Site Percolation

AbstractThis paper describes new detailed Monte Carlo investigations into bond and site percolation problems on the set of eleven regular and semi-regular (Archimedean) lattices in two dimensions.

Effects of ramification and connectivity degree on site percolation threshold on regular lattices and fractal networks

2019 ◽  
Vol 383 (10) ◽  
pp. 957-966 ◽  
Author(s):  
Alexander S. Balankin ◽  
M.A. Martínez-Cruz ◽  
M.D. Álvarez-Jasso ◽  
M. Patiño-Ortiz ◽  
J. Patiño-Ortiz
Keyword(s):  
Percolation Threshold ◽  
Site Percolation ◽  
Regular Lattices ◽  
Connectivity Degree

scholarly journals Site Percolation Thresholds of FCC Lattice

1991 ◽  
Vol 80 (3) ◽  
pp. 461-464 ◽  
Author(s):  
T.R. Gawron ◽  
Marek Cieplak
Keyword(s):  
Site Percolation ◽  
Fcc Lattice ◽  
Percolation Thresholds

Exact site-percolation probability on the square lattice

2021 ◽  
Author(s):  
Stephan Mertens
Keyword(s):  
Monte Carlo ◽  
Monte Carlo Simulations ◽  
Percolation Threshold ◽  
Percolation Cluster ◽  
Square Lattice ◽  
Site Percolation ◽  
Exact Probability ◽  
Percolation Probability ◽  
A Site ◽  
Time And Space Complexity

Abstract We present an algorithm to compute the exact probability $R_{n}(p)$ for a site percolation cluster to span an $n\times n$ square lattice at occupancy $p$. The algorithm has time and space complexity $O(\lambda^n)$ with $\lambda \approx 2.6$. It allows us to compute $R_{n}(p)$ up to $n=24$. We use the data to compute estimates for the percolation threshold $p_c$ that are several orders of magnitude more precise than estimates based on Monte-Carlo simulations.

scholarly journals Site percolation and isoperimetric inequalities for plane graphs

2020 ◽  
Vol 58 (1) ◽  
pp. 150-163
Author(s):  
John Haslegrave ◽  
Christoforos Panagiotis
Keyword(s):  
Isoperimetric Inequalities ◽  
Site Percolation ◽  
Plane Graphs

Percolation on Penrose Tilings

1998 ◽  
Vol 41 (2) ◽  
pp. 166-177 ◽  
Author(s):  
A. Hof
Keyword(s):  
Large Class ◽  
Arbitrary Dimension ◽  
Bond Percolation ◽  
Critical Probability ◽  
Site Percolation ◽  
Aperiodic Tilings ◽  
Infinite Clusters ◽  
Almost All ◽  
Percolation Processes ◽  
Penrose Tilings

AbstractIn Bernoulli site percolation on Penrose tilings there are two natural definitions of the critical probability. This paper shows that they are equal on almost all Penrose tilings. It also shows that for almost all Penrose tilings the number of infinite clusters is almost surely 0 or 1. The results generalize to percolation on a large class of aperiodic tilings in arbitrary dimension, to percolation on ergodic subgraphs of ℤd, and to other percolation processes, including Bernoulli bond percolation.

Sign in / Sign up

Export Citation Format

Share Document