We consider some kinds of graphs obtained by generalizing the pre-Sierpinski carpet, which is one of well known fractal lattices. Here, we deal with not only some fractal lattices, but also many irregular graphs which do not belong to fractal lattices. Under several assumptions, we present estimates on a diameter of the long-range percolation cluster on such graphs. In Misumi (J Stat Phys 158:1083–1089, 2015), estimates on the graph diameter of the long-range percolation cluster are established on the pre-Sierpinski gasket, which is another fundamental fractal lattice, and the result of this paper is its extension in a certain sense. We will also discuss the behavior of the diameter of the long-range percolation graph on a regular tree, which seems to be quite different from the result on the generalized pre-Sierpinski carpet.
Benjamini, I., Kesten, H., Peres, Y., Schramm, O.: Geometry of the uniform spanning forest: transitions in dimensions \(4,8,12,\cdots \). Ann. Math. 160, 465–491 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
Berger, N.: A lower bound for the chemical distance in sparse long-range percolation models. arXiv:math/0409021 (2004)