Existence of a persistent hub in the convex preferential attachment model

Abstract

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$.

Cited by in corpus (6)

• Analysis of centrality in sublinear preferential attachment trees via the CMJ branching process
• The dominating colour of an infinite Pólya urn model
• Further properties of a random graph with duplications and deletions
• High degree vertices in the Power of Choice model combined with Preferential Attachment
• Preferential attachment with fitness dependent choice
• Degree centrality and root finding in growing random networks