From Random Graph to Small World by Wandering

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.

References in corpus (8)

• Emergence of scaling in random networks
• Statistical mechanics of complex networks
• Power laws, Pareto distributions and Zipf's law
• Assortative mixing in networks
• The diameter of the world wide web
• Evolution of networks
• Bose-Einstein condensation in complex networks
• Problems with Fitting to the Power-Law Distribution