Small-world network

Small-world network example
Hubs are bigger than other nodes

Average degree= 3.833
Average shortest path length = 1.803.
Clustering coefficient = 0.522

Random graph
Average degree = 2.833
Average shortest path length = 2.109.
Clustering coefficient = 0.167

A small-world network is a graph characterized by a high clustering coefficient and low distances. On an example of social network, high clustering implies the high probability that two friends of one person are friends themselves. The low distances, on the other hand, mean that there is a short chain of social connections between any two people (this effect is known as six degrees of separation). ^[1] Specifically, a small-world network is defined to be a network where the typical distance L between two randomly chosen nodes (the number of steps required) grows proportionally to the logarithm of the number of nodes N in the network, that is: ^[2]

${\displaystyle L\propto \log N}$

while the global clustering coefficient is not small.

In the context of a social network, this results in the small world phenomenon of strangers being linked by a short chain of acquaintances. Many empirical graphs show the small-world effect, including social networks, wikis such as Wikipedia, gene networks, and even the underlying architecture of the Internet. It is the inspiration for many network-on-chip architectures in contemporary computer hardware. ^[3]

A certain category of small-world networks were identified as a class of random graphs by Duncan Watts and Steven Strogatz in 1998. ^[4] They noted that graphs could be classified according to two independent structural features, namely the clustering coefficient, and average node-to-node distance (also known as average shortest path length). Purely random graphs, built according to the Erdős–Rényi (ER) model, exhibit a small average shortest path length (varying typically as the logarithm of the number of nodes) along with a small clustering coefficient. Watts and Strogatz measured that in fact many real-world networks have a small average shortest path length, but also a clustering coefficient significantly higher than expected by random chance. Watts and Strogatz then proposed a novel graph model, currently named the Watts and Strogatz model, with (i) a small average shortest path length, and (ii) a large clustering coefficient. The crossover in the Watts–Strogatz model between a "large world" (such as a lattice) and a small world was first described by Barthelemy and Amaral in 1999. ^[5] This work was followed by many studies, including exact results (Barrat and Weigt, 1999; Dorogovtsev and Mendes; Barmpoutis and Murray, 2010).

Properties of small-world networks

Small-world networks tend to contain cliques, and near-cliques, meaning sub-networks which have connections between almost any two nodes within them. This follows from the defining property of a high clustering coefficient. Secondly, most pairs of nodes will be connected by at least one short path. This follows from the defining property that the mean-shortest path length be small. Several other properties are often associated with small-world networks. Typically there is an over-abundance of hubs – nodes in the network with a high number of connections (known as high degree nodes). These hubs serve as the common connections mediating the short path lengths between other edges. By analogy, the small-world network of airline flights has a small mean-path length (i.e. between any two cities you are likely to have to take three or fewer flights) because many flights are routed through hub cities. This property is often analyzed by considering the fraction of nodes in the network that have a particular number of connections going into them (the degree distribution of the network). Networks with a greater than expected number of hubs will have a greater fraction of nodes with high degree, and consequently the degree distribution will be enriched at high degree values. This is known colloquially as a fat-tailed distribution. Graphs of very different topology qualify as small-world networks as long as they satisfy the two definitional requirements above.

Network small-worldness has been quantified by a small-coefficient, ${\displaystyle \sigma }$, calculated by comparing clustering and path length of a given network to an equivalent random network with same degree on average. ^{[6] [7]}

${\displaystyle \sigma ={\frac {\frac {C}{C_{r}}}{\frac {L}{L_{r}}}}}$

if ${\displaystyle \sigma >1}$ (${\textstyle C\gg C_{r}}$ and ${\textstyle L\approx {L_{r}}}$), network is small-world. However, this metric is known to perform poorly because it is heavily influenced by the network's size. ^{[8] [9]}

Another method for quantifying network small-worldness utilizes the original definition of the small-world network comparing the clustering of a given network to an equivalent lattice network and its path length to an equivalent random network. The small-world measure (${\displaystyle \omega }$) is defined as ^[8]

${\displaystyle \omega ={\frac {L_{r}}{L}}-{\frac {C}{C_{\ell }}}}$

