Existence of a persistent hub in the convex preferential attachment model

zbMath1341.05229arXiv1310.7513MaRDI QIDQ5741258

Pavel Galashin

Publication date: 22 July 2016

Full work available at URL: https://arxiv.org/abs/1310.7513

zbMATH Keywords

preferential attachmentBarabási-Albert modelpersistent hub

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Random matrices (probabilistic aspects) (60B20)

Related Items (9)

Root finding algorithms and persistence of Jordan centrality in growing random trees ⋮ Steady and ranging sets in graph persistence ⋮ Hidden symmetries of weighted lozenge tilings ⋮ Degree centrality and root finding in growing random networks ⋮ Parameter permutation symmetry in particle systems and random polymers ⋮ Persistence of hubs in growing random networks ⋮ Observables of stochastic colored vertex models and local relation ⋮ Sublinear preferential attachment combined with a growing number of choices ⋮ Pagerank asymptotics on directed preferential attachment networks

This page was built for publication: Existence of a persistent hub in the convex preferential attachment model