Small world networks and clustered small world networks with random connectivity

International audienceThe discovery of small world properties in real-world networks has revolutionized the way we analyze and study real-world systems. Mathematicians and physicists in particular have closely studied and developed several models to artificially generate networks with small world properties. The classical algorithms to produce these graphs artificially make use of the fact that with the introduction of some randomness in ordered graphs, small world graphs can be produced. In this paper, we present a novel algorithm to generate graphs with small world properties based on the idea that with the introduction of some order in a random graph, small world graphs can be generated. Our model starts with a randomly generated graph. We then replace each node of the random graph with cliques of different sizes. This ensures that the connectivity between the cliques is random but the clustering coefficient increases to a desired level. We further extend this model to incorporate the property of community structures (clusters) found readily in real-world networks such as social, biological and technological networks. These community structures are densely connected regions of nodes in a network that are loosely connected to each other. The model generates these clustered small world graphs by replacing nodes in the random graph with densely connected set of nodes. Experimentation shows that these two models generate small world and clustered small world graphs, respectively, as we were able to produce the desired properties of a small world network with high clustering coefficient and low average path lengths in both cases. Furthermore, we also calculated relative density and modularity to show that the clustered networks indeed had community structures

The Effects of Chronic Sleep Deprivation on Sustained Attention: A Study of Brain Dynamic Functional Connectivity

It is estimated that about 35-40% of adults in the U.S. suffer from insufficient sleep. Chronic sleep deprivation has become a prevalent phenomenon because of contemporary lifestyle and work-related factors. Sleep deprivation can reduce the capabilities and efficiency of attentional performance by impairing perception, increasing effort to maintain concentration, as well as introducing vision disturbance. Thus, it is important to understand the neural mechanisms behind how chronic sleep deprivation impairs sustained attention. In recent years, more attention has been paid to the study of the integration between anatomically distributed and functionally connected brain regions. Functional connectivity has been widely used to characterize brain functional integration, which measures the statistical dependency between neurophysiological events of the human brain. Further, evidence from recent studies has shown the non-stationary nature of brain functional connectivity, which may reveal more information about the human brain. Thus, the objective of this thesis is to investigate the effects of chronic sleep deprivation on sustained attention from the perspective of dynamic functional connectivity. A modified spatial cueing paradigm was used to assess human sustained attention in rested wakefulness and chronic sleep deprivation conditions. Partial least squares approach was applied to distinguish brain functional connectivity for the experimental conditions. With the integration of a sliding-window approach, dynamic patterns of brain functional connectivity were identified in two experimental conditions. The brain was modeled as a series of dynamic functional networks in each experimental condition. Graph theoretic analysis was performed to investigate the dynamic properties of brain functional networks, using network measures of clustering coefficient and characteristics path length. In the chronic sleep deprivation condition, a compensation mechanism between highly clustered organization and ineffective adaptability of brain functional networks was observed. Specifically, a highly clustered organization of brain functional networks was illustrated with a large clustering coefficient. This organization suggested that brain utilizes more connections to maintain attention in the chronic sleep deprivation condition. A smaller impact of clustering coefficient variation on characteristics path lengths indicated an ineffective adaptability of brain functional networks in the chronic sleep deprivation condition. In the rested wakefulness condition, brain functional networks showed the small-world topology in general, with the average small-world topology index larger than one. Small-world topology was identified as an optimal network structure with the balance between local information processing and global integration. Given the fluctuating values of the index over time, small-world brain networks were observed in most cases, indicating an effective adaptability of the human brain to maintain the dominance of small-world networks in the rested wakefulness condition. On the contrary, given that the average small-world topology index was smaller than one, brain functional networks generally exhibited random network structure. From the perspective of dynamic functional networks, even though there were few cases showing small-world brain networks, brain functional networks failed to maintain the dominance of small-world topology in the chronic sleep deprivation condition. In conclusion, to the best of our knowledge this thesis was the first to investigate the effects of chronic sleep deprivation on sustained attention from the perspective of dynamic brain functional connectivity. A compensation mechanism between highly clustered organization and ineffective adaptability of brain functional networks was observed in the chronic sleep deprivation condition. Furthermore, chronic sleep deprivation impaired sustained attention by reducing the effectiveness of brain functional networks\u27 adaptability, resulting in the disrupted dominance of small-world brain networks

Unravelling small world networks

New classes of random graphs have recently been shown to exhibit the small world phenomenon - they are clustered like regular lattices and yet have small average pathlengths like traditional random graphs. Small world behaviour has been observed in a number of real life networks, and hence these random graphs represent a useful modelling tool. In particular, Grindrod [Phys. Rev. E 66 (2002) 066702-1] has proposed a class of range dependent random graphs for modelling proteome networks in bioinformatics. A property of these graphs is that, when suitably ordered, most edges in the graph are short-range, in the sense that they connect near-neighbours, and relatively few are long-range. Grindrod also looked at an inverse problem - given a graph that is known to be an instance of a range dependent random graph, but with vertices in arbitrary order, can we reorder the vertices so that the short-range/long-range connectivity structure is apparent? When the graph is viewed in terms of its adjacency matrix, this becomes a problem in sparse matrix theory: find a symmetric row/column reordering that places most nonzeros close to the diagonal. Algorithms of this general nature have been proposed for other purposes, most notably for reordering to reduce fill-in and for clustering large data sets. Here, we investigate their use in the small world reordering problem. Our numerical results suggest that a spectral reordering algorithm is extremely promising, and we give some theoretical justification for this observation via the maximum likelihood principle

Disordered configurations of the Glauber model in two-dimensional networks

