Electronic Communications in Probability · 2014 · 21 citations · 12 references
Natural SciencesMathematicsEvolutionary TheoryProbability TheoryStochastic ProcessesProbabilistic CombinatoricsStochastic NetworksAlmost Sure ConvergenceNetwork Growth ModelsPreferential AttachmentRandom Graph ProcessesRandom Graph TheoryStochastic Approximation
We prove almost sure convergence of the maximum degree in an evolving tree model combining local choice and preferential attachment. At each step in the growth of the graph, a new vertex is introduced. A fixed, finite number of possible neighbors are sampled from the existing vertices with probability proportional to degree. Of these possibilities, the new vertex attaches to the vertex from the sample that has the highest degree. The maximal degree in this model has linear or near-linear behavior. This behavior contrasts sharply with the behavior in the same choice model with uniform attachment as well as the preferential attachment model without choice. The proof is based on showing the tree has a persistent hub by comparison with the standard preferential attachment model, as well as martingale and stochastic approximation arguments.
12
Emergence of Scaling in Random Networks
Albert-Ĺaszló Barabási, Réka Albert · Science · 1999 · 36.4K citations · Full text
A Stochastic Approximation Method
Herbert Robbins, Sutton Monro · The Annals of Mathematical Statistics · 1951 · 9.6K citations · Full text
Connectivity of Growing Random Networks
P. L. Krapivsky, S. Redner, F. Leyvraz · Physical Review Letters · 2000 · 1.2K citations · Full text
A survey of random processes with reinforcement
Robin Pemantle · Probability Surveys · 2007 · 585 citations · Full text