scholarly journals Percolation of Words on Zd with Long-Range Connections

2011 ◽  
Vol 48 (4) ◽  
pp. 1152-1162 ◽  
Author(s):  
B. N. B. de Lima ◽  
R. Sanchis ◽  
R. W. C. Silva
Keyword(s):  
Long Range ◽  
Percolation Model ◽  
Binary Sequences ◽  
Site Percolation ◽  
Almost All ◽  
Independent Site

Consider an independent site percolation model on Zd, with parameter p ∈ (0, 1), where all long-range connections in the axis directions are allowed. In this work we show that, given any parameter p, there exists an integer K(p) such that all binary sequences (words) ξ ∈ {0, 1}N can be seen simultaneously, almost surely, even if all connections with length larger than K(p) are suppressed. We also show some results concerning how K(p) should scale with p as p goes to 0. Related results are also obtained for the question of whether or not almost all words are seen.

scholarly journals Percolation of Words on Z d with Long-Range Connections

2011 ◽  
Vol 48 (04) ◽  
pp. 1152-1162
Author(s):  
B. N. B. de Lima ◽  
R. Sanchis ◽  
R. W. C. Silva
Keyword(s):  
Long Range ◽  
Percolation Model ◽  
Binary Sequences ◽  
Site Percolation ◽  
Almost All ◽  
Independent Site

Consider an independent site percolation model onZd, with parameterp∈ (0, 1), where all long-range connections in the axis directions are allowed. In this work we show that, given any parameterp, there exists an integerK(p) such that all binary sequences (words) ξ ∈ {0, 1}Ncan be seen simultaneously, almost surely, even if all connections with length larger thanK(p) are suppressed. We also show some results concerning howK(p) should scale withpaspgoes to 0. Related results are also obtained for the question of whether or not almost all words are seen.

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.

Scaling properties of a percolation model with long-range correlations

1996 ◽  
Vol 54 (4) ◽  
pp. 3870-3880 ◽  
Author(s):  
Muhammad Sahimi ◽  
Sumit Mukhopadhyay
Keyword(s):  
Long Range ◽  
Percolation Model ◽  
Scaling Properties ◽  
Long Range Correlations

scholarly journals Line-of-Sight Percolation

2009 ◽  
Vol 18 (1-2) ◽  
pp. 83-106 ◽  
Author(s):  
BÉLA BOLLOBÁS ◽  
SVANTE JANSON ◽  
OLIVER RIORDAN
Keyword(s):  
Random Walk ◽  
Higher Dimensions ◽  
Percolation Model ◽  
The Other ◽  
Branching Random Walk ◽  
Line Of Sight ◽  
Continuum Percolation ◽  
Critical Probability ◽  
Site Percolation ◽  
Vertex Set

Given ω ≥ 1, let $\Z^2_{(\omega)}$ be the graph with vertex set $\Z^2$ in which two vertices are joined if they agree in one coordinate and differ by at most ω in the other. (Thus $\Z^2_{(1)}$ is precisely $\Z^2$.) Let pc(ω) be the critical probability for site percolation on $\Z^2_{(\omega)}$. Extending recent results of Frieze, Kleinberg, Ravi and Debany, we show that limω→∞ωpc(ω)=log(3/2). We also prove analogues of this result for the n-by-n grid and in higher dimensions, the latter involving interesting connections to Gilbert's continuum percolation model. To prove our results, we explore the component of the origin in a certain non-standard way, and show that this exploration is well approximated by a certain branching random walk.

Sign in / Sign up

Export Citation Format

Share Document