From Random Graph to Small World by Wandering - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2008

From Random Graph to Small World by Wandering

Bruno Gaume
Institut de recherche en informatique de Toulouse
CV
Fabien Mathieu
France Télécom Recherche & Développement
Networks, Graphs and Algorithms
CV

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.

Domains

Data Structures and Algorithms [cs.DS]
Fichier principal
Vignette du fichier
r2smw_main.pdf (278.65 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Fabien Mathieu  : Connect in order to contact the contributor

https://inria.hal.science/inria-00268788

Submitted on : Tuesday, April 1, 2008-1:48:31 PM

Last modification on : Monday, November 20, 2023-11:44:19 AM

Long-term archiving on: Thursday, May 20, 2010-9:29:45 PM

Download

Dates and versions

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

Identifiers

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

Cite

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

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

LIAFA
151 View
184 Download

Altmetric

Share

Gmail Facebook X LinkedIn More