The number of descendants in a preferential attachment graph

Svante Janson, Tiffany Y. Y. Lo

We study the number $X^{(n)}$ of vertices that can be reached from the last added vertex $n$ via a directed path (the descendants) in the standard preferential attachment graph. In…