Characterization and control of small-world networks

Abstract

Recently Watts and Strogatz have given an interesting model of small-world networks. Here we concretise the concept of a ``far away'' connection in a network by defining a {\it far edge}. Our definition is algorithmic and independent of underlying topology of the network. We show that it is possible to control spread of an epidemic by using the knowledge of far edges. We also suggest a model for better advertisement using the far edges. Our findings indicate that the number of far edges can be a good intrinsic parameter to characterize small-world phenomena.

9 pages and 6 figures

Cited by in corpus (19)

• Statistical mechanics of complex networks
• Evolution of networks
• Adaptive Synchronization of An Uncertain Complex Dynamical Network
• Efficiency of informational transfer in regular and complex networks
• Spreading and shortest paths in systems with sparse long-range connections
• Range-based attack on links in scale-free networks: are long-range links responsible for the small-world phenomenon?
• Small-World Networks: Links with long-tailed distributions
• Chaos in Small-World Networks
• Exactly solvable analogy of small-world networks
• Relaxation Properties of Small-World Networks
• Random spread on the family of small-world networks
• First-order transition in small-world networks
• Exact results and scaling properties of small-world networks
• Geographical effects on cascading breakdowns of scale-free networks
• Evolving small-world networks with geographical attachment preference
• Attraction of Spiral Waves by Localized Inhomogeneities with Small-World Connections in Excitable Media
• Geographical effects on epidemic spreading in scale-free networks
• Small-World Networks in Geophysics
• Cellular Automata Networks