Existence of a persistent hub in the convex preferential attachment model

  1. Pavel Galashin


A vertex of a randomly growing graph is called a persistent hub if at all but finitely many moments of time it has the maximal degree in the graph. We establish the existence of a persistent hub in the Barabási–Albert random graph model with probability one. We also extend this result to the class of convex preferential attachment graphs, where a vertex of degree k gets a new edge with probability proportional to some convex function of k.

Download article

This article

Probability and Mathematical Statistics

36, z. 1, 2016

Pages from 59 to 74

Other articles by author

Google Scholar


Your cart (products: 0)

No products in cart

Your cart Checkout