Key points are not available for this paper at this time.
The problem of long-range percolation in one dimension is proposed. The authors consider a one-dimensional bond percolation system with bonds connecting an infinite number of neighbours where the occupation probability for the nth nearest-neighbour bond pn varies as p1/ns. Using the transfer-matrix method, they find that when s>2 only the short-range percolation exists; namely the system percolates only when p1=1. A transition to long-range percolation is found at s=2 where the percolation threshold drops suddenly from the short-range value p1c=1 to the long-range value p1c=0.
Building similarity graph...
Analyzing shared references across papers
Loading...
Zixuan Zhang
Yanshan University
Fei Pu
Beijing Normal University
B Z Li
Journal of Physics A Mathematical and General
Building similarity graph...
Analyzing shared references across papers
Loading...
Zhang et al. (Mon,) studied this question.
synapsesocial.com/papers/6a174abe052a0e2c938d7ecb — DOI: https://doi.org/10.1088/0305-4470/16/3/002