Condensation in preferential attachment models with location‐based choice
Authors:
- 2 October 2019
- journal article
- research article
- Published by Wiley in Random Structures & Algorithms
- Vol. 56 (3) , 775-795
Abstract
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.Keywords
All Related Versions
Funding Information
- University of Sheffield and by the European Research Council (639046)
This publication has 12 references indexed in Scilit:
- Nonextensive condensation in reinforced branching processesThe Annals of Applied Probability, 2017
- Coexistence in Preferential Attachment NetworksCombinatorics, Probability and Computing, 2016
- Preferential attachment with choiceRandom Structures & Algorithms, 2015
- Choice-driven phase transition in complex networksJournal of Statistical Mechanics: Theory and Experiment, 2014
- Robust Analysis of Preferential Attachment Models with FitnessCombinatorics, Probability and Computing, 2014
- The power of choice combined with preferential attachementElectronic Communications in Probability, 2014
- A survey of random processes with reinforcementProbability Surveys, 2007
- Competition and multiscaling in evolving networksEurophysics Letters, 2001
- Structure of Growing Networks with Preferential LinkingPhysical Review Letters, 2000
- A Stochastic Approximation MethodThe Annals of Mathematical Statistics, 1951