Cannings, C. and Jordan, J. (2013) Random walk attachment graphs. ELECTRONIC COMMUNICATIONS IN PROBABILITY, 18 (77). ISSN 1083-589X
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.
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | Copyright the authors. This work is licensed under a Creative Commons Attribution 3.0 License (https://creativecommons.org/licenses/by/3.0/) |
Keywords: | random graphs; preferential attachment; random walk |
Dates: |
|
Institution: | The University of Sheffield |
Academic Units: | The University of Sheffield > Faculty of Science (Sheffield) > School of Mathematics and Statistics (Sheffield) |
Depositing User: | Symplectic Sheffield |
Date Deposited: | 10 Jul 2017 10:09 |
Last Modified: | 19 Jul 2017 15:36 |
Published Version: | https://doi.org/10.1214/ECP.v18-2518 |
Status: | Published |
Publisher: | Institute of Mathematical Statistics |
Refereed: | Yes |
Identification Number: | 10.1214/ECP.v18-2518 |
Related URLs: | |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:116490 |