From Random Graph to Small World by Wandering
classification
💻 cs.DS
keywords
randomsmallgraphsworldarticlecalledcomplexconnectivity
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.