WorksPhysics and Astronomy
Nanowire networks: how does small-world character evolve with dimensionality?
Abstract
Networks of nanowires are currently under consideration for a wide range of electronic and optoelectronic applications. Nanowire devices are usually made by sequential deposition, which inevitably leads to stacking of the wires on top of one another. Here we demonstrate the effect of stacking on the topology of the resulting networks. We compare perfectly 2D networks with quasi3D networks, and compare both nanowire networks to the corresponding Watts Strogatz networks, which are standard benchmark systems. By investigating quantities such as clustering, path length, modularity, and small world propensity we show that the connectivity of the quasi-3D networks is significantly different to that of the 2D networks, a result which may have important implications for applications of nanowire networks.
Introduction
Networks of nanowires and nanotubes have a range of potential applications in photovoltaic, optoelectronic, and sensor devices such as flexible transparent electrodes, organic light emitting diodes, and bioelectric interfaces.[1, 2, 3, 4, 5, 6, 7, 8, 9] More particularly, it has been proposed that the structures of self-assembled networks of nanowires (and nanoparticles[10, 11, 12]) mimic some of the complex biological structures of the brain, and therefore may be useful as novel systems for neuromorphic computing.[13, 14, 15] Networks of nanowires exhibit a number of brain-like properties such as reconfiguration dynamics and short and long term memory.[16, 17, 18] They exhibit winner-takes-all behaviour[14] and have been proposed as systems for physical reservoir computing,[13] able to perform tasks such as nonlinear transformations, sine wave auto-generation, and Mackey-Glass chaotic time series forecasting.[19, 20]
Randomly deposited networks of nanowires have been studied extensively within the framework of percolation theory.[21, 22, 23, 24, 25, 26, 27] More recent work has addressed the topological structure of 2D nanowire networks using well-established techniques in graph and network theory. These networks have been shown to exhibit a small-world architecture similar to many biological systems,[27, 28] i.e. the nodes are considered to be both highly clustered and have small path lengths between nodes.[29] This concept is of interest because small-world architecture is thought to affect emergent behavior in complex systems,[30, 31] and to be important for information propagation across networks,[32, 33] with several groups also demonstrating that reservoir computing performance is impacted by small-world or scale-free network architectures.[34, 35]
Previous modelling has, however, assumed that the nanowire networks are perfectly two-dimensional i.e. that the wires lie in a plane.[23, 24, 25, 26, 27, 28] This is clearly not the case for real-world nanowire networks in which the wires are stacked on top of one another during a deposition process. Given the importance of topological structure for information processing and a range of other network properties there is clearly a need for models which incorporate realistic stacking of the nanowires.
In the present work, we seek to understand the impact of stacking on the connectivity of a nanowire network. We build a physical model that explicitly considers the sequence in which the wires are deposited and the consequent stacking of the wires in a three-dimensional volume. It is important to note that because the network is built up by sequential deposition, it is quasi-three-dimensional (Q3D) and is therefore distinct from percolating systems[21] in which the objects are randomly placed in a 3D space (without requiring that the wires rest on each other). We show here that perfectly 2D networks have much broader degree distributions and much larger mean degrees than the Q3D networks. We demonstrate the impact of dimensionality on the small-world nature of the networks, and conclude that experimentally realized Q3D networks of nanowires are likely to have very different network structures than model 2D structures.
Nanowire Models
We consider networks of wires, deposited on a area, which is considered to be the -plane. For each wire in the network, the - and -coordinates of the mid-point of the wire were chosen at random from a uniform distribution over , and the angle the wire makes with the -axis was drawn from a uniform distribution over . Every point where two or more wires touch is taken to be a junction in the network. This connectivity is then stored in a adjacency matrix, which also allows the number of connections between each wire and its neighbours (the degree, ) to be calculated. For the 2D network, every wire is considered to be a 1D line (i.e. with zero thickness). As a result, the wires lie exactly in the -plane, and every intercept is a junction (similar to that shown in Figure 1c).
Figure 1. (a) Schematic illustration of a simple device with two contacts. The network of 500 nanowires is deposited on a drop zone. The length of each wire was drawn from a uniform distribution with mean length and range . The magnified part of (a) shows the stacking of the wires in the vertical direction after sequential deposition. The blue wire is a randomly chosen wire which makes connections with other wires (in red) during the deposition process. (b), (c) An example of the difference in connectivity between the two networks when stacking is included in the model. Left: a portion of the network; right: the adjacency matrix. In the 2D network (b), the chosen wire forms a junction with every wire that it intercepts (red), leading to many more connections. However in the Q3D network (c) the chosen wire connects only to the limited number of wires that are in direct contact. (d, e) The graph representation of the same networks. The Q3D network has fewer edges than the 2D network and thus has a much sparser adjacency matrix than the 2D network, as shown in (b) and (c).
In the Q3D network, each wire also has a diameter and therefore carves out a volume in space that cannot be occupied by any other wire. The wires are deposited sequentially, one at a time, and the vertical position of each new wire depends on the positions of the wires that have already been deposited. A comparison of Figure 1b and Figure 1c shows that stacking causes some wires that are in contact in the perfectly 2D system to become separated vertically in the Q3D system.
For each new wire, the algorithm determines firstly which wires are below it, and calculates the intercept coordinates, with the largest -value as the first contact point. This point acts as a pivot around which the new wire must rotate. The location of the centre of mass with respect to the pivot point determines the direction of rotation, and hence the location of the second point of contact. This results in a network that is stacked vertically in a third dimension, the -axis, as shown in Figure 1a and ESI Fig. S1 and S2. As with the 2D model, every point of contact is a junction and the connections between wires are stored in an adjacency matrix (Figure 1b and Figure 1c). This allows construction of a graph representation of the network, where each node is taken to be the center of a wire and each edge represents a contact between two wires (Figure 1d and Figure 1e).
It is of course possible to consider additional processes during the wire deposition, including allowing the wires to settle, slide or bend. However, the purpose of the present work is to investigate the effect of dimensionality on network connectivity (rather than the detailed deposition dynamics) and so we focus on the simplest model that captures the essential features, i.e. the wires are perfectly rigid and do not move from their initial position after deposition.
In order to compare the nanowire networks with benchmark networks, we also generated four sets of Watts-Strogatz (WS) networks. The first step in generating WS networks is to calculate the mean degree for each 2D or Q3D network. The WS network has the same and but connections are rewired with probability to another node chosen at random from all other available nodes.[29] As shown in ESI Fig. S3, for each value of we construct two WS networks: one with , making a regular network, and the other with , making a random network. We then compare the 2D, Q3D, and the WS networks using a number of common measures from network theory (see Methods). These include the degree, path length (), and average local clustering coefficient () distributions. We then also examine the community structure of the network, the modularity of a community partitioned network, and the small world propensity.
Results and discussion
We varied the mean wire length , the dispersion , and the number of nanowires in the network . Values of were chosen to be 6, 6.5, 7, 7.5, 8, 8.5, and 9 . Values for the dispersion were chosen to be 0, 0.1, 0.2 and 0.5 (hence the minimum possible length of any given wire is and the maximum possible length is ). is fixed at 30 and the scaling of the network properties with and is shown in ESI Fig S5. These choices of parameters enables comparisons with existing literature on the topology of 2D nanowire networks. [27] For the Q3D network, the wire diameter is chosen to be 20 nm. We considered networks in which the number of wires ranged from 50 (almost perfectly two-dimensional) to 2000 (highly three-dimensional as shown in ESI Fig. S1 and S2). For clarity of presentation we show data only for , 180, 500, 1000, and 2000 wires.
Degree and path length
The difference in the connectivity of the networks (Figure 1c, Figure 1d) is reflected in the degree and path length distributions, as shown in Figure 2 for typical networks for each . The 2D networks in Figure 2a, Figure 2b have much broader degree distributions and generally narrower path length distributions than the Q3D networks (Figure 2c, Figure 2d). In
Figure 2. (a), (b) Degree distribution and path length for a 2D network with , 180, 500, 1000, 2000 (from dark to light colours) and , . (c), (d) Degree distribution and path length distribution for a Q3D network with the same parameters. Note that figures in the same column are plotted on the same x-scale. The inset image in (c) shows the degree distribution of the Q3D network on a zoomed x-scale. Note the logarithmic scale for (b), (d) which allows visualisation of the broadening with increasing of the path length distribution of the Q3D network.
the 2D network the number of intersections increases for each newly deposited wire. Therefore, we see an approximately linear increase in mean degree with increasing (Figure 3a). We also see a gradual decrease in path length as more connections become available (Figure 3c). In contrast, for the Q3D networks is much lower and it increases at a much slower rate. The growth of the height of the network (ESI Fig. S2) in the -direction also results in a higher mean path length for the Q3D networks.
Figure 3. (a) The dependence of average degree on system size. The markers are the average values taken over all combinations of (6, 6.5, 7, 7.5, 8, 8.5, 9) and (0, 0.1, 0.2, 0.5) (28 networks) for both the 2D (red) and Q3D (blue) networks. (b) Average clustering coefficient for the 2D and Q3D networks with the corresponding Watts-Strogatz networks for comparison. For each value of the mean degree, two WS networks were constructed: one with a rewiring probability of (down triangle) and one with (up triangle). This was done for degree values of both the 2D (magenta) and the Q3D (green) networks. (c) The average path lengths of the network. (d) The result of the Louvain algorithm. All error bars are one standard deviation of the data obtained from all 28 networks. Note that the regular WS () networks corresponding to the 3D network have high values of , and so are not displayed here. A modified version of this plot with a logarithmic y-scale is presented in ESI Fig. S6.
Clustering and comparison with WS networks
Figure 3b and Figure 3c compare the clustering coefficients and path lengths of each nanowire network with the corresponding WS networks. The 2D network, has high clustering like the WS regular network (, ▼), but a low mean path length similar to that of the WS random network (, ▲). These are typical characteristics of a small world network. The Q3D model, on the other hand, exhibits a low degree of clustering, similar to that of the corresponding WS random network (▲). The mean path lengths in the Q3D network are higher than those in the 2D network, but are still similar to those in the corresponding WS random network.
Figure 4 shows a comparison of the average mean path lengths and average local clustering coefficients for a large number of realisations of both the 2D and Q3D networks, with different values of , , and . This alternative representation of the data shows clearly that the Q3D networks are significantly less clustered and have greater mean path lengths than the 2D networks. The mean values of (square symbols) are similar for but become more different as increases: decreases for the 2D networks, but increases for the Q3D networks. There is considerable scatter in the path lengths from network to network, but the clustering coefficients are only weakly dependent on , wire length and dispersion for . For , in both the 2D and Q3D networks, there is significant variation in clustering because the system is close to the percolation threshold (, see ESI Fig. S4).
Figure 4. Watts-Strogatz cartographic plane showing the average clustering coefficient against the average path length. The small circular markers are results for each combination of and , with the different colours representing different . The large squares are the mean values for each . The data for the , , , and wire networks are closely grouped, but the data for is widely dispersed due to the proximity of the percolation threshold (for both the 2D and Q3D systems ).
Modularity and community structure
The separation of typical networks into modules is shown in Figure 5. The 2D network is much more densely
Figure 5. The partitioning of the 500 nanowire example network featured in Figure 1 into communities based on the Louvain algorithm[36] of modularity maximization. (a) 2D and (b) Q3D.
connected than the Q3D network, and the communities are more clearly defined. The communities in the Q3D network can also be clearly seen, but overlap much more than in the 2D network. Figure 3d shows that the modularity, (see Methods for definition), for the Q3D network is higher for all network sizes. For both the 2D and Q3D networks, is similar to that of the regular WS networks () with the same dimensionality (▼ and ▼ respectively).
The degree of modularity is of interest because it reflects the vulnerability of a network to different types of ‘attack’ by random removal of nodes.[37] In the low modularity regime, removal of nodes fragments the modules internally and causes the network to collapse. For high modularity, the network undergoes a fragmentation process where, while the modules remain intact, they become disconnected from one another. Networks with a broader degree distribution tend to be more vulnerable to fragmentation in this way.[37] This is because a broader degree distribution with the same average degree implies more low-degree nodes and hence fewer interconnections between nodes. Thus the higher modularity in the Q3D network is at least partly a consequence of the smaller average degree (see Figure 2).
Small-world
A small world architecture[29] is characterised by a high degree of clustering and a small average path length between nodes, but the precise definition of the “small-world effect” has been the subject of some debate.[38] Here, we use the small-world propensity (see Methods for definition) to quantify the “small-worldness” of the network.[39]
The effects of system size on are shown in Figure 6a. For the 2D and Q3D networks are almost identical because the density of the networks is low, with limited overlapping of wires. As groups of wires begin to span the network, the small-world propensity decreases. Muldoon et al propose a pragmatic threshold value of , [39] with networks having identified as having a strong small-world propensity. The 2D network remains consistently above this threshold ( for ). In contrast, for the Q3D networks it is clear that for the stacking of the wires becomes important and drops below .
Figure 6. (a) Comparisons of the small-world propensity () between the 2D and Q3D networks. The averages for the networks were taken over 28 networks, and the error bars are one standard deviation. For the larger networks, the small-world propensity of the Q3D networks is lower than that of the 2D networks. Contributions of clustering coefficient () and path length () to the small-world propensity for the 2D (b) and Q3D (c) networks. Larger values of and indicate that the network has large deviations from the corresponding benchmark networks (see text), leading to lower values of . (d) , the contribution to the deviation indicates whether or played a bigger role in driving the result for . High negative values indicate that the low clustering relative to a regular network strongly drives down (high positive values would imply that high path lengths relative to a random network most strongly decreases the value of ). In other words, the path lengths do not deviate very much from the benchmark path lengths, but the clustering does.
Figure 6b-Figure 6d further elucidate the contributions of the clustering coefficient and the path length to ( and respectively – see methods for definitions). is high for the Q3D network (Figure 6c) indicating a large divergence from the regular network due to lower clustering. The 2D network by comparison, has much lower values of (Figure 6b). Both networks have low values of , due to their small path lengths, which are similar to those of the corresponding WS random networks. Figure 6d shows the contribution, to the deviation (see methods and ESI Fig. S7 for more details). The negative values of for both networks indicate that the dominant contribution to is the low level of clustering compared with the corresponding WS regular network. This is especially evident in the Q3D network. Ultimately, the lower small world propensity for the Q3D networks results from a more dramatic decrease in clustering than is observed for the 2D networks.
Conclusion
We have shown that stacking of nanowires during deposition significantly affects the connectivity and topology of the resulting network. Perfectly 2D networks have much broader degree distributions and much larger
mean degrees than the quasi-3D networks that result from stacking. Differences in connectivity are observable soon after the percolation threshold is exceeded i.e. as soon the number of wires is sufficient to connect opposite sides of the system (allowing current to flow through the network). More specifically the small world character of quasi-3D networks is significantly lower than in the 2D networks. The Q3D networks instead exhibit greater modularity. Perhaps surprisingly, the connectivity of the Q3D networks does not increase when additional nanowires are deposited.
These differences in connectivity will have significant effects on the properties of real-world nanowire networks, and hence on potential applications such as neuromorphic computing. It is known for example that small world connectivity is advantageous for time series prediction within a reservoir computing framework [35] and significantly affects synchronisability in oscillator networks. [32, 40]
Methods
The nanowire simulations were built using Python v3.7.7. The graph analysis measures were taken from the Python NetworkX [41] and iGraph [42] libraries, and the MATLAB Brain Connectivity Toolbox. [43]
Since the connections between wires can be mapped to an adjacency matrix, we can use graph theory to analyze the networks. In order to simplify analysis, the corresponding graph is considered to be undirected and the edges unweighted – that is, the adjacency matrix is a symmetric binary matrix. Each wire is modelled as a node (or vertex) in a graph, and each contact between wires is an edge. The nanowire network is then treated as the graph , where is the set of nodes and the set of edges. The number of wires that are connected to wire is the degree, . The mean degree is then
The degree distribution, , captures some aspects of the connectivity of the network, but there are many other metrics. Watts and Strogatz introduced methods to characterise the path lengths and clustering of the network, as described below. Given any two nodes in the network and , the path length , is the shortest sequence of edges that connects them. The average path length (also sometimes called the characteristic path length) is then,
The local clustering coefficient is the fraction of the total allowable edges that exist between node and its neighbours. For an undirected network with adjacency matrix , the local clustering coefficient of node with degree is given by
The global clustering coefficient is then the average of these values
The small-world propensity, , [39] was defined in order to quantify the deviation of the clustering coefficient, , and path length, , of the network from those of both regular and random networks with the same number of nodes and degree distribution in such a way as to account for variations in network density:
where,
and
In addition to the small-world propensity, following the work of Muldoon et al, we also quantify the amount that and contribute to . This can be done by calculating the angular difference of the values of the network from the value of equal contribution of and (see ESI Fig. S7). This calculation is then called the contribution to the deviation,
The method we used to partition the network was the Louvain method of community detection.[36] In brief, nodes within the same community are more densely connected to one another than with nodes in other communities. Each node is assigned to one community, then pairs of communities are combined iteratively such that the number of connections within groups is maximized while the number of connections between groups is minimized. This is done by maximizing the modularity, a measure of the relative density of edges inside the groups with respect to edges outside the groups. For some partition of a network with edges with node having degree , into communities , the modularity of this is[44]
where is the Kronecker delta function. The overall modularity is then the maximum modularity of all possible partitions of the network . Many naturally occurring networks are found to be divisible into distinct communities via optimization of the network modularity.[45]
References
References
- [1]S. Ye, A. R. Rathmell, Z. Chen, I. E. Stewart, and B. J. Wiley, Metal nanowire networks: The next generation of transparent conductors, Advanced Materials 26, 6670 (2014).DOI
- [2]S. Park, M. Vosguerichian, and Z. Bao, A review of fabrication and applications of carbon nanotube film-based flexible electronics, Nanoscale 5, 1727 (2013).DOI
- [3]T. Sannicolo, M. Lagrange, A. Cabos, C. Celle, J.-P. Simonato, and D. Bellet, Metallic nanowire-based transparent electrodes for next generation flexible devices: a review, Small 12, 6052 (2016).DOI
- [4]B. Tian and C. M. Lieber, Nanowired bioelectric interfaces, Chemical Reviews 119, 9136 (2019), pMID: 30995019.DOI
- [5]J. F. Fennell Jr., S. F. Liu, J. M. Azzarelli, J. G. Weis, S. Rochat, K. A. Mirica, J. B. Ravnsbæk, and T. M. Swager, Nanowire chemical/biological sensors: Status and a roadmap for the future, Angewandte Chemie International Edition 55, 1266 (2016).
- [6]H. Y. Zheng, O. A. Alsager, B. Zhu, J. Travas-Sejdic, J. M. Hodgkiss, and N. O. V. Plank, Electrostatic gating in carbon nanotube aptasensors, Nanoscale 8, 13659 (2016).DOI
- [7]C.-H. Song, C. J. Han, B.-K. Ju, and J.-W. Kim, Photoenhanced patterning of metal nanowire networks for fabrication of ultraflexible transparent devices, ACS Applied Materials and Interfaces 8, 480 (2016).DOI
- [8]J. Lee, K. An, P. Won, Y. Ka, H. Hwang, H. Moon, Y. Kwon, S. Hong, C. Kim, C. Lee, and S. H. Ko, A dual-scale metal nanowire network transparent conductor for highly efficient and flexible organic light emitting diodes, Nanoscale 9, 1978 (2017).DOI
- [9]W. Li, H. Zhang, S. Shi, J. Xu, X. Qin, Q. He, K. Yang, W. Dai, G. Liu, Q. Zhou, H. Yu, S. R. P. Silva, and M. Fahlman, Recent progress in silver nanowire networks for flexible organic electronics, J. Mater. Chem. C 8, 4636 (2020).DOI
- [10]J. B. Mallinson, S. Shirai, S. K. Acharya, S. K. Bose, E. Galli, and S. A. Brown, Avalanches and criticality in self-organized nanoscale networks, Science Advances 5, 10.1126/sciadv.aaw8438 (2019).DOI
- [11]S. Shirai, S. K. Acharya, S. K. Bose, J. B. Mallinson, E. Galli, M. D. Pike, M. D. Arnold, and S. A. Brown, Long-range temporal correlations in scale-free neuromorphic networks, Network Neuroscience 4, 432 (2020).DOI
- [12]M. D. Pike, S. K. Bose, J. B. Mallinson, S. K. Acharya, S. Shirai, E. Galli, S. J. Weddell, P. J. Bones, M. D. Arnold, and S. A. Brown, Atomic Scale Dynamics Drive Brain-like Avalanches in Percolating Nanostructured Networks, Nano Letters 20, 3935 (2020).DOI
- [13]A. V. Avizienis, H. O. Silly, C. Martin-Olmos, H. H. Shieh, M. Aono, A. Z. Stieg, and J. K. Gimzewski, Neuromorphic atomic switch networks, PLOS ONE 7, 1 (2012).DOI
- [14]H. G. Manning, F. Niosi, C. G. da Rocha, A. T. Bellew, C. O’Callaghan, S. Biswas, P. F. Flowers, B. J. Wiley, J. D. Holmes, M. S. Ferreira, and J. J. Boland, Emergence of winner-takes-all connectivity paths in random nanowire networks, Nature Communications 9, 3219 (2018).DOI
- [15]H. Tanaka, M. Akai-Kasaya, A. TermehyYousefi, L. Hong, L. Fu, H. Tamukoh, D. Tanaka, T. Asai, and T. Ogawa, A molecular neuromorphic network device consisting of single-walled carbon nanotubes complexed with polyoxometalate, Nature Communications 9, 2693 (2018).
- [16]A. Z. Stieg, A. V. Avizienis, H. O. Silin, C. Martin-Olmos, M. Aono, and J. K. Gimzewski, Emergent criticality in complex touring by-type atomic switch networks, Advanced Materials 24, 286 (2012).DOI
- [17]A. Diaz-Alvarez, R. Higuchi, P. Sanz-Leon, I. Marcus, Y. Shingaya, A. Z. Stieg, J. K. Gimzewski, Z. Kuncic, and T. Nakayama, Emergent dynamics of neuromorphic nanowire networks, Scientific Reports 9, 14920 (2019).
- [18]G. Milano, G. Pedretti, M. Fretto, L. Boarino, F. Benfenati, D. Telmini, I. Valov, and C. Ricciardi, Brain-inspired structural plasticity through reweighting and rewiring in multi-terminal self-organizing memristive nanowire networks, Advanced Intelligent Systems 2, 2000096 (2020).
- [19]K. Fu, R. Zhu, A. Loeffler, J. Hochstetter, A. Diaz-Alvarez, A. Stieg, J. Gimzewski, T. Nakayama, and Z. Kuncic, Reservoir computing with neuromemristive nanowire networks, in 2020 International Joint ConferenceDOI
- [20]ence on Neural Networks (IJCNN) (2020) pp. 1–8 Z. Kuncic, O. Kavehei, R. Zhu, A. Loeffler, K. Fu, J. Hochstetter, M. Li, J. M. Shine, A. Diaz-Alvarez, A. Stieg, J. Gimzewski, and T. Nakayama, Neuromorphic information processing with nanowire networks, in 2020 IEEE International Symposium on Circuits and Systems (ISCAS) (2020) pp. 1–5.DOI
- [21]D. Stauffer and A. Aharony, Introduction to Percolation Theory, 2nd ed. (Taylor and Francis, 1992).
- [22]S. Fostner, R. Brown, J. Carr, and S. A. Brown, Continuum percolation with tunneling, Phys. Rev. B 89, 075402 (2014).DOI
- [23]J. Li and S.-L. Zhang, Finite-size scaling in stick percolation, Physical Review E 80, 040104 (2009).pubmed.ncbi.nlm.nih.gov/19905260
- [24]D. P. Langley, M. Lagrange, N. D. Nguyen, and D. Bellet, Percolation in networks of 1-dimensional objects: comparison between monte carlo simulations and experimental observations, Nanoscale Horizons 3, 545 (2018).
- [25]S. I. White, R. M. Mutiso, P. M. Vora, D. Jahnke, S. Hsu, J. M. Kikkawa, J. Li, J. E. Fischer, and K. I. Winey, Electrical percolation behavior in silver nanowire-polystyrene composites: Simulation and experiment, Advanced Functional Materials 20, 2709 (2010).DOI
- [26]R. M. Mutiso, M. C. Sherrott, A. R. Rathmell, B. J. Wiley, and K. I. Winey, Integrating simulations and experiments to predict sheet resistance and optical transmittance in nanowire films for transparent conductors, ACS Nano 7, 7654 (2013), pMID: 23930701.DOI
- [27]A. Loeffler, R. Zhu, J. Hochstetter, M. Li, K. Fu, A. Diaz-Alvarez, T. Nakayama, J. M. Shine, and Z. Kuncic, Topological properties of neuromorphic nanowire networks, Frontiers in Neuroscience 14, 184 (2020).DOI
- [28]R. D. Pantone, J. D. Kendall, and J. C. Nino, Memristive nanowires exhibit small-world connectivity, Neural Networks 106, 144 (2018).DOI
- [29]D. J. Watts and S. H. Strogatz, Collective dynamics of ‘small-world’ networks, Nature 393, 440 (1998).
- [30]A. Pascual-Garcia, A topological approach to the problem of emergence in complex systems, arXiv:1610.02448 (2016).
- [31]S. H. Strogatz, Exploring complex networks, Nature 410, 268 (2001).pubmed.ncbi.nlm.nih.gov/11258382
- [32]T. Nishikawa, A. Motter, Y.-C. Lai, and F. Hoppensteadt, Heterogeneity in oscillator networks: Are smaller worlds easier to synchronize?, Physical Review Letters 91, 014101 (2003).DOI
- [33]Jinhu Lu, Xinghuo Yu, Guanrong Chen, and Daizhan Cheng, Characterizing the synchronizability of small-world dynamical networks, IEEE Transactions on Circuits and Systems I: Regular Papers 51, 787 (2004).DOI
- [34]A. Haluszczynski, J. Aumeier, J. Herteux, and C. Räth, Reducing network size and improving prediction stability of reservoir computing, Chaos: An Interdisciplinary Journal of Nonlinear Science 30, 063136 (2020).DOI
- [35]Z. Deng and Y. Zhang, Collective behavior of a small-world recurrent neural system with scale-free distribution, IEEE Transactions on Neural Networks 18, 1364 (2007).pubmed.ncbi.nlm.nih.gov/18220186
- [36]V. D. Blondel, J.-L. Guillaume, R. Lambiotte, and E. Lefebvre, Fast unfolding of communities in large networks, Journal of Statistical Mechanics: Theory and Experiment 2008, P10008 (2008).
- [37]S. Shai, D. Y. Kenett, Y. N. Kenett, M. Faust, S. Dobson, and S. Havlin, Critical tipping point distinguishing two types of transitions in modular network structures, Phys. Rev. E 92, 062805 (2015).
- [38]M. Newman, Models of the small world, Journal of Statistical Physics 101, 819 (2000).DOI
- [39]S. F. Muldoun, E. W. Bridgeford, and D. S. Bassett, Small-world propensity and weighted brain networks, Scientific Reports 6, 22057 (2016).
- [40]M. Barahona and L. M. Pecora, Synchronization in small-world systems, Phys. Rev. Lett. 89, 054101 (2002).pubmed.ncbi.nlm.nih.gov/12144443
- [41]A. A. Hagberg, D. A. Schult, and P. J. Swart, Exploring network structure, dynamics, and function using networkx, in Proceedings of the 7th Python in Science Conference, edited by G. Varoquaux, T. Vaught, and J. Millman (Pasadena, CA USA, 2008) pp. 11 – 15.