Where the characteristic path length L and clustering coefficient C are calculated from the network you are testing, C_ℓ is the clustering coefficient for an equivalent lattice network and L_r is the characteristic path length for an equivalent random network.

Still another method for quantifying small-worldness normalizes both the network's clustering and path length relative to these characteristics in equivalent lattice and random networks. The Small World Index (SWI) is defined as ^[9]

${\displaystyle {\text{SWI}}={\frac {L-L_{\ell }}{L_{r}-L_{\ell }}}\times {\frac {C-C_{r}}{C_{\ell }-C_{r}}}}$

Both ω′ and SWI range between 0 and 1, and have been shown to capture aspects of small-worldness. However, they adopt slightly different conceptions of ideal small-worldness. For a given set of constraints (e.g. size, density, degree distribution), there exists a network for which ω′ = 1, and thus ω aims to capture the extent to which a network with given constraints as small worldly as possible. In contrast, there may not exist a network for which SWI = 1, the thus SWI aims to capture the extent to which a network with given constraints approaches the theoretical small world ideal of a network where C ≈ C_ℓ and L ≈ L_r. ^[9]

Examples of small-world networks

Small-world properties are found in many real-world phenomena, including websites with navigation menus, food webs, electric power grids, metabolite processing networks, networks of brain neurons, voter networks, telephone call graphs, and airport networks. ^[10] Cultural networks ^[11] and word co-occurrence networks ^[12] have also been shown to be small-world networks.

Networks of connected proteins have small world properties such as power-law obeying degree distributions. ^[13] Similarly transcriptional networks, in which the nodes are genes, and they are linked if one gene has an up or down-regulatory genetic influence on the other, have small world network properties. ^[14]

Examples of non-small-world networks

In another example, the famous theory of "six degrees of separation" between people tacitly presumes that the domain of discourse is the set of people alive at any one time. The number of degrees of separation between Albert Einstein and Alexander the Great is almost certainly greater than 30 ^[15] and this network does not have small-world properties. A similarly constrained network would be the "went to school with" network: if two people went to the same college ten years apart from one another, it is unlikely that they have acquaintances in common amongst the student body.

Similarly, the number of relay stations through which a message must pass was not always small. In the days when the post was carried by hand or on horseback, the number of times a letter changed hands between its source and destination would have been much greater than it is today. The number of times a message changed hands in the days of the visual telegraph (circa 1800–1850) was determined by the requirement that two stations be connected by line-of-sight.

Tacit assumptions, if not examined, can cause a bias in the literature on graphs in favor of finding small-world networks (an example of the file drawer effect resulting from the publication bias).

Network robustness

It is hypothesized by some researchers, such as Albert-László Barabási, that the prevalence of small world networks in biological systems may reflect an evolutionary advantage of such an architecture. One possibility is that small-world networks are more robust to perturbations than other network architectures. If this were the case, it would provide an advantage to biological systems that are subject to damage by mutation or viral infection.

In a small world network with a degree distribution following a power-law, deletion of a random node rarely causes a dramatic increase in mean-shortest path length (or a dramatic decrease in the clustering coefficient). This follows from the fact that most shortest paths between nodes flow through hubs, and if a peripheral node is deleted it is unlikely to interfere with passage between other peripheral nodes. As the fraction of peripheral nodes in a small world network is much higher than the fraction of hubs, the probability of deleting an important node is very low. For example, if the small airport in Sun Valley, Idaho was shut down, it would not increase the average number of flights that other passengers traveling in the United States would have to take to arrive at their respective destinations. However, if random deletion of a node hits a hub by chance, the average path length can increase dramatically. This can be observed annually when northern hub airports, such as Chicago's O'Hare airport, are shut down because of snow; many people have to take additional flights.

By contrast, in a random network, in which all nodes have roughly the same number of connections, deleting a random node is likely to increase the mean-shortest path length slightly but significantly for almost any node deleted. In this sense, random networks are vulnerable to random perturbations, whereas small-world networks are robust. However, small-world networks are vulnerable to targeted attack of hubs, whereas random networks cannot be targeted for catastrophic failure.

Construction of small-world networks

See also: Diffusion-limited aggregation and Pattern formation

The main mechanism to construct small-world networks is the Watts–Strogatz mechanism.

