Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: Barabási-Albert model

Sortuj według:

Ogranicz wyniki do:

Existence of a persistent hub in the convex preferential attachment model

Galashin P.

Probability and Mathematical Statistics

2016

Vol. 36, Fasc. 1

59--74

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.