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

Cited literature [29 references]  Display  Hide  Download

https://hal.inria.fr/inria-00268788
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, April 2, 2008 - 10:06:27 AM
Last modification on : Thursday, October 17, 2019 - 8:54:57 AM
Long-term archiving on : Tuesday, September 21, 2010 - 3:55:06 PM

Files

RR-6489.pdf
Files produced by the author(s)

Identifiers

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

Citation

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

Share

Metrics

Record views

288

Files downloads

801