Random walk attachment graphs
Authors:
Preprint
Abstract
We consider the random walk attachment graph introduced by Saram\"{a}ki and Kaski and proposed as a mechanism to explain how behaviour similar to preferential attachment may appear requiring only local knowledge. We show that if the length of the random walk is fixed then the resulting graphs can have properties significantly different from those of preferential attachment graphs, and in particular that in the case where the random walks are of length 1 and each new vertex attaches to a single existing vertex the proportion of vertices which have degree 1 tends to 1, in contrast to preferential attachment models. AMS 2010 Subject Classification: Primary 05C82. Key words and phrases:random graphs; preferential attachment; random walk.Keywords
All Related Versions
This publication has 9 references indexed in Scilit:
- Random Networks with Concave Preferential Attachment RuleJahresbericht der Deutschen Mathematiker-Vereinigung, 2010
- Weighted self-similar networks under preferential attachmentPhysica A: Statistical Mechanics and its Applications, 2009
- Random networks with sublinear preferential attachment: Degree evolutionsElectronic Journal of Probability, 2009
- A survey of random processes with reinforcementProbability Surveys, 2007
- Scale-free networks generated by random walkersPhysica A: Statistical Mechanics and its Applications, 2004
- The degree sequence of a scale‐free random graph processRandom Structures & Algorithms, 2001
- Emergence of Scaling in Random NetworksScience, 1999
- Mean-field theory for scale-free random networksPhysica A: Statistical Mechanics and its Applications, 1999
- Bernard Friedman's UrnThe Annals of Mathematical Statistics, 1965