arXiv Analytics

Sign in

arXiv:1210.3830 [math.PR]AbstractReferencesReviewsResources

Spatial preferential attachment networks: Power laws and clustering coefficients

Emmanuel Jacob, Peter Mörters

Published 2012-10-14, updated 2015-03-17Version 2

We define a class of growing networks in which new nodes are given a spatial position and are connected to existing nodes with a probability mechanism favoring short distances and high degrees. The competition of preferential attachment and spatial clustering gives this model a range of interesting properties. Empirical degree distributions converge to a limit law, which can be a power law with any exponent $\tau>2$. The average clustering coefficient of the networks converges to a positive limit. Finally, a phase transition occurs in the global clustering coefficients and empirical distribution of edge lengths when the power-law exponent crosses the critical value $\tau=3$. Our main tool in the proof of these results is a general weak law of large numbers in the spirit of Penrose and Yukich.

Comments: Published in at http://dx.doi.org/10.1214/14-AAP1006 the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org)
Journal: Annals of Applied Probability 2015, Vol. 25, 632-662
Categories: math.PR, math.CO
Subjects: 05C80, 60C05, 90B15
Related articles: Most relevant | Search more
arXiv:1902.05774 [math.PR] (Published 2019-02-15)
Scale-free percolation in continuum space: quenched degree and clustering coefficient
arXiv:1310.5672 [math.PR] (Published 2013-10-21, updated 2015-06-19)
Degree distribution of shortest path trees and bias of network sampling algorithms
arXiv:math/0301160 [math.PR] (Published 2003-01-15, updated 2015-10-16)
A singularity at the criticality for the free energy in percolation