From Random Graph to Small World by Wandering - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2008

From Random Graph to Small World by Wandering

(1) , (2, 3)
1
2
3

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.
Fichier principal
Vignette du fichier
RR-6489.pdf (278.42 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00268788 , version 1 (01-04-2008)
inria-00268788 , version 2 (02-04-2008)

Identifiers

  • HAL Id : inria-00268788 , version 2
  • ARXIV : 0804.0149

Cite

Bruno Gaume, Fabien Mathieu. From Random Graph to Small World by Wandering. [Research Report] RR-6489, INRIA. 2008, pp.11. ⟨inria-00268788v2⟩
143 View
174 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More