Logarithmic typical distances in preferential attachment models

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: van der Hofstad, Remco, Zhu, Haodong
Format: Preprint
Veröffentlicht: 2025
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866912229860835328
author van der Hofstad, Remco
Zhu, Haodong
author_facet van der Hofstad, Remco
Zhu, Haodong
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2502_07961
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Logarithmic typical distances in preferential attachment models
van der Hofstad, Remco
Zhu, Haodong
Probability
05C80, 05C12, 05C82
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.
title Logarithmic typical distances in preferential attachment models
topic Probability
05C80, 05C12, 05C82
url https://arxiv.org/abs/2502.07961