Small-world networks can also be introduced with time-delay, ^[16] which will not only produce fractals but also chaos ^[17] under the right conditions, or transition to chaos in dynamics networks. ^[18]

Soon after the publication of Watts–Strogatz mechanism, approaches have been developed by Mashaghi and co-workers to generate network models that exhibit high degree correlations, while preserving the desired degree distribution and small-world properties. These approaches are based on edge-dual transformation and can be used to generate analytically solvable small-world network models for research into these systems. ^[19]

Degree–diameter graphs are constructed such that the number of neighbors each vertex in the network has is bounded, while the distance from any given vertex in the network to any other vertex (the diameter of the network) is minimized. Constructing such small-world networks is done as part of the effort to find graphs of order close to the Moore bound.

Another way to construct a small world network from scratch is given in Barmpoutis et al., ^[20] where a network with very small average distance and very large average clustering is constructed. A fast algorithm of constant complexity is given, along with measurements of the robustness of the resulting graphs. Depending on the application of each network, one can start with one such "ultra small-world" network, and then rewire some edges, or use several small such networks as subgraphs to a larger graph.

Small-world properties can arise naturally in social networks and other real-world systems via the process of dual-phase evolution. This is particularly common where time or spatial constraints limit the addition of connections between vertices The mechanism generally involves periodic shifts between phases, with connections being added during a "global" phase and being reinforced or removed during a "local" phase.

Small-world networks can change from scale-free class to broad-scale class whose connectivity distribution has a sharp cutoff following a power law regime due to constraints limiting the addition of new links. ^[21] For strong enough constraints, scale-free networks can even become single-scale networks whose connectivity distribution is characterized as fast decaying. ^[21] It was also shown analytically that scale-free networks are ultra-small, meaning that the distance scales according to ${\displaystyle L\propto \log \log N}$. ^[22]

Applications

Applications to sociology

The advantages to small world networking for social movement groups are their resistance to change due to the filtering apparatus of using highly connected nodes, and its better effectiveness in relaying information while keeping the number of links required to connect a network to a minimum. ^[23]

The small world network model is directly applicable to affinity group theory represented in sociological arguments by William Finnegan. Affinity groups are social movement groups that are small and semi-independent pledged to a larger goal or function. Though largely unaffiliated at the node level, a few members of high connectivity function as connectivity nodes, linking the different groups through networking. This small world model has proven an extremely effective protest organization tactic against police action. ^[24] Clay Shirky argues that the larger the social network created through small world networking, the more valuable the nodes of high connectivity within the network. ^[23] The same can be said for the affinity group model, where the few people within each group connected to outside groups allowed for a large amount of mobilization and adaptation. A practical example of this is small world networking through affinity groups that William Finnegan outlines in reference to the 1999 Seattle WTO protests.

Applications to earth sciences

Many networks studied in geology and geophysics have been shown to have characteristics of small-world networks. Networks defined in fracture systems and porous substances have demonstrated these characteristics. ^[25] The seismic network in the Southern California region may be a small-world network. ^[26] The examples above occur on very different spatial scales, demonstrating the scale invariance of the phenomenon in the earth sciences.

Applications to computing

Small-world networks have been used to estimate the usability of information stored in large databases. The measure is termed the Small World Data Transformation Measure. ^{[27] [28]} The greater the database links align to a small-world network the more likely a user is going to be able to extract information in the future. This usability typically comes at the cost of the amount of information that can be stored in the same repository.

The Freenet peer-to-peer network has been shown to form a small-world network in simulation, ^[29] allowing information to be stored and retrieved in a manner that scales efficiency as the network grows.

Nearest Neighbor Search solutions like HNSW use small-world networks to efficiently find the information in large item corpuses. ^{[30] [31]}

Small-world neural networks in the brain

Both anatomical connections in the brain ^[32] and the synchronization networks of cortical neurons ^[33] exhibit small-world topology.

Structural and functional connectivity in the brain has also been found to reflect the small-world topology of short path length and high clustering. ^[34] The network structure has been found in the mammalian cortex across species as well as in large scale imaging studies in humans. ^[35] Advances in connectomics and network neuroscience, have found the small-worldness of neural networks to be associated with efficient communication. ^[36]

