From Random Graph to Small World by Wandering

Simple item page
dc.creatorGaume, Bruno
dc.creatorMathieu, Fabien
dc.date2008-04-01
dc.date2008-04-02
dc.date.accessioned2026-07-07T12:18:02Z
dc.date.available2026-07-07T12:18:02Z
dc.descriptionNumerous 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.
dc.identifierhttps://arxiv.org/abs/0804.0149
dc.identifierhttp://arxiv.org/abs/0804.0149
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/212273
dc.subjectData Structures and Algorithms
dc.titleFrom Random Graph to Small World by Wandering
dc.typetext

Files

Collections

arXiv