Graph theory, through the minimal spanning tree (MST), is used to determine site percolation thresholds p_c related to 2D regular lattices. It is shown that there is a direct relation between p_c and a geometrical parameter characterizing the lattices. Moreover, the methodology developed in this paper makes it possible to study long-range percolation in an efficient way.
展开▼