In neural networks, short pathlength between nodes and high clustering at network hubs supports efficient communication between brain regions at the lowest energetic cost. ^[36] The brain is constantly processing and adapting to new information and small-world network model supports the intense communication demands of neural networks. ^[37] High clustering of nodes forms local networks which are often functionally related. Short path length between these hubs supports efficient global communication. ^[38] This balance enables the efficiency of the global network while simultaneously equipping the brain to handle disruptions and maintain homeostasis, due to local subsystems being isolated from the global network. ^[39] Loss of small-world network structure has been found to indicate changes in cognition and increased risk of psychological disorders. ^[9]

In addition to characterizing whole-brain functional and structural connectivity, specific neural systems, such as the visual system, exhibit small-world network properties. ^[6]

A small-world network of neurons can exhibit short-term memory. A computer model developed by Sara Solla ^{[40] [41]} had two stable states, a property (called bistability) thought to be important in memory storage. An activating pulse generated self-sustaining loops of communication activity among the neurons. A second pulse ended this activity. The pulses switched the system between stable states: flow (recording a "memory"), and stasis (holding it). Small world neuronal networks have also been used as models to understand seizures. ^[42]

See also

• Barabási–Albert model  – Scale-free network generation algorithm
• Climate as complex networks  – Conceptual model to generate insight into climate science
• Dual-phase evolution  – Process that drives self-organization within complex adaptive systems
• Dunbar's number  – Suggested cognitive limit important in sociology and anthropology
• Erdős number  – Closeness of someone's association with mathematician Paul Erdős
• Erdős–Rényi (ER) model  – Two closely related models for generating random graphs
• Local World Evolving Network Models
• Percolation theory  – Mathematical theory on behavior of connected clusters in a random graph
• Network science  – Academic field - mathematical theory of networks
• Scale-free network  – Network whose degree distribution follows a power law
• Six degrees of Kevin Bacon  – Parlor game on degrees of separation
• Small-world experiment  – Experiments examining the average path length for social networks
• Social network  – Social structure made up of a set of social actors
• Watts–Strogatz model  – Method of generating random small-world graphs
• Network on a chip  – Electronic communication subsystem on an integrated circuit – systems on chip modeled on small-world networks
• Zachary's karate club

References

