Structural Properties of the Geometric Preferential Attachment Model

This paper analyzes key properties of networks generated by geometric preferential attachment. We establish that the expected number of triangles is proportional to that of the standard preferential attachment model, with a proportionality constant equal to the ratio of the number of triangles between a random geometric graph and an Erd\H{o}s-R\'enyi graph. Furthermore, we prove that the maximum degree grows polynomially with the network size, sharing the same exponent as the standard model; however, the spatial constraint induces a slower growth rate in the network's early evolution. Finally, we extend prior results on connectivity and diameter to the case of networks with finite out-degrees.