Work

Small worlds, mazes and random walks

Year: 2003
Type: article
Abstract: A parametrized family of random walks whose trajectories are easily identified as graphs is presented. This construction shows small-world–like behavior but, interestingly, a power law emerges between the minimal distance L and the number of nodes N of the graph instead of the typical logarithmic scaling. We explain this peculiar finding in the light of the well-known scaling relationships in Random Walk Theory. Our model establishes a link between Complex Networks and Self-Avoiding Random Walks, a useful theoretical framework in polymer science.
Language: English
Open Access status: bronze
OpenAlex ID: W2144494254
FWCI:
Cites: 23
Cited by: 3
Related to: 10