From lattice long-range percolation to the continuum one

Abstract Graph theory through the minimal spanning tree is used to study the so-called long-range percolation (LRP). The percolation thresholds are determined for the ten nearest-neighbour connections related to the eleven mosaics permitted in the plane. It is shown that LRP makes it possible to retrieve the behaviour of continuum percolation.