Sublinear but never superlinear preferential attachment by local network growth

From MaRDI portal
Publication:3301534

DOI10.1088/1742-5468/2013/02/P02043zbMATH Open1457.90040arXiv1212.0518OpenAlexW3098483059MaRDI QIDQ3301534FDOQ3301534


Authors: Alan Gabel, S. Redner Edit this on Wikidata


Publication date: 11 August 2020

Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

Abstract: We investigate a class of network growth rules that are based on a redirection algorithm wherein new nodes are added to a network by linking to a randomly chosen target node with some probability 1-r or linking to the parent node of the target node with probability r. For fixed 0<r<1, the redirection algorithm is equivalent to linear preferential attachment. We show that when r is a decaying function of the degree of the parent of the initial target, the redirection algorithm produces sublinear preferential attachment network growth. We also argue that no local redirection algorithm can produce superlinear preferential attachment.


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




Recommendations



Cites Work


Cited In (7)





This page was built for publication: Sublinear but never superlinear preferential attachment by local network growth

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3301534)