1. Downey, Allen B. (2016). "3". Think Complexity (PDF). Needham, Massachusetts: Green Tea Press. p. 27.
2. Watts DJ, Strogatz SH (June 1998). "Collective dynamics of 'small-world' networks". Nature. 393 (6684): 440–2. Bibcode:1998Natur.393..440W. doi:10.1038/30918. PMID   9623998. S2CID   4429113.
3. Kundu S, Chattopadhyay S (2014). Network-on-chip: the Next Generation of System-on-Chip Integration (1st ed.). Boca Raton, FL: CRC Press. ISBN   9781466565272. OCLC   895661009.
4. Watts DJ, Strogatz SH (June 1998). "Collective dynamics of 'small-world' networks". Nature. 393 (6684): 440–2. Bibcode:1998Natur.393..440W. doi:10.1038/30918. PMID   9623998. S2CID   4429113.
5. Barthelemy M, Amaral LA (1999). "Small-world networks: Evidence for a crossover picture". Physical Review Letters. 82 (15): 3180–3183. arXiv: cond-mat/9903108 . Bibcode:1999PhRvL..82.3180B. doi:10.1103/PhysRevLett.82.3180. S2CID   119398712.
6. Humphries MD (2006). "The brainstem reticular formation is a small-world, not scale-free, network". Proceedings of the Royal Society B: Biological Sciences. 273 (1585): 503–511. doi:10.1098/rspb.2005.3354. PMC   1560205 . PMID   16615219.
7. Humphries MD, Gurney K (April 2008). "Network 'small-world-ness': a quantitative method for determining canonical network equivalence". PLOS ONE. 3 (4): e0002051. Bibcode:2008PLoSO...3.2051H. doi: 10.1371/journal.pone.0002051 . PMC   2323569 . PMID   18446219.
8. Telesford QK, Joyce KE, Hayasaka S, Burdette JH, Laurienti PJ (2011). "The ubiquity of small-world networks". Brain Connectivity. 1 (5): 367–75. arXiv: 1109.5454 . Bibcode:2011arXiv1109.5454T. doi:10.1089/brain.2011.0038. PMC   3604768 . PMID   22432451.
9. Neal ZP (2017). "How small is it? Comparing indices of small worldliness". Network Science. 5 (1): 30–44. doi:10.1017/nws.2017.5. ISSN   2050-1242. S2CID   3844585.
10. Yang YC (1972). "Terminal Road Bridges for San Francisco International Airport Airport". ACI Journal Proceedings. 69 (10). doi:10.14359/7189.
11. Senekal BA (December 2015). "'n Kwantifisering van kleinwêreldsheid in Afrikaanse kultuurnetwerke in vergelyking met ander komplekse netwerke: natuurwetenskappe" [A quantification of small worlds in African cultural networks compared to other complex networks: natural sciences.]. 'n Joernaal vir die Geesteswetenskappe, Natuurwetenskappe, Regte en Godsdienswetenskappe (in Afrikaans). 12 (3). Litnet Akademies: 665–88.
12. Senekal B, Kotzé E (2017). "Die statistiese eienskappe van geskrewe Afrikaans as'n komplekse netwerk" [The statistical properties of written Afrikaans as a complex network]. 'n Joernaal vir die Geesteswetenskappe, Natuurwetenskappe, Regte en Godsdienswetenskappe (in Afrikaans). 14 (1). Litnet Akademies: 27–59.
13. Bork P, Jensen LJ, von Mering C, Ramani AK, Lee I, Marcotte EM (June 2004). "Protein interaction networks from yeast to human" (PDF). Current Opinion in Structural Biology. 14 (3): 292–9. doi:10.1016/j.sbi.2004.05.003. PMID   15193308.
14. van Noort V, Snel B, Huynen MA (March 2004). "The yeast coexpression network has a small-world, scale-free architecture and can be explained by a simple model". EMBO Reports. 5 (3): 280–4. doi:10.1038/sj.embor.7400090. PMC   1299002 . PMID   14968131.
15. Einstein and Alexander the Great lived 2202 years apart. Assuming an age difference of 70 years between any two connected people in the chain that connects the two, this would necessitate at least 32 connections between Einstein and Alexander the Great.
16. Yang XS (2002). "Fractals in small-world networks with time-delay". Chaos, Solitons & Fractals. 13 (2): 215–219. arXiv: 1003.4949 . Bibcode:2002CSF....13..215Y. doi:10.1016/S0960-0779(00)00265-4. S2CID   119109068.
17. Yang XS (March 2001). "Chaos in small-world networks". Physical Review E. 63 (4): 046206. arXiv: 1003.4940 . Bibcode:2001PhRvE..63d6206Y. doi:10.1103/PhysRevE.63.046206. PMID   11308929. S2CID   38158445.
18. Yuan WJ, Luo XS, Jiang PQ, Wang BH, Fang JQ (August 2008). "Transition to chaos in small-world dynamical network". Chaos, Solitons & Fractals. 37 (3): 799–806. Bibcode:2008CSF....37..799Y. doi:10.1016/j.chaos.2006.09.077.
19. A Ramezanpour, V Karimipour, A Mashaghi, Generating correlated networks from uncorrelated ones. Physical Review E 67(4 Pt 2):046107 (2003) doi: 10.1103/PhysRevE.67.046107
20. Barmpoutis D, Murray RM (2010). "Networks with the Smallest Average Distance and the Largest Average Clustering". arXiv: 1007.4031 [q-bio.MN].
21. Amaral LA, Scala A, Barthelemy M, Stanley HE (October 2000). "Classes of small-world networks". Proceedings of the National Academy of Sciences of the United States of America. 97 (21): 11149–52. arXiv: cond-mat/0001458 . Bibcode:2000PNAS...9711149A. doi: 10.1073/pnas.200327197 . PMC   17168 . PMID   11005838.
22. Cohen R, Havlin S (2003). "Scale-free networks are ultrasmall". Physical Review Letters. 90 (5): 058701. arXiv: cond-mat/0205476 . Bibcode:2003PhRvL..90e8701C. doi:10.1103/PhysRevLett.90.058701. PMID   12633404. S2CID   10508339.
23. Shirky C (2008). Here Comes Everybody: the power of organizing without organizations . Penguin Press. ISBN   978-1-59420-153-0. OCLC   168716646.
24. Finnegan, William "Affinity Groups and the Movement Against Corporate Globalization"
25. Yang XS (July 2001). "Small‐world networks in geophysics". Geophysical Research Letters. 28 (13): 2549–52. arXiv: 1003.4886 . Bibcode:2001GeoRL..28.2549Y. doi:10.1029/2000GL011898. S2CID   118655139.(2001)
26. Jiménez A, Tiampo KF, Posadas AM (May 2008). "Small world in a seismic network: the California case" (PDF). Nonlinear Processes in Geophysics. 15 (3): 389–95. Bibcode:2008NPGeo..15..389J. doi: 10.5194/npg-15-389-2008 .
27. Hillard R, McClowry S, Somich B. "Small Worlds Data Transformation Measure". MIKE2.0, the open source methodology for Information Development. Archived from the original on 2015-09-12. Retrieved 2012-01-05.
28. Hillard R (2010). Information-Driven Business. Wiley. ISBN   978-0-470-62577-4.
29. Sandberg O (2005). Searching in a Small World (PDF) (Ph.D. thesis). Göteborg, Sweden: Chalmers University of Technology and Göteborg University. Archived (PDF) from the original on 2012-03-16. Retrieved 2013-12-12.
30. "Hierarchical Navigable Small Worlds (HNSW) | Pinecone". www.pinecone.io. Retrieved 2024-03-05.
31. "Understanding Hierarchical Navigable Small Worlds (HNSW)". DataStax. Retrieved 2024-03-05.
32. Sporns O, Chialvo DR, Kaiser M, Hilgetag CC (September 2004). "Organization, development and function of complex brain networks". Trends in Cognitive Sciences. 8 (9): 418–25. doi:10.1016/j.tics.2004.07.008. PMID   15350243. S2CID   2855338.
33. Yu S, Huang D, Singer W, Nikolic D (December 2008). "A small world of neuronal synchrony". Cerebral Cortex. 18 (12): 2891–901. doi:10.1093/cercor/bhn047. PMC   2583154 . PMID   18400792.
34. Bassett, Danielle S.; Bullmore, Edward T. (2017-10-23). "Small-World Brain Networks Revisited". The Neuroscientist. 23 (5): 499–516. doi:10.1177/1073858416667720. ISSN   1073-8584. PMC   5603984 . PMID   27655008.
35. Bettencourt, Luís M. A.; Stephens, Greg J.; Ham, Michael I.; Gross, Guenter W. (2007-02-23). "Functional structure of cortical neuronal networks grown in vitro". Physical Review E. 75 (2): 021915. arXiv: q-bio/0703018 . Bibcode:2007PhRvE..75b1915B. doi:10.1103/PhysRevE.75.021915. ISSN   1539-3755. PMID   17358375. S2CID   14757568.
36. Bullmore, Ed; Sporns, Olaf (2012-04-13). "The economy of brain network organization". Nature Reviews. Neuroscience. 13 (5): 336–349. doi:10.1038/nrn3214. ISSN   1471-0048. PMID   22498897. S2CID   16174225.
37. Bassett, D. S.; Bullmore, E.; Verchinski, B. A.; Mattay, V. S.; Weinberger, D. R.; Meyer-Lindenberg, A. (2008-09-10). "Hierarchical Organization of Human Cortical Networks in Health and Schizophrenia". Journal of Neuroscience. 28 (37): 9239–9248. doi:10.1523/JNEUROSCI.1929-08.2008. ISSN   0270-6474. PMC   2878961 . PMID   18784304.
38. Voss, Michelle W.; Wong, Chelsea N.; Baniqued, Pauline L.; Burdette, Jonathan H.; Erickson, Kirk I.; Prakash, Ruchika Shaurya; McAuley, Edward; Laurienti, Paul J.; Kramer, Arthur F. (2013-11-06). Sathian, Krish (ed.). "Aging Brain from a Network Science Perspective: Something to Be Positive About?". PLOS ONE. 8 (11): e78345. Bibcode:2013PLoSO...878345V. doi: 10.1371/journal.pone.0078345 . ISSN   1932-6203. PMC   3819386 . PMID   24223147.
39. Levit-Binnun, Nava; Davidovitch, Michael; Golland, Yulia (2013-09-24). "Sensory and motor secondary symptoms as indicators of brain vulnerability". Journal of Neurodevelopmental Disorders. 5 (1): 26. doi: 10.1186/1866-1955-5-26 . ISSN   1866-1947. PMC   3849186 . PMID   24063566.
40. Cohen P (26 May 2004). "Small world networks key to memory". New Scientist.
41. Solla S (2004). "Self-Sustained Activity in a Small-World Network of Excitable Neurons". Physical Review Letters. 92 (19). UC Santa Barbara, Kavli Institute for Theoretical Physics: 198101. arXiv: nlin/0309067 . Bibcode:2004PhRvL..92s8101R. doi:10.1103/PhysRevLett.92.198101. PMID   15169447. S2CID   14272272. Archived from the original on 2016-09-14. Retrieved 2006-03-06.
42. Ponten SC, Bartolomei F, Stam CJ (April 2007). "Small-world networks and epilepsy: graph theoretical analysis of intracerebrally recorded mesial temporal lobe seizures". Clinical Neurophysiology. 118 (4): 918–27. doi:10.1016/j.clinph.2006.12.002. PMID   17314065. S2CID   35927833.

