Czasopisma Naukowe w Sieci (CNS)

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.

Pobierz artykuł

Ten artykuł

Probability and Mathematical Statistics

36, z. 1, 2016

Strony od 59 do 74

Inne artykuły autorów

Google Scholar


Twoj koszyk (produkty: 0)

Brak produktów w koszyku

Twój koszyk Do kasy