An alternative proof of some percolation threshold (pc) using the idea of self-organized criticality

By means of a well-developed method in self-organized criticality, we can obtain the lower bound for the percolation threshold (pc) of the corresponding site percolation problem. In some special cases, we have proved that such lower bounds are indeed the percolation thresholds. We can reproduce some well-known percolation thresholds of various lattices including the Cayley trees and Kock curves in this framework. © 1994 Società Italiana di Fisica.link_to_subscribed_fulltex