Translator Disclaimer
2013 Random walk attachment graphs
Chris Cannings, Jonathan Jordan
Author Affiliations +
Electron. Commun. Probab. 18(none): 1-5 (2013). DOI: 10.1214/ECP.v18-2518

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.

Citation

Download Citation

Chris Cannings. Jonathan Jordan. "Random walk attachment graphs." Electron. Commun. Probab. 18 1 - 5, 2013. https://doi.org/10.1214/ECP.v18-2518

Information

Accepted: 18 September 2013; Published: 2013
First available in Project Euclid: 7 June 2016

zbMATH: 1298.05289
MathSciNet: MR3109632
Digital Object Identifier: 10.1214/ECP.v18-2518

Subjects:
Primary: 05C82

JOURNAL ARTICLE
5 PAGES


SHARE
Back to Top