From Random Graph to Small World by Wandering

TL;DR

This paper presents a method to transform random graphs into small-world networks using random walks, highlighting a new approach to understanding network topology evolution.

Contribution

It introduces a novel technique for converting random graphs into small-world networks through the application of random walks.

Findings

Random walks can induce small-world properties in graphs.

The method provides a new way to model real-world network formation.

Transforming random graphs into small worlds is feasible with this approach.

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.