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.

/pdf/collective-dynamics-of-small-world-networks-205zhem3gm.pdf

Collective dynamics of small-world networks

Systems as diverse as genetic networks or the World Wide Web are best described as networks with complex topology. A common property of many large networks is that the vertex connectivities follow a scale-free power-law distribution. This feature was found to be a consequence of two generic mechanisms: (i) networks expand continuously by the addition of new vertices, and (ii) new vertices attach preferentially to sites that are already well connected. A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.

https://arxiv.org/pdf/cond-mat/9910332.pdf

Emergence of Scaling in Random Networks

抗原变异可使得多种致病微生物易于逃避宿主免疫应答。表达在感染红细胞表面的恶性疟原虫红细胞表面蛋白1（PfPMP1）与感染红细胞、内皮细胞、树突状细胞以及胎盘的单个或多个受体作用，在黏附及免疫逃避中起关键的作用。每个单倍体基因组var基因家族编码约60种成员，通过启动转录不同的var基因变异体为抗原变异提供了分子基础。

疟原虫var基因转换速率变化导致抗原变异[英]／Paul H, Robert P, Christodoulou Z, et al//Proc Natl Acad Sci U S A

The emergence of order in natural systems is a constant source of inspiration for both physical and biological sciences. While the spatial order characterizing for example the crystals has been the basis of many advances in contemporary physics, most complex systems in nature do not offer such high degree of order. Many of these systems form complex networks whose nodes are the elements of the system and edges represent the interactions between them. 
Traditionally complex networks have been described by the random graph theory founded in 1959 by Paul Erdohs and Alfred Renyi. One of the defining features of random graphs is that they are statistically homogeneous, and their degree distribution (characterizing the spread in the number of edges starting from a node) is a Poisson distribution. In contrast, recent empirical studies, including the work of our group, indicate that the topology of real networks is much richer than that of random graphs. In particular, the degree distribution of real networks is a power-law, indicating a heterogeneous topology in which the majority of the nodes have a small degree, but there is a significant fraction of highly connected nodes that play an important role in the connectivity of the network. 
The scale-free topology of real networks has very important consequences on their functioning. For example, we have discovered that scale-free networks are extremely resilient to the random disruption of their nodes. On the other hand, the selective removal of the nodes with highest degree induces a rapid breakdown of the network to isolated subparts that cannot communicate with each other. 
The non-trivial scaling of the degree distribution of real networks is also an indication of their assembly and evolution. Indeed, our modeling studies have shown us that there are general principles governing the evolution of networks. Most networks start from a small seed and grow by the addition of new nodes which attach to the nodes already in the system. This process obeys preferential attachment: the new nodes are more likely to connect to nodes with already high degree. We have proposed a simple model based on these two principles wich was able to reproduce the power-law degree distribution of real networks. Perhaps even more importantly, this model paved the way to a new paradigm of network modeling, trying to capture the evolution of networks, not just their static topology.

/pdf/statistical-mechanics-of-complex-networks-1zfjpvxipu.pdf

Statistical mechanics of complex networks

Inspired by empirical studies of networked systems such as the Internet, social networks, and biological networks, researchers have in recent years developed a variety of techniques and models to help us understand or predict the behavior of these systems. Here we review developments in this field, including such concepts as the small-world effect, degree distributions, clustering, network correlations, random graph models, models of network growth and preferential attachment, and dynamical processes taking place on networks.

/pdf/the-structure-and-function-of-complex-networks-34deompc9l.pdf

The Structure and Function of Complex Networks

Newly won evidence shows that many real-world network systems obey a power-law scaling, just as if they were fractal shapes. Could this be the harbinger of a new architectural law for complex systems?

Complex systems: Romanesque networks.

We analyze the damped driven discrete sine-Gordon equation. For underdamped, highly discrete systems, we show that whirling periodic solutions undergo parametric instabilities at certain drive strengths. The theory predicts novel resonant steps in the current-voltage characteristics of discrete Josephson rings, occurring in the return path of the subgap region. We have observed these steps experimentally in a ring of 8 underdamped junctions. An unusual prediction, verified experimentally, is that such steps occur even if there are no vortices in the ring. Numerical simulations indicate that complex spatiotemporal behavior occurs past the onset of instability.

Whirling modes and parametric instabilities in the discrete Sine-Gordon equation: Experimental tests in Josephson rings.

Previous network analyses of several languages revealed a unique set of structural characteristics. One of these characteristics—the presence of many smaller components (referred to as islands)—was further examined with a comparative analysis of the island constituents. The results showed that Spanish words in the islands tended to be phonologically and semantically similar to each other, but English words in the islands tended only to be phonologically similar to each other. The results of this analysis yielded hypotheses about language processing that can be tested with psycholinguistic experiments, and offer insight into cross-language differences in processing that have been previously observed.

https://www.mdpi.com/1099-4300/12/3/327/pdf

Comparative Analysis of Networks of Phonologically Similar Words in English and Spanish

Stability, instability and chaos: An introduction to the theory of nonlinear differential equations: P. Glendinning, Cambridge University Press, Cambridge, UK, 1994. $69.96 (cloth), $29.95 (paper), 388 pp.

The Winfree model consists of a population of globally coupled phase oscillators with randomly distributed natural frequencies. As the coupling strength and the spread of natural frequencies are varied, the various stable states of the model can undergo bifurcations, nearly all of which have been characterized previously. The one exception is the unlocking transition, in which the frequency-locked state disappears abruptly as the spread of natural frequencies exceeds a critical width. Viewed as a function of the coupling strength, this critical width defines a bifurcation curve in parameter space. For the special case where the frequency distribution is uniform, earlier work had uncovered a puzzling singularity in this bifurcation curve. Here we seek to understand what causes the singularity. Using the Poincar\'e-Lindstedt method of perturbation theory, we analyze the locked state and its associated unlocking transition, first for an arbitrary distribution of natural frequencies, and then for discrete systems of $N$ oscillators. We confirm that the bifurcation curve becomes singular for a continuum uniform distribution, yet find that it remains well behaved for any finite $N$, suggesting that the continuum limit is responsible for the singularity.

/pdf/singular-unlocking-transition-in-the-winfree-model-of-4i235esk2y.pdf

Steven H. Strogatz

Papers

Complex systems: Romanesque networks.

Whirling modes and parametric instabilities in the discrete Sine-Gordon equation: Experimental tests in Josephson rings.

Comparative Analysis of Networks of Phonologically Similar Words in English and Spanish

Stability, instability and chaos: An introduction to the theory of nonlinear differential equations: P. Glendinning, Cambridge University Press, Cambridge, UK, 1994. $69.96 (cloth), $29.95 (paper), 388 pp.

Singular unlocking transition in the Winfree model of coupled oscillators.