Collective dynamics of ‘small-world’ networks
The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Abstract
Networks of coupled dynamical systems have been used to model biological oscillators, Josephson junction arrays, excitable media, neural networks, spatial games, genetic control networks and many other self-organizing systems. Ordinarily, the connection topology is assumed to be either completely regular or completely random. But many biological, technological and social networks lie somewhere between these two extremes. Here we explore simple models of networks that can be tuned through this middle ground: regular networks 'rewired' to introduce increasing amounts of disorder. We find that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs. We call them 'small-world' networks, by analogy with the small-world phenomenon (popularly known as six degrees of separation. The neural network of the worm Caenorhabditis elegans, the power grid of the western United States, and the collaboration graph of film actors are shown to be small-world networks. Models of dynamical systems with small-world coupling display enhanced signal-propagation speed, computational power, and synchronizability. In particular, infectious diseases spread more easily in small-world networks than in regular lattices.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Empirical networks of both human and non-human (e.g. honeybee) interactions are known to exhibit both spatial and temporal burstiness [10, 39]”
From Strategy evolution on dynamic networks (2023) · cites this paper as [39]
In the citing paper
“complex network theory has demonstrated that many (non-quantum) systems exhibit similarities in their complex features 14 -18 , in the organization of their structure and dynamics 19 -24 , the controllability of their constituents 25 , and their resilience to structural and dynamical perturbations 26 -31 .”
From Complex networks from classical to quantum (2019) · cites this paper as [14]
In the citing paper
“One of the most influential findings is that human brain networks exhibit prominent small‐world (SW) organization, a concept first introduced by Watts and Strogatz; 20 such a network organization allows an optimal balance between local specialization and global integration promoting efficient information on segregation/integration mechanisms.”
In the citing paper
“It was found to be a ubiquitous property of seemingly disparate complex networks including the Internet, Hollywood actor collaborations, power grid organization, and neural networks.”
From Graph theory analysis of complex brain networks: new concepts in brain mapping applied to neurosurgery (2016) · cites this paper as [103]
In the citing paper
“It was found that after only a few rewirings, the graphs showed a strongly reduced average path length, while maintaining high clustering.”
From Graph theory analysis of complex brain networks: new concepts in brain mapping applied to neurosurgery (2016) · cites this paper as [103]
19 more claims about this paper
Create a free account to see every claim other papers make about this one.
Citations
Cites
Axelrod, R., & Hamilton, W. D. (1981) · Science · doi:10.1126/science.7466396 · Cited by 20,065
Social Network Analysis: Methods and Applications
Wasserman, S. S., & Faust, K. (1994) · Cited by 17,982
Social Network Analysis: Methods and Applications
Wasserman, S., & Faust, K. (1994) · doi:10.1017/cbo9780511815478 · Cited by 17,557 · cited 1×
“The graph of film actors is a surrogate for a social networ”
BackgroundChemical Oscillations, Waves, and Turbulence
Kuramoto, Y. (1984) · Springer Series in Synergetics · doi:10.1007/978-3-642-69689-3 · Cited by 7,142 · cited 1×
“(2) For the iterated, multi-player ‘Prisoner’s dilemma’(11) played on a graph, we find that as the fraction of short cuts increases, cooperation is less likely to emerge in a population of players using a generalized ‘titfor-tat’(26) strategy.”
BackgroundNielsen, R. P., & Axelrod, R. (1985) · Academy of Management Review · doi:10.5465/amr.1985.4278510 · Cited by 6,508
Nielsen, R. P., & Axelrod, R. (1985) · The Academy of Management Review · doi:10.2307/257983 · Cited by 6,321
Bollobás, B. (1985) · Cited by 6,196
Metabolic stability and epigenesis in randomly constructed genetic nets
Kauffman, S. A. (1969) · Journal of Theoretical Biology · doi:10.1016/0022-5193(69)90015-0 · Cited by 4,819
The small-world problem: (400002009-005)
Milgram, S. (1967) · PsycEXTRA Dataset · doi:10.1037/e400002009-005 · Cited by 4,790 · cited 1×
“We call them ‘small-world’ networks, by analogy with the small-world phenomeno”
Evolutionary games and spatial chaos
Nowak, M. A., & May, R. M. (1992) · Nature · doi:10.1038/359826a0 · Cited by 4,463
Research works printed but not linked: 1
- Milgram, S. The small world problem. Psychol. Today 2, 60–67 (1967).
Cited by
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
WGCNA: an R package for weighted correlation network analysis
Langfelder, P., & Horvath, S. (2008) · BMC Bioinformatics · doi:10.1186/1471-2105-9-559 · Cited by 27,252
“where A (q) denotes the n (q) × n (q) adjacency matrix corresponding to the sub-network formed by the genes of module q. Another useful concept is the clustering coefficient of gene i, which is a measure of 'cliquishness' [ 34 ].”
BackgroundMethodParticle swarm optimization: An overview
Poli, R., Kennedy, J., & Blackwell, T. (2007) · Swarm Intelligence · doi:10.1007/s11721-007-0002-0 · Cited by 21,101
“Several classical communications structures from social psychology (Bavelas 1950), including some with small-world modifications (Watts and Strogatz 1998), were experimented with in (Kennedy 1999).”
Statistical mechanics of complex networks
Albert, R., & Barabási, A.-L. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.47 · Cited by 20,471
“This property is char- acteristic of large ordered lattices, whose clustering coefficient depends only on the coordination number of the lattice and not their size (Watts and Strogatz, 1998).”
BackgroundInfluentialThe Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
“In Section VI we look at the “small-world model” of Watts and Strogatz [416] and its generalizations.”
InfluentialCommunity structure in social and biological networks
Girvan, M., & Newman, M. E. J. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.122653799 · Cited by 15,502
Finding and evaluating community structure in networks
Newman, M. E. J., & Girvan, M. (2004) · Physical Review E · doi:10.1103/physreve.69.026113 · Cited by 13,931
“For example, in the widely studied network of collaborations between film actors [21, 22], in which two actors are connected if they have appeared in the same film, one could quantify similarity by how many films actors have appeared in together [23].”
BackgroundModularity and community structure in networks
Newman, M. E. J. (2006) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0601602103 · Cited by 12,256
Complex brain networks: graph theoretical analysis of structural and functional systems
Bullmore, E., & Sporns, O. (2009) · Nature Reviews Neuroscience · doi:10.1038/nrn2575 · Cited by 11,820
“One example of an apparently ubiquitous macroscopic behaviour in complex systems is the small-world phenomeno”
BackgroundGephi: An Open Source Software for Exploring and Manipulating Networks
Bastian, M., Heymann, S., & Jacomy, M. (2009) · Proceedings of the International AAAI Conference on Web and Social Media · doi:10.1609/icwsm.v3i1.13937 · Cited by 11,675
“The Figure 3 shows the brain network of the C. Elegans worm (Watts 1998) exported from Gephi.”
BackgroundTopHat: discovering splice junctions with RNA-Seq
Trapnell, C., Pachter, L., & Salzberg, S. L. (2009) · Bioinformatics · doi:10.1093/bioinformatics/btp120 · Cited by 11,617
Complex network measures of brain connectivity: Uses and interpretations
Rubinov, M., & Sporns, O. (2010) · NeuroImage · doi:10.1016/j.neuroimage.2009.10.003 · Cited by 11,522
“Small-world networks are formally de fi ned as networks that are signi fi cantly more clustered than random networks, yet have approximately the same characteristic path length as random networks (Watts and Strogatz, 1998).”
BackgroundInfluentialFortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293
“(Center) Small world graph á la Watts-Strogatz, with 100 vertices and a rewiring probability p = 0.1.”
BackgroundMethodInfluentialComplex networks: structure and dynamics
BOCCALETTI, S., LATORA, V, MORENO, Y., CHAVEZ, M., & HWANG, D. (2006) · Physics Reports · doi:10.1016/j.physrep.2005.10.009 · Cited by 11,010
Inductive Representation Learning on Large Graphs
Hamilton, W. L., Ying, R., & Leskovec, J. (2017) · arXiv · doi:10.48550/arxiv.1706.02216 · Cited by 10,639
“As a case-study, we consider whether GraphSAGE can learn to predict the clustering coefficient of a node, i.e., the proportion of triangles that are closed within the node’s 1-hop neighborhood [38].”
Consensus and Cooperation in Networked Multi-Agent Systems
Olfati-Saber, R., Fax, J. A., & Murray, R. M. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2006.887293 · Cited by 10,522
“For further information on small-world networks, we refer the reader to [92, 63, 65].”
BackgroundMethodStrogatz, S. H. (2001) · Nature · doi:10.1038/35065725 · Cited by 8,302
Self-citationNetwork biology: understanding the cell's functional organization
Barabási, A.-L., & Oltvai, Z. N. (2004) · Nature Reviews Genetics · doi:10.1038/nrg1272 · Cited by 7,903
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-L. (2000) · Nature · doi:10.1038/35019019 · Cited by 7,534
Finding community structure in very large networks
Clauset, A., Newman, M. E. J., & Moore, C. (2004) · Physical Review E · doi:10.1103/physreve.70.066111 · Cited by 7,390
Network motifs: simple building blocks of complex networks.
Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., & Alon, U. (2002) · Science · doi:10.1126/science.298.5594.824 · Cited by 7,368
What is Twitter, a social network or a news media?
Kwak, H., Lee, C., Park, H., & Moon, S. (2010) · Proceedings of the 19th international conference on World wide web · doi:10.1145/1772690.1772751 · Cited by 6,652
“Watts and Strogatz have found that many social and technological networks have small path lengths [37] and call them a ‘small-world’.”
BackgroundError and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-Ĺ. (2000) · RePEc: Research Papers in Economics · Cited by 6,469
An automated method for finding molecular complexes in large protein interaction networks
Bader, G. D., & Hogue, C. W. (2003) · BMC Bioinformatics · doi:10.1186/1471-2105-4-2 · Cited by 6,072
“Recent research on modeling complex systems [21,25,27] has found that networks such as the world wide web, metabolic networks [26] and protein-protein interaction networks [36] are scale-free.”
Epidemic Spreading in Scale-Free Networks
Pastor-Satorras, R., & Vespignani, A. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.3200 · Cited by 5,731
Estimating psychological networks and their accuracy: A tutorial paper
Epskamp, S., Borsboom, D., & Fried, E. I. (2018) · Behavior Research Methods · doi:10.3758/s13428-017-0862-1 · Cited by 5,715
Structural Holes and Good Ideas
Burt, R. S. (2004) · American Journal of Sociology · doi:10.1086/421787 · Cited by 5,642
“Structures of clusters connected by bridges occur in a wide variety of circumstances across different levels of aggregation (Watts and Strogatz 1998).”
BackgroundUncovering the overlapping community structure of complex networks in nature and society
Palla, G., Derényi, I., Farkas, I., & Vicsek, T. (2005) · Nature · doi:10.1038/nature03607 · Cited by 5,373
“Many complex systems in nature and society can be described in terms of networks capturing the intricate web of connections among the units they are made of [1, 2, 3, 4].”
BackgroundEfficient behavior of small-world networks
Latora, V., & Marchiori, M. (2001) · Physical Review Letters · doi:10.1103/physrevlett.87.198701 · Cited by 5,119
Network medicine: a network-based approach to human disease
Barabási, A.-L., Gulbahce, N., & Loscalzo, J. (2011) · Nature Reviews Genetics · doi:10.1038/nrg2918 · Cited by 5,034
The Spread of Obesity in a Large Social Network over 32 Years
Christakis, N. A., & Fowler, J. H. (2007) · New England Journal of Medicine · doi:10.1056/nejmsa066082 · Cited by 5,007
Assortative Mixing in Networks
Newman, M. E. J. (2002) · Physical Review Letters · doi:10.1103/physrevlett.89.208701 · Cited by 4,988
“A variety of models of networks have been proposed and studied in the physics literature, many of which have been successful at reproducing features of networks in the real world [4, 5, 6].”
BackgroundThe Large-Scale Organization of Metabolic Networks
Jeong, H., Tombor, B., Albert, R., Oltvai, Z. N., & Barabási, A.-L. (2000) · Nature · doi:10.1038/35036627 · Cited by 4,972
Conn : A Functional Connectivity Toolbox for Correlated and Anticorrelated Brain Networks
Whitfield-Gabrieli, S., & Nieto-Castanon, A. (2012) · Brain Connectivity · doi:10.1089/brain.2012.0073 · Cited by 4,885
“The toolbox also computes several graph theoretical measures (Achard and Bullmore, 2007; Bullmore and Sporns, 2009; Latora and Marchiori, 2001; Watts and Strogatz, 1998) characterizing structural properties of the estimated ROI-to-ROI functional connectivity networks, and allows users to perform…”
Finding community structure in networks using the eigenvectors of matrices
Newman, M. E. J. (2006) · Physical Review E · doi:10.1103/physreve.74.036104 · Cited by 4,761
On the network topology of variance decompositions: Measuring the connectedness of financial firms
Diebold, F. X., & Yılmaz, K. (2014) · Journal of Econometrics · doi:10.1016/j.jeconom.2014.04.012 · Cited by 4,642
Catastrophic cascade of failures in interdependent networks
Buldyrev, S. V., Parshani, R., Paul, G., Stanley, H. E., & Havlin, S. (2010) · Nature · doi:10.1038/nature08932 · Cited by 4,513
The structure of scientific collaboration networks
Newman, M. E. J. (2001) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.98.2.404 · Cited by 4,482
“All of these quantities and several others are considered in this paper.”
BackgroundNetwork analysis: An integrative approach to the structure of psychopathology
Borsboom, D., & Cramer, A. O. J. (2013) · Annual Review of Clinical Psychology · doi:10.1146/annurev-clinpsy-050212-185608 · Cited by 4,359
“…the first papers to generalize the idea of marrying mathematical descriptions of network structures to diverse sets of data-driven networks was the classic by Watts & Strogatz (1998), which led to an avalanche of empirical and mathematical research on the structure and dynamics of complex networks.”
BackgroundDiameter of the World-Wide Web
Albert, R., Jeong, H., & Barabási, A.-L. (1999) · Nature · doi:10.1038/43601 · Cited by 4,260
Hierarchical Organization of Modularity in Metabolic Networks
Ravasz, E., Somera, A. L., Mongru, D. A., Oltvai, Z. N., & Barabási, A.-L. (2002) · Science · doi:10.1126/science.1073374 · Cited by 4,224
The architecture of complex weighted networks
Barrat, A., Barthélemy, M., Pastor-Satorras, R., & Vespignani, A. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0400087101 · Cited by 4,218
Microbial interactions: from networks to models
Faust, K., & Raes, J. (2012) · Nature Reviews Microbiology · doi:10.1038/nrmicro2832 · Cited by 4,141
Statistical physics of social dynamics
Castellano, C., Fortunato, S., & Loreto, V. (2009) · Reviews of Modern Physics · doi:10.1103/revmodphys.81.591 · Cited by 4,119
“In order to reconcile both properties, Watts and Strogatz have introduced the small-world network model (Watts and Strogatz, 1998), which allows to interpolate between regular lowdimensional lattices and random networks, by introducing a certain fraction p of random long-range connections into an…”
BackgroundBrainNet Viewer: A Network Visualization Tool for Human Brain Connectomics
Xia, M., Wang, J., & He, Y. (2013) · PLoS ONE · doi:10.1371/journal.pone.0068910 · Cited by 4,106
Principles and Practices of Interconnection Networks
Dally, W. J., & Towles, B. (2004) · CERN Document Server (European Organization for Nuclear Research) · Cited by 3,735
Node centrality in weighted networks: Generalizing degree and shortest paths
Opsahl, T., Agneessens, F., & Skvoretz, J. (2010) · Social Networks · doi:10.1016/j.socnet.2010.03.006 · Cited by 3,718
Synchronization in complex networks
Arenas, A., Díaz-Guilera, A., Kurths, J., Moreno, Y., & Zhou, C. (2008) · Physics Reports · doi:10.1016/j.physrep.2008.09.002 · Cited by 3,713
“In [9] it is suggested that the decrease in the distance in the WS network would lead to more efficient coupling and thus enhanced synchronization of the oscillators.”
BackgroundInfluentialEpidemic processes in complex networks
Pastor-Satorras, R., Castellano, C., Van Mieghem, P., & Vespignani, A. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.925 · Cited by 3,697
“A local measure ci of clustering (Watts and Strogatz, 1998a) can also be defined as the ratio between the actual number of edges among the neighbors of a vertex i, ei, and its maximum possible value, measuring thus directly the probability that two neighbors of vertex i are also neighbors of each…”
Random graphs with arbitrary degree distributions and their applications
Newman, M. E. J., Strogatz, S. H., & Watts, D. J. (2001) · Physical Review E · doi:10.1103/physreve.64.026118 · Cited by 3,648
Self-citationThe university of Florida sparse matrix collection
Davis, T. A., & Hu, Y. (2011) · ACM Transactions on Mathematical Software · doi:10.1145/2049662.2049663 · Cited by 3,630
A Survey of Data Mining and Machine Learning Methods for Cyber Security Intrusion Detection
Buczak, A. L., & Guven, E. (2016) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2015.2494502 · Cited by 3,332
“The local clustering coefficient of a node is defined as the ratio of the number of sub-graphs with three edges and three vertices that the node is part of to the number of triples which the node is part of [49].”
BackgroundExploring the brain network: A review on resting-state fMRI functional connectivity
van den Heuvel, M. P., & Hulshoff Pol, H. E. (2010) · European Neuropsychopharmacology · doi:10.1016/j.euroneuro.2010.03.008 · Cited by 3,326
The economy of brain network organization
Bullmore, E., & Sporns, O. (2012) · Nature Reviews Neuroscience · doi:10.1038/nrn3214 · Cited by 3,284
Kivela, M., Arenas, A., Barthelemy, M., Gleeson, J. P., Moreno, Y., & Porter, M. A. (2014) · Journal of Complex Networks · doi:10.1093/comnet/cnu016 · Cited by 3,235
“A local clustering coefficient [245, 353] measures transitivity in a monoplex network.”
BackgroundMethodSpread of epidemic disease on networks
Newman, M. E. J. (2002) · Physical Review E · doi:10.1103/physreve.66.016128 · Cited by 3,218
“Social networks [6, 7, 8, 9], technological networks [10, 11, 12, 13], and biological networks [14, 15, 16, 17, 18] have all been examined and modeled in some detail.”
BackgroundMolecular ecological network analyses
Deng, Y., Jiang, Y.-H., Yang, Y., He, Z., Luo, F., & Zhou, J. (2012) · BMC Bioinformatics · doi:10.1186/1471-2105-13-113 · Cited by 3,196
“[36,37]”
Dorogovtsev, S. N., & Mendes, J. F. F. (2002) · Advances in Physics · doi:10.1080/00018730110112519 · Cited by 3,171
“In spite of large sizes of these networks, the distances between most their vertices are short — a feature known as the “smallworld” effect.”
BackgroundInfluentialThe structure and dynamics of multilayer networks
Boccaletti, S., Bianconi, G., Criado, R., del Genio, C. I., Gómez-Gardeñes, J., Romance, M., Sendiña-Nadal, I., Wang, Z., & Zanin, M. (2014) · Physics Reports · doi:10.1016/j.physrep.2014.07.001 · Cited by 3,125
“[85] can be extended to multilayer networks in many ways.”
BackgroundNewman, M. E. J. (2003) · Physical Review E · doi:10.1103/physreve.67.026126 · Cited by 3,087
“Among these, perhaps the best studied are the “small-world effect” [4, 5], network transitivity or “clustering” [5], and degree distributions [6, 7].”
BackgroundInfluentialMeasurement and analysis of online social networks
Mislove, A., Marcon, M., Gummadi, K. P., Druschel, P., & Bhattacharjee, B. (2007) · Proceedings of the 7th ACM SIGCOMM conference on Internet measurement · doi:10.1145/1298306.1298311 · Cited by 3,057
“This clustering and the small diameter of these networks qualifies these graphs as small-world networks [52], and further indicates that the graph has scale-free properties.”
BackgroundClasses of small-world networks
Amaral, L. A. N., Scala, A., Barthélémy, M., & Stanley, H. E. (2000) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.200327197 · Cited by 3,051
The link‐prediction problem for social networks
Liben‐Nowell, D., & Kleinberg, J. (2007) · Journal of the American Society for Information Science and Technology · doi:10.1002/asi.20591 · Cited by 3,043
The structure and dynamics of multilayer networksPreprint
Wangk, Z., & Zaninm, M. (2016) · Cited by 2,992
Szabó, G., & Fáth, G. (2007) · Physics Reports · doi:10.1016/j.physrep.2007.04.004 · Cited by 2,974
“. Fig. 16. Small-world structure (right) is created from a ring (left) with the nearest- and next-nearest neighbors. Random links are substituted for a portion q of the original links as suggested by Watts and Strogatz (1998). 48 In the initial structure (left graph in Fig. 16) the average clustering coefficient C¯= 1/2…”
BackgroundMethodInfluentialReservoir computing approaches to recurrent neural network training
Lukoševičius, M., & Jaeger, H. (2009) · Computer Science Review · doi:10.1016/j.cosrev.2009.03.005 · Cited by 2,956
Friends and neighbors on the Web
Adamic, L. A., & Adar, E. (2003) · Social Networks · doi:10.1016/s0378-8733(03)00009-1 · Cited by 2,954
“The structure of a small world network was mathematically formalized by Watts and Strogatz [13] to be a graph with a small average shortest path, and high cliquishness.”
BackgroundVicsek, T., & Zafeiris, A. (2012) · Physics Reports · doi:10.1016/j.physrep.2012.03.004 · Cited by 2,923
Buckner, R. L., Sepulcre, J., Talukdar, T., Krienen, F. M., Liu, H., Hedden, T., Andrews-Hanna, J. R., Sperling, R. A., & Johnson, K. A. (2009) · The Journal of Neuroscience · doi:10.1523/jneurosci.5062-08.2009 · Cited by 2,862
“Several previous analyses have demonstrated that connectivity among cortical regions is not random or proportionate across regions but rather exhibits “small world” properties, including hubs (Watts and Strogatz, 1998; Sporns et al., 2004; Achard et al., 2006; Bassett and Bullmore, 2006).”
BackgroundAn Expanded View of Complex Traits: From Polygenic to Omnigenic
Boyle, E. A., Li, Y. I., & Pritchard, J. K. (2017) · Cell · doi:10.1016/j.cell.2017.05.038 · Cited by 2,851
“Nonetheless, research in network theory finds that most real-world networks tend to be highly interconnected; this is referred to as the ‘‘small world’’ property of networks (Watts and Strogatz, 1998; Strogatz, 2001).”
BackgroundMining the network value of customers
Domingos, P., & Richardson, M. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502525 · Cited by 2,830
“The success of these approaches, and the discovery of widespread network topologies with nontrivial properties [42], has led to a flurry of research on modeling the Web as a semi-random graph (e.”
BackgroundLink prediction in complex networks: A survey
Lü, L., & Zhou, T. (2011) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2010.11.027 · Cited by 2,819
“The six real networks for testing are a protein–protein interaction network (PPI) [16], a co-authorship network of scientists who are themselves publishing on the topic of network science (NS) [53], an electrical power grid of the western US (Grid) [54], a network of the US political blogs (PB) [55], a router-level In…”
BackgroundHolme, P., & Saramäki, J. (2012) · Physics Reports · doi:10.1016/j.physrep.2012.03.001 · Cited by 2,736
The spread of behavior in an online social network experiment
Centola, D. (2010) · Science · doi:10.1126/science.1185231 · Cited by 2,692
Why we twitter: understanding microblogging usage and communities
Java, A., Song, X., Finin, T., & Tseng, B. (2007) · Proceedings of the 9th WebKDD and 1st SNA-KDD 2007 workshop on Web mining and social network analysis · doi:10.1145/1348549.1348556 · Cited by 2,645
“The Web, blogosphere, online social networks and human contact networks all belong to a class of “scale-free net-works” [3] and exhibit a “small world phenomenon” [33].”
BackgroundDistinct brain networks for adaptive and stable task control in humans
Dosenbach, N. U. F., Fair, D. A., Miezin, F. M., Cohen, A. L., Wenger, K. K., Dosenbach, R. A. T., Fox, M. D., Snyder, A. Z., Vincent, J. L., Raichle, M. E., et al. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0704320104 · Cited by 2,632
Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality
Newman, M. E. J. (2001) · Physical Review E · doi:10.1103/physreve.64.016132 · Cited by 2,613
“On all unipartite random graphs C = O(n (1)) [4,23], where n is the number of vertices, and hence goes to zero in the limit of large graph size.”
BackgroundInfluentialA mesoscale connectome of the mouse brain
Oh, S. W., Harris, J. A., Ng, L., Winslow, B., Cain, N., Mihalas, S., Wang, Q., Lau, C., Kuan, L., Henry, A. M., et al. (2014) · Nature · doi:10.1038/nature13186 · Cited by 2,612
Bassett, D. S., & Bullmore, E. (2006) · The Neuroscientist · doi:10.1177/1073858406293182 · Cited by 2,600
“The path length between any two nodes is simply defined as the minimal number of edges that must be traversed to form a direct connection between the two nodes of interest (Watts and Strogatz 1998; Fig.”
BackgroundEfficiency and Cost of Economical Brain Functional Networks
Achard, S., & Bullmore, E. (2007) · PLoS Computational Biology · doi:10.1371/journal.pcbi.0030017 · Cited by 2,553
“]. In other words, brain networks have characteristically small-world properties of dense or clustered local connectivity with relatively few long-range connections mediating a short path length between any pair of neurons or regions in the network [”
BackgroundTAKING STOCK OF NETWORKS AND ORGANIZATIONS: A MULTILEVEL PERSPECTIVE.
Brass, D. J., Galaskiewicz, J., & Greve, H. R. (2004) · Academy of Management Journal · doi:10.2307/20159624 · Cited by 2,502
“The engineering task is to “rewire” a network so that there are “short cuts” between clusters that minimize the average path distance (Watts & Strogatz, 1998).”
BackgroundCharacterization of complex networks: A survey of measurements
Costa, L. D. F., Rodrigues, F. A., Travieso, G., & Villas Boas, P. R. (2007) · Advances in Physics · doi:10.1080/00018730601170527 · Cited by 2,475
“rofusion of small cycles and a power law degree distribution. These facts instigated two new developments that spurred many research efforts: Watts and Strogatz’s investigation of small-world networks [8] and Baraba´si and Albert’s characterization of scale-free models [9]. Although graph theory is a well-established a…”
BackgroundInfluentialBarthélemy, M. (2011) · Physics Reports · doi:10.1016/j.physrep.2010.11.002 · Cited by 2,469
“The paper of Watts and Strogatz [313] triggered many studies on networks and in particular motivated empirical analysis of various networks such as transportation networks.”
BackgroundInfluentialGraph evolution: Densification and shrinking diameters
Leskovec, J., Kleinberg, J., & Faloutsos, C. (2007) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1217299.1217301 · Cited by 2,461
“(B) Slowly growing diameter assumption: The diameter is a slowly growing function of the network size, as in “small world” graphs [6, 11, 38, 50 ].”
BackgroundThe spreading of misinformation online
Del Vicario, M., Bessi, A., Zollo, F., Petroni, F., Scala, A., Caldarelli, G., Stanley, H. E., & Quattrociocchi, W. (2016) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1517441113 · Cited by 2,407
“We consider n users connected by a small-world network (41) with rewiring probability r .”
MethodAchard, S., Salvador, R., Whitcher, B., Suckling, J., & Bullmore, E. (2006) · The Journal of Neuroscience · doi:10.1523/jneurosci.3874-05.2006 · Cited by 2,393
“It has been demonstrated that the neuronal network of Caenorhabditis elegans has small-world topology at a microscopic anatomical scale (Watts and Strogatz, 1998).”
BackgroundInfluentialResilience of the Internet to Random Breakdowns
Cohen, R., Erez, K., ben-Avraham, D., & Havlin, S. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.4626 · Cited by 2,391
Newman, M. (2018) · doi:10.1093/oso/9780198805090.001.0001 · Cited by 2,297
Graphs over time: densification laws, shrinking diameters and possible explanations
Leskovec, J., Kleinberg, J., & Faloutsos, C. (2005) · Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining · doi:10.1145/1081870.1081893 · Cited by 2,281
Mean-field theory for scale-free random networks
Barabási, A.-L., Albert, R., & Jeong, H. (1999) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(99)00291-5 · Cited by 2,255
Critical phenomena in complex networks
Dorogovtsev, S. N., Goltsev, A. V., & Mendes, J. F. F. (2008) · Reviews of Modern Physics · doi:10.1103/revmodphys.80.1275 · Cited by 2,220
“The small-world networks introduced by Watts and Strogatz (1998) are superpositions of finite dimensional lattices and classical random graphs, thus combining their properties.”
MethodA simple rule for the evolution of cooperation on graphs and social networks
Ohtsuki, H., Hauert, C., Lieberman, E., & Nowak, M. A. (2006) · Nature · doi:10.1038/nature04605 · Cited by 2,208
“Moreover, we find that the rule also holds for random graphs 25 and scale-free networks 26,27 , where individuals differ in the number of their neighbours.”
BackgroundCommunity detection algorithms: A comparative analysis
Lancichinetti, A., & Fortunato, S. (2009) · Physical Review E · doi:10.1103/physreve.80.056117 · Cited by 2,177
Hierarchical organization in complex networks
Ravasz, E., & Barabási, A.-L. (2003) · Physical Review E · doi:10.1103/physreve.67.026112 · Cited by 2,160
Freenet: A Distributed Anonymous Information Storage and Retrieval System
Clarke, I., Sandberg, O., Wiley, B., & Hong, T. W. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44702-4_4 · Cited by 2,109
Scale-Free Networks: A Decade and Beyond
Barabási, A.-L. (2009) · Science · doi:10.1126/science.1173299 · Cited by 2,109
Structural and Functional Brain Networks: From Connections to Cognition
Park, H.-J., & Friston, K. (2013) · Science · doi:10.1126/science.1238411 · Cited by 2,106
Global Mapping of the Yeast Genetic Interaction Network
Tong, A. H. Y., Lesage, G., Bader, G. D., Ding, H., Xu, H., Xin, X., Young, J., Berriz, G. F., Brost, R. L., Chang, M., et al. (2004) · Science · doi:10.1126/science.1091317 · Cited by 2,095
Clustering and preferential attachment in growing networks
Newman, M. E. J. (2001) · Physical Review E · doi:10.1103/physreve.64.025102 · Cited by 2,093
“We show that the probability of scientists collaborating increases with the number of other collaborators they have in common, and that the probability of a particular scientist acquiring new collaborators increases with the number of his or her past collaborators.”
BackgroundModelling disease outbreaks in realistic urban social networks
Eubank, S., Guclu, H., Anil Kumar, V. S., Marathe, M. V., Srinivasan, A., Toroczkai, Z., & Wang, N. (2004) · Nature · doi:10.1038/nature02541 · Cited by 2,090
“We find that the contact network among people is a strongly connected small-world-lik”
Background
Metadata
- Authors
- Watts, D. J., & Strogatz, S. H.
- Affiliations
- Cornell University (US)
- Corresponding author
- Watts, Duncan J.
- Venue
- Nature
- Published
- 1998-06
- Volume
- 393
- Issue
- 6684
- Pages
- 440-442
- ISSN
- 0028-0836 (ISSN-L)
- 1476-4687
- OpenAlex
- W2112090702
- Cited by
- 43,060
- References
- 31
- Citations by year
- 2026: 1367 · 2025: 1850 · 2024: 1744 · 2023: 1849 · 2022: 1997 · 2021: 2290 · 2020: 2258 · 2019: 2152 · 2018: 2223 · 2017: 2213 · 2016: 2258 · 2015: 2297 · 2014: 2404 · 2013: 2197 · 2012: 2120
- FWCI
- 88.06
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Nature (publishedVersion)
- PubMed (publishedVersion)
- HAL (submittedVersion)
- RePEc: Research Papers in Economics (submittedVersion)
- Topics
- Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Network Analysis Techniques
- Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Nonlinear Dynamics and Pattern Formation
- Physical Sciences › Engineering › Control and Systems Engineering › Neural Networks Stability and Synchronization
- Keywords
- small-world networks, network topology, coupled dynamical systems, synchronization, signal propagation, epidemic spread, clustering, path length, network rewiring, biological networks, artificial neural networks, power grid, collaboration networks
- MeSH terms
- Animals, Communicable Diseases, Games, Experimental, Models, Biological, Models, Neurological, Models, Theoretical, Nerve Net, Caenorhabditis elegans
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.