Abstract
A quite new appoach based on the graph theory through the minimal spanning tree analysis is applied to the study of site percolation transitions in 2D regular lattices. The critical probability thresholds p c are computed for regular and semi-regular mosaics allowed in the plane. It is shown that there is a direct relation between p c and a geometrical parameter characterizing the mosaics.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
