Saved in:
Bibliographic Details
Main Authors: Grauer, Arne, Lüchtrath, Lukas, Yarrow, Mark
Format: Preprint
Published: 2019
Subjects:
Online Access:https://arxiv.org/abs/1905.08481
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866917660149678080
author Grauer, Arne
Lüchtrath, Lukas
Yarrow, Mark
author_facet Grauer, Arne
Lüchtrath, Lukas
Yarrow, Mark
contents We consider the preferential attachment model with location-based choice introduced by Haslegrave, Jordan and Yarrow as a model in which condensation phenomena can occur [Haslegrave et al. 2020]. In this model every vertex carries an independent and uniformly drawn location. Starting from an initial tree the model evolves in discrete time. At every time step, a new vertex is added to the tree by selecting $r$ candidate vertices from the graph with replacement according to a sampling probability proportional to these vertices' degrees. The new vertex then connects to one of the candidates according to a given probability associated to the ranking of their locations. In this paper, we introduce a function that describes the phase transition when condensation can occur. Considering the noncondensation phase, we use stochastic approximation methods to investigate bounds for the (asymptotic) proportion of vertices inside a given interval of a given maximum degree. We use these bounds to observe a power law for the asymptotic degree distribution described by the aforementioned function. Hence, this function fully characterises the properties we are interested in. The power law exponent takes the critical value one at the phase transition between the condensation - noncondensation phase.
format Preprint
id arxiv_https___arxiv_org_abs_1905_08481
institution arXiv
publishDate 2019
record_format arxiv
spellingShingle Preferential attachment with location-based choice: Degree distribution in the noncondensation phase
Grauer, Arne
Lüchtrath, Lukas
Yarrow, Mark
Probability
05C80
We consider the preferential attachment model with location-based choice introduced by Haslegrave, Jordan and Yarrow as a model in which condensation phenomena can occur [Haslegrave et al. 2020]. In this model every vertex carries an independent and uniformly drawn location. Starting from an initial tree the model evolves in discrete time. At every time step, a new vertex is added to the tree by selecting $r$ candidate vertices from the graph with replacement according to a sampling probability proportional to these vertices' degrees. The new vertex then connects to one of the candidates according to a given probability associated to the ranking of their locations. In this paper, we introduce a function that describes the phase transition when condensation can occur. Considering the noncondensation phase, we use stochastic approximation methods to investigate bounds for the (asymptotic) proportion of vertices inside a given interval of a given maximum degree. We use these bounds to observe a power law for the asymptotic degree distribution described by the aforementioned function. Hence, this function fully characterises the properties we are interested in. The power law exponent takes the critical value one at the phase transition between the condensation - noncondensation phase.
title Preferential attachment with location-based choice: Degree distribution in the noncondensation phase
topic Probability
05C80
url https://arxiv.org/abs/1905.08481