From Random Graph to Small World by Wandering

Bruno Gaume 1 Fabien Mathieu 2, 3
3 GANG - Networks, Graphs and Algorithms
LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications, Inria Paris-Rocquencourt
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.
Complete list of metadatas

https://hal.inria.fr/inria-00268788
Contributor : Fabien Mathieu <>
Submitted on : Tuesday, April 1, 2008 - 1:48:31 PM
Last modification on : Friday, October 11, 2019 - 8:22:47 PM
Long-term archiving on : Thursday, May 20, 2010 - 9:29:45 PM

Files

r2smw_main.pdf
Files produced by the author(s)

Identifiers

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

Collections

Citation

Bruno Gaume, Fabien Mathieu. From Random Graph to Small World by Wandering. [Research Report] 2008, pp.11. ⟨inria-00268788v1⟩

Share

Metrics

Record views

12

Files downloads

41