Paper detail

Condensation in preferential attachment models with location-based choice

We introduce a model of a preferential attachment based random graph which extends the family of models in which condensation phenomena can occur. Each vertex has an associated uniform random variable which we call its location. Our model evolves in discrete time by selecting $r$ vertices from the graph with replacement, with probabilities proportional to their degrees plus a constant $α$. A new vertex joins the network and attaches to one of these vertices according to a given probability associated to the ranking of their locations. We give conditions for the occurrence of condensation, showing the existence of phase transitions in $α$ below which condensation occurs. The condensation in our model differs from that in preferential attachment models with fitness in that the condensation can occur at a random location, that it can be due to a persistent hub, and that there can be more than one point of condensation.