Random networks with sublinear preferential attachment: The giant component

Abstract

We study a dynamical random network model in which at every construction step a new vertex is introduced and attached to every existing vertex independently with a probability proportional to a concave function f of its current degree. We give a criterion for the existence of a giant component, which is both necessary and sufficient, and which becomes explicit when f is linear. Otherwise it allows the derivation of explicit necessary and sufficient conditions, which are often fairly close. We give an explicit criterion to decide whether the giant component is robust under random removal of edges. We also determine asymptotically the size of the giant component and the empirical distribution of component sizes in terms of the survival probability and size distribution of a multitype branching random walk associated with f.

Published in at http://dx.doi.org/10.1214/11-AOP697 the Annals of Probability (http://www.imstat.org/aop/) by the Institute of Mathematical Statistics (http://www.imstat.org)

Cited by in corpus (15)

• Spatial preferential attachment networks: Power laws and clustering coefficients
• On a preferential attachment and generalized Pólya's urn model
• The evolutionary game of pressure (or interference), resistance and collaboration
• The age-dependent random connection model
• Robust analysis of preferential attachment models with fitness
• Weighted distances in scale-free preferential attachment models
• On dynamic random graphs with degree homogenization via anti-preferential attachment probabilities
• Near critical preferential attachment networks have small giant components
• Distance evolutions in growing preferential attachment graphs
• A Preferential Attachment Process Approaching the Rado Graph
• DAG-type Distributed Ledgers via Young-age Preferential Attachment
• A central limit theorem for the number of isolated vertices in a preferential attachment random graph
• Vulnerability of robust preferential attachment networks
• The giant in random graphs is almost local
• The largest subcritical component in inhomogeneous random graphs of preferential attachment type