Logarithmic typical distances in preferential attachment models

Abstract

We prove that the typical distances in a preferential attachment model with out-degree $m\geq 2$ and strictly positive fitness parameter are close to $\log_ν{n}$, where $ν$ is the exponential growth parameter of the local limit of the preferential attachment model. The proof relies on a path-counting technique, the first- and second-moment methods, as well as a novel proof of the convergence of the spectral radius of the offspring operator under a certain truncation.