Random walk attachment graphs
Authors:
Open Access
- 1 January 2013
- journal article
- research article
- Published by Institute of Mathematical Statistics in Electronic Communications in Probability
- Vol. 18 (none) , 1-5-5
Abstract
We consider the random walk attachment graph introduced by Saramä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.Keywords
All Related Versions
This publication has 11 references indexed in Scilit:
- Random networks with sublinear preferential attachment: Degree evolutionsElectronic Journal of Probability, 2009
- A survey of random processes with reinforcementProbability Surveys, 2007
- Scale-free networks from self-organizationPhysical Review E, 2005
- 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
- ON A CLASS OF SKEW DISTRIBUTION FUNCTIONSBiometrika, 1955
- II.—A mathematical theory of evolution, based on the conclusions of Dr. J. C. Willis, F. R. SPhilosophical Transactions of the Royal Society of London. Series B, Containing Papers of a Biological Character, 1925