Keywords
Small-world networkComputer scienceTopology (electrical circuits)Complex networkDynamical systems theoryAverage path lengthComplex systemNetwork topologyTheoretical computer scienceRandom graphAnalogyDistributed computingGraphShortest path problemMathematicsArtificial intelligencePhysics
Affiliated Institutions
Related Publications
Consensus and Cooperation in Networked Multi-Agent Systems
<para xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> This paper provides a theoretical framework for analysis of consensus algorithms...
A loop-free extended Bellman-Ford routing protocol without bouncing effect
Distributed algorithms for shortest-path problems are important in the context of routing in computer communication networks. We present a protocol that maintains the shortest-p...
Statistical mechanics of complex networks
Complex networks describe a wide range of systems in nature and society, much\nquoted examples including the cell, a network of chemicals linked by chemical\nreactions, or the I...
Geographic routing for wireless networks
Distributed shortest-path routing protocols for wired networks either describe the entire topology of a network or provide a digest of the topology to every router. They continu...
A unified approach to loop-free routing using distance vectors or link states
We present a unified approach for the dynamic computation of shortest paths in a computer network using either distance vectors or link states. We describe a distributed algorit...
Publication Info
- Year
- 1998
- Type
- article
- Volume
- 393
- Issue
- 6684
- Pages
- 440-442
- Citations
- 41955
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
41955
OpenAlex
Cite This
Duncan J. Watts,
Steven H. Strogatz
(1998).
Collective dynamics of ‘small-world’ networks.
Nature
, 393
(6684)
, 440-442.
https://doi.org/10.1038/30918
Identifiers
- DOI
- 10.1038/30918