Further reading

Books

• Buchanan M (2003). Nexus: Small Worlds and the Groundbreaking Theory of Networks . Norton, W. W. & Company, Inc. ISBN   978-0-393-32442-6.
• Dorogovtsev SN, Mendes JF (2003). Evolution of Networks: from biological networks to the Internet and WWW. Oxford University Press. ISBN   978-0-19-851590-6.
• Watts DJ (1999). Small Worlds: The Dynamics of Networks Between Order and Randomness. Princeton University Press. ISBN   978-0-691-00541-6.
• Fowler JH (2005). "Turnout in a Small World". In Zuckerman A (ed.). Social Logic of Politics. Temple University Press. pp. 269–287.

Journal articles

• Albert R, Barabási AL (2002). "Statistical mechanics of complex networks". Rev. Mod. Phys. 74 (1): 47–97. arXiv: cond-mat/0106096 . Bibcode:2002RvMP...74...47A. doi:10.1103/RevModPhys.74.47. S2CID   60545.
• Barabasi AL, Albert R (October 1999). "Emergence of scaling in random networks". Science. 286 (5439): 509–12. arXiv: cond-mat/9910332 . Bibcode:1999Sci...286..509B. doi:10.1126/science.286.5439.509. PMID   10521342. S2CID   524106.
• Barthelemy M, Amaral LA (1999). "Small-world networks: Evidence for a crossover picture". Phys. Rev. Lett. 82 (15): 3180–3183. arXiv: cond-mat/9903108 . Bibcode:1999PhRvL..82.3180B. doi:10.1103/PhysRevLett.82.3180. S2CID   119398712.
• Dorogovtsev SN, Mendes JF (2000). "Exactly solvable analogy of small-world networks". Europhys. Lett. 50 (1): 1–7. arXiv: cond-mat/9907445 . Bibcode:2000EL.....50....1D. doi:10.1209/epl/i2000-00227-1. S2CID   11334862.
• Milgram S (1967). "The Small World Problem". Psychology Today. 1 (1): 60–67.
• Newman M (2003). "The Structure and Function of Complex Networks". SIAM Review. 45 (2): 167–256. arXiv: cond-mat/0303516 . Bibcode:2003SIAMR..45..167N. doi:10.1137/S003614450342480. S2CID   65837. pdf Archived 2021-03-14 at the Wayback Machine
• Ravid D, Rafaeli S (2004). "Asynchronous discussion groups as Small World and Scale Free Networks". First Monday. 9 (9). doi: 10.5210/fm.v9i9.1170 . S2CID   6388295.

External links

• Dynamic Proximity Networks by Seth J. Chandler, The Wolfram Demonstrations Project.
• Small-World Networks entry on Scholarpedia (by Mason A. Porter)