Translator Disclaimer
June 2015 Phase transitions for random geometric preferential attachment graphs
Jonathan Jordan, Andrew R. Wade
Author Affiliations +
Adv. in Appl. Probab. 47(2): 565-588 (June 2015). DOI: 10.1239/aap/1435236988

Abstract

Vertices arrive sequentially in space and are joined to existing vertices at random according to a preferential rule combining degree and spatial proximity. We investigate phase transitions in the resulting graph as the relative strengths of these two components of the attachment rule are varied. Previous work of one of the authors showed that when the geometric component is weak, the limiting degree sequence mimics the standard Barabási-Albert preferential attachment model. We show that at the other extreme, in the case of a sufficiently strong geometric component, the limiting degree sequence mimics a purely geometric model, the on-line nearest-neighbour graph, for which we prove some extensions of known results. We also show the presence of an intermediate regime, with behaviour distinct from both the on-line nearest-neighbour graph and the Barabási-Albert model; in this regime, we obtain a stretched exponential upper bound on the degree sequence.

Citation

Download Citation

Jonathan Jordan. Andrew R. Wade. "Phase transitions for random geometric preferential attachment graphs." Adv. in Appl. Probab. 47 (2) 565 - 588, June 2015. https://doi.org/10.1239/aap/1435236988

Information

Published: June 2015
First available in Project Euclid: 25 June 2015

zbMATH: 1364.60019
MathSciNet: MR3360390
Digital Object Identifier: 10.1239/aap/1435236988

Subjects:
Primary: 60D05
Secondary: 05C80 , 90B15

Keywords: degree sequence , on-line nearest-neighbour graph , preferential attachment , Random spatial network

Rights: Copyright © 2015 Applied Probability Trust

JOURNAL ARTICLE
24 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.47 • No. 2 • June 2015
Back to Top