Abstract
We give several bounds for a graph diameter of a random graph created by a stochastic model called the long-range percolation, in which any pair of two distinct points is connected by a random bond independently. Such a problem is well studied on a finite subset of the \(d\)-dimensional square lattice, where \(d\) is a positive integer. In this manuscript, we consider the problem on a finite subset of a fractal lattice which is called the pre-Sierpinski gasket. We can observe that the Hausdorff dimension of the fractal lattice appears in the critical parameters of \(s\), where \(s\) is a value determining the order of probabilities that random bonds exist.
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.
