Existence of a persistent hub in the convex preferential attachment model
From MaRDI portal
Publication:5741258
zbMATH Open1341.05229arXiv1310.7513MaRDI QIDQ5741258FDOQ5741258
Authors: Pavel Galashin
Publication date: 22 July 2016
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'asi--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 gets a new edge with probability proportional to some convex function of .
Full work available at URL: https://arxiv.org/abs/1310.7513
Recommendations
Cited In (9)
- Pagerank asymptotics on directed preferential attachment networks
- Degree centrality and root finding in growing random networks
- Steady and ranging sets in graph persistence
- Hidden symmetries of weighted lozenge tilings
- Persistence of hubs in growing random networks
- Root finding algorithms and persistence of Jordan centrality in growing random trees
- Observables of stochastic colored vertex models and local relation
- Sublinear preferential attachment combined with a growing number of choices
- Parameter permutation symmetry in particle systems and random polymers
This page was built for publication: Existence of a persistent hub in the convex preferential attachment model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5741258)