Asymptotic properties of random matrices of long-range percolation model

Author(s):  
S. Ayadi
1996 ◽  
Vol 37 (10) ◽  
pp. 5033-5060 ◽  
Author(s):  
Alexei M. Khorunzhy ◽  
Boris A. Khoruzhenko ◽  
Leonid A. Pastur

1996 ◽  
Vol 54 (4) ◽  
pp. 3870-3880 ◽  
Author(s):  
Muhammad Sahimi ◽  
Sumit Mukhopadhyay

2011 ◽  
Vol 48 (4) ◽  
pp. 1152-1162 ◽  
Author(s):  
B. N. B. de Lima ◽  
R. Sanchis ◽  
R. W. C. Silva

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.


2011 ◽  
Vol 39 (3) ◽  
pp. 1399-1426 ◽  
Author(s):  
C. Lévy-Leduc ◽  
H. Boistard ◽  
E. Moulines ◽  
M. S. Taqqu ◽  
V. A. Reisen

Sign in / Sign up

Export Citation Format

Share Document