Diameter of P.A. random graphs with edge‐step functions
Diameter of P.A. random graphs with edge‐step functions
In this work we prove general bounds for the diameter of random graphs generated by a preferential attachment model whose parameter is a function $f:\mathbb{N}\to[0,1]$ that drives the asymptotic proportion between the numbers of vertices and edges. These results are sharp when $f$ is a \textit{regularly varying function at infinity} …