From Random Graph to Small World by Wandering
Data Structures and Algorithms
2008-12-18 v2
Abstract
Numerous studies show that most known real-world complex networks share similar properties in their connectivity and degree distribution. They are called small worlds. This article gives a method to turn random graphs into Small World graphs by the dint of random walks.
Cite
@article{arxiv.0804.0149,
title = {From Random Graph to Small World by Wandering},
author = {Bruno Gaume and Fabien Mathieu},
journal= {arXiv preprint arXiv:0804.0149},
year = {2008}
}