We analyze the ordering efficiency and the structure of disordered configurations for the zero-temperature Glauber model on Watts-Strogatz networks obtained by rewiring 2D regular square lattices. In the small-world regime, the dynamics fails to reach the ordered state in the thermodynamic limit. Due to interplay of the perturbed regular topology and the energy neutral stochastic state transitions, the stationary state consists of two intertwined domains, manifested as multi-clustered states on the original lattice. Moreover, for intermediate rewiring probabilities, one finds an additional source of disorder due to the low connectivity degree, which gives rise to small isolated droplets of spins. We also examine the ordering process in paradigmatic two-layer networks with heterogeneous rewiring probabilities. Comparing the cases of a multiplex network and the corresponding network with random inter-layer connectivity, we demonstrate that the character of the final state qualitatively depends on the type of inter-layer connections.Comment: 7 two-column pages, 7 figures; accepted for publication in EP

Emergence of slow-switching assemblies in structured neuronal networks

Unraveling the interplay between connectivity and spatio-temporal dynamics in neuronal networks is a key step to advance our understanding of neuronal information processing. Here we investigate how particular features of network connectivity underpin the propensity of neural networks to generate slow-switching assembly (SSA) dynamics, i.e., sustained epochs of increased firing within assemblies of neurons which transition slowly between different assemblies throughout the network. We show that the emergence of SSA activity is linked to spectral properties of the asymmetric synaptic weight matrix. In particular, the leading eigenvalues that dictate the slow dynamics exhibit a gap with respect to the bulk of the spectrum, and the associated Schur vectors exhibit a measure of block-localization on groups of neurons, thus resulting in coherent dynamical activity on those groups. Through simple rate models, we gain analytical understanding of the origin and importance of the spectral gap, and use these insights to develop new network topologies with alternative connectivity paradigms which also display SSA activity. Specifically, SSA dynamics involving excitatory and inhibitory neurons can be achieved by modifying the connectivity patterns between both types of neurons. We also show that SSA activity can occur at multiple timescales reflecting a hierarchy in the connectivity, and demonstrate the emergence of SSA in small-world like networks. Our work provides a step towards understanding how network structure (uncovered through advancements in neuroanatomy and connectomics) can impact on spatio-temporal neural activity and constrain the resulting dynamics.Comment: The first two authors contributed equally -- 18 pages, including supplementary material, 10 Figures + 2 SI Figure

Efficiency of informational transfer in regular and complex networks

We analyze the process of informational exchange through complex networks by measuring network efficiencies. Aiming to study non-clustered systems, we propose a modification of this measure on the local level. We apply this method to an extension of the class of small-worlds that includes {\it declustered} networks, and show that they are locally quite efficient, although their clustering coefficient is practically zero. Unweighted systems with small-world and scale-free topologies are shown to be both globally and locally efficient. Our method is also applied to characterize weighted networks. In particular we examine the properties of underground transportation systems of Madrid and Barcelona and reinterpret the results obtained for the Boston subway network.Comment: 10 pages and 9 figure

Tunable and Growing Network Generation Model with Community Structures

Recent years have seen a growing interest in the modeling and simulation of social networks to understand several social phenomena. Two important classes of networks, small world and scale free networks have gained a lot of research interest. Another important characteristic of social networks is the presence of community structures. Many social processes such as information diffusion and disease epidemics depend on the presence of community structures making it an important property for network generation models to be incorporated. In this paper, we present a tunable and growing network generation model with small world and scale free properties as well as the presence of community structures. The major contribution of this model is that the communities thus created satisfy three important structural properties: connectivity within each community follows power-law, communities have high clustering coefficient and hierarchical community structures are present in the networks generated using the proposed model. Furthermore, the model is highly robust and capable of producing networks with a number of different topological characteristics varying clustering coefficient and inter-cluster edges. Our simulation results show that the model produces small world and scale free networks along with the presence of communities depicting real world societies and social networks.Comment: Social Computing and Its Applications, SCA 13, Karlsruhe : Germany (2013

Edge vulnerability in neural and metabolic networks

Biological networks, such as cellular metabolic pathways or networks of corticocortical connections in the brain, are intricately organized, yet remarkably robust toward structural damage. Whereas many studies have investigated specific aspects of robustness, such as molecular mechanisms of repair, this article focuses more generally on how local structural features in networks may give rise to their global stability. In many networks the failure of single connections may be more likely than the extinction of entire nodes, yet no analysis of edge importance (edge vulnerability) has been provided so far for biological networks. We tested several measures for identifying vulnerable edges and compared their prediction performance in biological and artificial networks. Among the tested measures, edge frequency in all shortest paths of a network yielded a particularly high correlation with vulnerability, and identified inter-cluster connections in biological but not in random and scale-free benchmark networks. We discuss different local and global network patterns and the edge vulnerability resulting from them.Comment: 8 pages, 4 figures, to appear in Biological Cybernetic

Small Worlds: Strong Clustering in Wireless Networks

Small-worlds represent efficient communication networks that obey two distinguishing characteristics: a high clustering coefficient together with a small characteristic path length. This paper focuses on an interesting paradox, that removing links in a network can increase the overall clustering coefficient. Reckful Roaming, as introduced in this paper, is a 2-localized algorithm that takes advantage of this paradox in order to selectively remove superfluous links, this way optimizing the clustering coefficient while still retaining a sufficiently small characteristic path length.Comment: To appear in: 1st International Workshop on Localized Algorithms and Protocols for Wireless Sensor Networks (LOCALGOS 2007), 2007, IEEE Compuster Society Pres