A spatial preferential attachment model with local clustering

17Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A class of growing networks is introduced in which new nodes are given a spatial position and are connected to existing nodes with a probability mechanism favouring short distances and high degrees. The competition of preferential attachment and spatial clustering gives this model a range of interesting properties. Most notably, empirical degree distributions converge to a limit law, which can be a power law with any exponent τ > 2, and the average clustering coefficient converges to a positive limit. Our main tool to show these and other results is a weak law of large numbers in the spirit of Penrose and Yukich, which can be applied thanks to a novel rescaling idea. We also conjecture that the networks have a robust giant component if τ is sufficiently small. © 2013 Springer International Publishing.

Cite

CITATION STYLE

APA

Jacob, E., & Mörters, P. (2013). A spatial preferential attachment model with local clustering. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8305 LNCS, pp. 14–25). https://doi.org/10.1007/978-3-319-03536-9_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free