Synchronization in small-world systems

Enhancing synchronizability of diffusively coupled dynamical networks: a survey

In this paper, we review the literature on enhancing synchronizability of diffusively coupled dynamical networks with identical nodes. The last decade has witnessed intensive investigations on the collective behavior over complex networks and synchronization of dynamical systems is the most common form of collective behavior. For many applications, it is desired that the synchronizability-the ability of networks in synchronizing activity of their individual dynamical units-is enhanced. There are a number of methods for improving the synchronization properties of dynamical networks through structural perturbation. In this paper, we survey such methods including adding/removing nodes and/or edges, rewiring the links, and graph weighting. These methods often try to enhance the synchronizability through minimizing the eigenratio of the Laplacian matrix of the connection graph-a synchronizability measure based on the master-stability-function formalism. We also assess the performance of the methods by numerical simulations on a number of real-world networks as well as those generated through models such as preferential attachment, Watts-Strogatz, and Erdos-Rényi.

Topological Strata of Weighted Complex Networks

The statistical mechanical approach to complex networks is the dominant paradigm in describing natural and societal complex systems. The study of network properties, and their implications on dynamical processes, mostly focus on locally defined quantities of nodes and edges, such as node degrees, edge weights and -more recently- correlations between neighboring nodes. However, statistical methods quickly become cumbersome when dealing with many-body properties and do not capture the precise mesoscopic structure of complex networks. Here we introduce a novel method, based on persistent homology, to detect particular non-local structures, akin to weighted holes within the link-weight network fabric, which are invisible to existing methods. Their properties divide weighted networks in two broad classes: one is characterized by small hierarchically nested holes, while the second displays larger and longer living inhomogeneities. These classes cannot be reduced to known local or quasilocal network properties, because of the intrinsic non-locality of homological properties, and thus yield a new classification built on high order coordination patterns. Our results show that topology can provide novel insights relevant for many-body interactions in social and spatial networks. Moreover, this new method creates the first bridge between network theory and algebraic topology, which will allow to import the toolset of algebraic methods to complex systems.

Neuronal functional connection graphs among multiple areas of the rat somatosensory system during spontaneous and evoked activities

Small-World Networks (SWNs) represent a fundamental model for the comprehension of many complex man-made and biological networks. In the central nervous system, SWN models have been shown to fit well both anatomical and functional maps at the macroscopic level. However, the functional microscopic level, where the nodes of a network are represented by single neurons, is still poorly understood. At this level, although recent evidences suggest that functional connection graphs exhibit small-world organization, it is not known whether and how these maps, potentially distributed in multiple brain regions, change across different conditions, such as spontaneous and stimulus-evoked activities. We addressed these questions by analyzing the data from simultaneous multi-array extracellular recordings in three brain regions of rats, diversely involved in somatosensory information processing: the ventropostero-lateral thalamic nuclei, the primary somatosensory cortex and the centro-median thalamic nuclei. From both spike and Local Field Potential (LFP) recordings, we estimated the functional connection graphs by using the Normalized Compression Similarity for spikes and the Phase Synchrony for LFPs. Then, by using graph-theoretical statistics, we characterized the functional topology both during spontaneous activity and sensory stimulation. Our main results show that: (i) spikes and LFPs show SWN organization during spontaneous activity; (ii) after stimulation onset, while substantial functional graph reconfigurations occur both in spike and LFPs, small-worldness is nonetheless preserved; (iii) the stimulus triggers a significant increase of inter-area LFP connections without modifying the topology of intra-area functional connections. Finally, investigating computationally the functional substrate that supports the observed phenomena, we found that (iv) the fundamental concept of cell assemblies, transient groups of activating neurons, can be described by small-world networks. Our results suggest that activity of neurons from multiple areas of the rat somatosensory system contributes to the integration of local computations arisen in distributed functional cell assemblies according to the principles of SWNs.

Cell assemblies (sequences of neuronal activations), seem to represent a functional unit of information processing. However, it remains unclear how groups of neurons may organize their activity during information processing, working as a sole functional unit. One prominent principle in complex network theory is covered by small-world networks, in which each node is easily reachable by each other and organized in highly dense clusters. Small-world networks have been already observed on large scales in human and primate brain areas while their presence at the neuronal level remains unclear. The aim of this work was to investigate the possibility that functional, related neural populations, encompassing multiple brain regions, could be organized in small-world networks. We investigated the coherent neuronal activity among multiple rat brain regions involved in somatosensory information processing. We found that the recorded neuronal populations represented small-world networks and that these topologies were maintained during stimulations. Furthermore, by using simulations to explore the hidden substrates supporting the observed topological features, we inferred that small-world networks represent a plausible topology for cell assemblies. This work suggests that the coherent activity of neurons from multiple brain areas promotes the integration of local computations, the functional principle of small-world networks.

Connectivity-driven coherence in complex networks

We study the emergence of coherence in complex networks of mutually coupled nonidentical elements. We uncover the precise dependence of the dynamical coherence on the network connectivity, the isolated dynamics of the elements, and the coupling function. These findings predict that in random graphs the enhancement of coherence is proportional to the mean degree. In locally connected networks, coherence is no longer controlled by the mean degree but rather by how the mean degree scales with the network size. In these networks, even when the coherence is absent, adding a fraction s of random connections leads to an enhancement of coherence proportional to s. Our results provide a way to control the emergent properties by the manipulation of the dynamics of the elements and the network connectivity.

Detecting triplet locking by triplet synchronization indices

We discuss the effect of triplet synchrony in oscillatory networks. In this state the phases and the frequencies of three coupled oscillators fulfill the conditions of a triplet locking, whereas every pair of systems remains asynchronous. We suggest an easy to compute measure, a triplet synchronization index, which can be used to detect such states from experimental data.

The difference of brain functional connectivity between eyes-closed and eyes-open using graph theoretical analysis

To study the differences in functional brain networks between eyes-closed (EC) and eyes-open (EO) at resting state, electroencephalographic (EEG) activity was recorded in 21 normal adults during EC and EO states. The synchronization likelihood (SL) was applied to measure correlations between all pairwise EEG channels, and then the SL matrices were converted to graphs by thresholding. Graphs were measured by topological parameters in theta (4-7 Hz), alpha (8-13 Hz), and beta (14-30 Hz) bands. By changing from EC to EO states, mean cluster coefficients decreased in both theta and alpha bands, but mean shortest path lengths became shorter only in the alpha band. In addition, local efficiencies decreased in both theta and alpha bands, while global efficiencies in the alpha band increased inversely. Opening the eyes decreased both nodes and connections in frontal area in the theta band, and also decreased those in bilateral posterior areas in the alpha band. These results suggested that a combination of the SL and graph theory methods may be a useful tool for distinguishing states of EC and EO. The differences in functional connectivity between EC and EO states may reflect the difference of information communication in human brain.

Topology identification of uncertain nonlinearly coupled complex networks with delays based on anticipatory synchronization

This paper presents an adaptive anticipatory synchronization based method for simultaneous identification of topology and parameters of uncertain nonlinearly coupled complex dynamical networks with time delays. An adaptive controller is proposed, based on Lyapunov stability theorem and Barbǎlat's Lemma, to guarantee the stability of the anticipatory synchronization manifold between drive and response networks. Meanwhile, not only the identification criteria of network topology and system parameters are obtained but also the anticipatory time is identified. Numerical simulation results illustrate the effectiveness of the proposed method.

Distributed synchronization of coupled neural networks via randomly occurring control

In this paper, we study the distributed synchronization and pinning distributed synchronization of stochastic coupled neural networks via randomly occurring control. Two Bernoulli stochastic variables are used to describe the occurrences of distributed adaptive control and updating law according to certain probabilities. Both distributed adaptive control and updating law for each vertex in a network depend on state information on each vertex's neighborhood. By constructing appropriate Lyapunov functions and employing stochastic analysis techniques, we prove that the distributed synchronization and the distributed pinning synchronization of stochastic complex networks can be achieved in mean square. Additionally, randomly occurring distributed control is compared with periodically intermittent control. It is revealed that, although randomly occurring control is an intermediate method among the three types of control in terms of control costs and convergence rates, it has fewer restrictions to implement and can be more easily applied in practice than periodically intermittent control.

Optimal synchronizability of bearings

Bearings are mechanical dissipative systems that, when perturbed, relax toward a synchronized (bearing) state. Here we find that bearings can be perceived as physical realizations of complex networks of oscillators with asymmetrically weighted couplings. Accordingly, these networks can exhibit optimal synchronization properties through fine-tuning of the local interaction strength as a function of node degree [Motter, Zhou, and Kurths, Phys. Rev. E 71, 016116 (2005)]. We show that, in analogy, the synchronizability of bearings can be maximized by counterbalancing the number of contacts and the inertia of their constituting rotor disks through the mass-radius relation, m~r(α), with an optimal exponent α=α(×) which converges to unity for a large number of rotors. Under this condition, and regardless of the presence of a long-tailed distribution of disk radii composing the mechanical system, the average participation per disk is maximized and the energy dissipation rate is homogeneously distributed among elementary rotors.

Phase transition of light on complex quantum networks

Recent advances in quantum optics and atomic physics allow for an unprecedented level of control over light-matter interactions, which can be exploited to investigate new physical phenomena. In this work we are interested in the role played by the topology of quantum networks describing coupled optical cavities and local atomic degrees of freedom. In particular, using a mean-field approximation, we study the phase diagram of the Jaynes-Cummings-Hubbard model on complex networks topologies, and we characterize the transition between a Mott-like phase of localized polaritons and a superfluid phase. We found that, for complex topologies, the phase diagram is nontrivial and well defined in the thermodynamic limit only if the hopping coefficient scales like the inverse of the maximal eigenvalue of the adjacency matrix of the network. Furthermore we provide numerical evidences that, for some complex network topologies, this scaling implies an asymptotically vanishing hopping coefficient in the limit of large network sizes. The latter result suggests the interesting possibility of observing quantum phase transitions of light on complex quantum networks even with very small couplings between the optical cavities.

Diffusion dynamics on multiplex networks

We study the time scales associated with diffusion processes that take place on multiplex networks, i.e., on a set of networks linked through interconnected layers. To this end, we propose the construction of a supra-laplacian matrix, which consists of a dimensional lifting of the laplacian matrix of each layer of the multiplex network. We use perturbative analysis to reveal analytically the structure of eigenvectors and eigenvalues of the complete network in terms of the spectral properties of the individual layers. The spectrum of the supra-laplacian allows us to understand the physics of diffusionlike processes on top of multiplex networks.

Robustness of random graphs based on graph spectra

It has been recently proposed that the robustness of complex networks can be efficiently characterized through the natural connectivity, a spectral property of the graph which corresponds to the average Estrada index. The natural connectivity corresponds to an average eigenvalue calculated from the graph spectrum and can also be interpreted as the Helmholtz free energy of the network. In this article, we explore the use of this index to characterize the robustness of Erdős-Rényi (ER) random graphs, random regular graphs, and regular ring lattices. We show both analytically and numerically that the natural connectivity of ER random graphs increases linearly with the average degree. It is also shown that ER random graphs are more robust than the corresponding random regular graphs with the same number of vertices and edges. However, the relative robustness of ER random graphs and regular ring lattices depends on the average degree and graph size: there is a critical graph size above which regular ring lattices are more robust than random graphs. We use our analytical results to derive this critical graph size as a function of the average degree.

Convergence time and speed of multi-agent systems in noisy environments

In this paper, the finite-time consensus problem of noise-perturbed multi-agent systems with fixed and switching undirected topologies is investigated. A continuous non-Lipschitz protocol for realizing stochastic consensus in a finite time is proposed. Based on the finite-time stability theory of stochastic differential equations, sufficient conditions are obtained to ensure finite-time stochastic consensus of multi-agent systems. An analytical upper bound for the convergence time is given. The effects of control parameters and noise intensity on convergence speed and time are also analyzed. Furthermore, numerical examples are provided to illustrate the effectiveness of the theoretical results.

MEG network differences between low- and high-grade glioma related to epilepsy and cognition

Objective

To reveal possible differences in whole brain topology of epileptic glioma patients, being low-grade glioma (LGG) and high-grade glioma (HGG) patients. We studied functional networks in these patients and compared them to those in epilepsy patients with non-glial lesions (NGL) and healthy controls. Finally, we related network characteristics to seizure frequency and cognitive performance within patient groups.

Methods

We constructed functional networks from pre-surgical resting-state magnetoencephalography (MEG) recordings of 13 LGG patients, 12 HGG patients, 10 NGL patients, and 36 healthy controls. Normalized clustering coefficient and average shortest path length as well as modular structure and network synchronizability were computed for each group. Cognitive performance was assessed in a subset of 11 LGG and 10 HGG patients.

Results

LGG patients showed decreased network synchronizability and decreased global integration compared to healthy controls in the theta frequency range (4–8 Hz), similar to NGL patients. HGG patients’ networks did not significantly differ from those in controls. Network characteristics correlated with clinical presentation regarding seizure frequency in LGG patients, and with poorer cognitive performance in both LGG and HGG glioma patients.

Conclusion

Lesion histology partly determines differences in functional networks in glioma patients suffering from epilepsy. We suggest that differences between LGG and HGG patients’ networks are explained by differences in plasticity, guided by the particular lesional growth pattern. Interestingly, decreased synchronizability and decreased global integration in the theta band seem to make LGG and NGL patients more prone to the occurrence of seizures and cognitive decline.

Network coordination and synchronization in a noisy environment with time delays

We study the effects of nonzero time delays in stochastic synchronization problems with linear couplings in complex networks. We consider two types of time delays: transmission delays between interacting nodes and local delays at each node (due to processing, cognitive, or execution delays). By investigating the underlying fluctuations for several delay schemes, we obtain the synchronizability threshold (phase boundary) and the scaling behavior of the width of the synchronization landscape, in some cases for arbitrary networks and in others for specific weighted networks. Numerical computations allow the behavior of these networks to be explored when direct analytical results are not available. We comment on the implications of these findings for simple locally or globally weighted network couplings and possible trade-offs present in such systems.

Determination of the critical coupling of explosive synchronization transitions in scale-free networks by mean-field approximations

An explosive synchronization can be observed in scale-free networks when Kuramoto oscillators have natural frequencies equal to their number of connections. The present paper reports on mean-field approximations to determine the critical coupling of such explosive synchronization. It has been verified that the equation obtained for the critical coupling has an inverse dependence on the network average degree. This expression differs from those whose frequency distributions are unimodal and even. In this case, the critical coupling depends on the ratio between the first and second statistical moments of the degree distribution. Numerical simulations were also conducted to verify our analytical results.

Influence of network topology on sound propagation in granular materials

Granular media, whose features range from the particle scale to the force-chain scale and the bulk scale, are usually modeled as either particulate or continuum materials. In contrast with each of these approaches, network representations are natural for the simultaneous examination of microscopic, mesoscopic, and macroscopic features. In this paper, we treat granular materials as spatially embedded networks in which the nodes (particles) are connected by weighted edges obtained from contact forces. We test a variety of network measures to determine their utility in helping to describe sound propagation in granular networks and find that network diagnostics can be used to probe particle-, curve-, domain-, and system-scale structures in granular media. In particular, diagnostics of mesoscale network structure are reproducible across experiments, are correlated with sound propagation in this medium, and can be used to identify potentially interesting size scales. We also demonstrate that the sensitivity of network diagnostics depends on the phase of sound propagation. In the injection phase, the signal propagates systemically, as indicated by correlations with the network diagnostic of global efficiency. In the scattering phase, however, the signal is better predicted by mesoscale community structure, suggesting that the acoustic signal scatters over local geographic neighborhoods. Collectively, our results demonstrate how the force network of a granular system is imprinted on transmitted waves.

Neurocircuitry for modeling drug effects

The identification and functional understanding of the neurocircuitry that mediates alcohol and drug effects that are relevant for the development of addictive behavior is a fundamental challenge in addiction research. Here we introduce an assumption-free construction of a neurocircuitry that mediates acute and chronic drug effects on neurotransmitter dynamics that is solely based on rodent neuroanatomy. Two types of data were considered for constructing the neurocircuitry: (1) information on the cytoarchitecture and neurochemical connectivity of each brain region of interest obtained from different neuroanatomical techniques; (2) information on the functional relevance of each region of interest with respect to alcohol and drug effects. We used mathematical data mining and hierarchical clustering methods to achieve the highest standards in the preprocessing of these data. Using this approach, a dynamical network of high molecular and spatial resolution containing 19 brain regions and seven neurotransmitter systems was obtained. Further graph theoretical analysis suggests that the neurocircuitry is connected and cannot be separated into further components. Our analysis also reveals the existence of a principal core subcircuit comprised of nine brain regions: the prefrontal cortex, insular cortex, nucleus accumbens, hypothalamus, amygdala, thalamus, substantia nigra, ventral tegmental area and raphe nuclei. Finally, by means of algebraic criteria for synchronizability of the neurocircuitry, the suitability for in silico modeling of acute and chronic drug effects is indicated. Indeed, we introduced as an example a dynamical system for modeling the effects of acute ethanol administration in rats and obtained an increase in dopamine release in the nucleus accumbens-a hallmark of drug reinforcement-to an extent similar to that seen in numerous microdialysis studies. We conclude that the present neurocircuitry provides a structural and dynamical framework for large-scale mathematical models and will help to predict chronic drug effects on brain function.

Reverse engineering of complex dynamical networks in the presence of time-delayed interactions based on noisy time series

Reverse engineering of complex dynamical networks is important for a variety of fields where uncovering the full topology of unknown networks and estimating parameters characterizing the network structure and dynamical processes are of interest. We consider complex oscillator networks with time-delayed interactions in a noisy environment, and develop an effective method to infer the full topology of the network and evaluate the amount of time delay based solely on noise-contaminated time series. In particular, we develop an analytic theory establishing that the dynamical correlation matrix, which can be constructed purely from time series, can be manipulated to yield both the network topology and the amount of time delay simultaneously. Extensive numerical support is provided to validate the method. While our method provides a viable solution to the network inverse problem, significant difficulties, limitations, and challenges still remain, and these are discussed thoroughly.

Encoding dynamics for multiscale community detection: Markov time sweeping for the map equation

The detection of community structure in networks is intimately related to finding a concise description of the network in terms of its modules. This notion has been recently exploited by the map equation formalism [Rosvall and Bergstrom, Proc. Natl. Acad. Sci. USA 105, 1118 (2008)] through an information-theoretic description of the process of coding inter- and intracommunity transitions of a random walker in the network at stationarity. However, a thorough study of the relationship between the full Markov dynamics and the coding mechanism is still lacking. We show here that the original map coding scheme, which is both block-averaged and one-step, neglects the internal structure of the communities and introduces an upper scale, the "field-of-view" limit, in the communities it can detect. As a consequence, map is well tuned to detect clique-like communities but can lead to undesirable overpartitioning when communities are far from clique-like. We show that a signature of this behavior is a large compression gap: The map description length is far from its ideal limit. To address this issue, we propose a simple dynamic approach that introduces time explicitly into the map coding through the analysis of the weighted adjacency matrix of the time-dependent multistep transition matrix of the Markov process. The resulting Markov time sweeping induces a dynamical zooming across scales that can reveal (potentially multiscale) community structure above the field-of-view limit, with the relevant partitions indicated by a small compression gap.

Onset of chaotic phase synchronization in complex networks of coupled heterogeneous oscillators

Existing studies on network synchronization focused on complex networks possessing either identical or nonidentical but simple nodal dynamics. We consider networks of both complex topologies and heterogeneous but chaotic oscillators, and investigate the onset of global phase synchronization. Based on a heuristic analysis and by developing an efficient numerical procedure to detect the onset of phase synchronization, we uncover a general scaling law, revealing that chaotic phase synchronization can be facilitated by making the network more densely connected. Our methodology can find applications in probing the fundamental network dynamics in realistic situations, where both complex topology and complicated, heterogeneous nodal dynamics are expected.

Effects of noise on the outer synchronization of two unidirectionally coupled complex dynamical networks

We study the effect of noise on the outer synchronization between two unidirectionally coupled complex networks and find analytically that outer synchronization could be achieved via white-noise-based coupling. It is also demonstrated that, if two networks have both conventional linear coupling and white-noise-based coupling, the critical deterministic coupling strength between two complex networks for synchronization transition decreases with an increase in the intensity of noise. We provide numerical results to illustrate the feasibility and effectiveness of the theoretical results.

Finite-time stochastic outer synchronization between two complex dynamical networks with different topologies

In this paper, the finite-time stochastic outer synchronization between two different complex dynamical networks with noise perturbation is investigated. By using suitable controllers, sufficient conditions for finite-time stochastic outer synchronization are derived based on the finite-time stability theory of stochastic differential equations. It is noticed that the coupling configuration matrix is not necessary to be symmetric or irreducible, and the inner coupling matrix need not be symmetric. Finally, numerical examples are examined to illustrate the effectiveness of the analytical results. The effect of control parameters on the settling time is also numerically demonstrated.

A general fractional-order dynamical network: synchronization behavior and state tuning

A general fractional-order dynamical network model for synchronization behavior is proposed. Different from previous integer-order dynamical networks, the model is made up of coupled units described by fractional differential equations, where the connections between individual units are nondiffusive and nonlinear. We show that the synchronous behavior of such a network cannot only occur, but also be dramatically different from the behavior of its constituent units. In particular, we find that simple behavior can emerge as synchronized dynamics although the isolated units evolve chaotically. Conversely, individually simple units can display chaotic attractors when the network synchronizes. We also present an easily checked criterion for synchronization depending only on the eigenvalues distribution of a decomposition matrix and the fractional orders. The analytic results are complemented with numerical simulations for two networks whose nodes are governed by fractional-order Lorenz dynamics and fractional-order Rössler dynamics, respectively.

Superconductor-insulator transition on annealed complex networks

Cuprates show multiphase and multiscale complexity that has hindered physicists search for the mechanism of high T{c} for many years. Recently the interest has been addressed to a possible optimum inhomogeneity of dopants, defects, and interstitials, and the structural scale invariance of dopants detected by scanning micro-x-ray diffraction has been reported to promote the critical temperature. In order to shed light on critical phenomena on granular materials, here we propose a stylized model capturing the essential characteristics of the superconducting-insulator transition of a highly dynamical, heterogeneous granular material: the random transverse Ising model (RTIM) on annealed complex network. We show that when the networks encode for high heterogeneity of the expected degrees described by a power-law distribution, the critical temperature for the onset of the superconducting phase diverges to infinity as the power-law exponent γ of the expected degree distribution is less than 3, i.e., γ<3. Moreover we investigate the case in which the critical state of the electronic background is triggered by an external parameter g that determines an exponential cutoff in the power-law expected degree distribution characterized by an exponent γ. We find that for g=g{c} the critical temperature for the superconducting-insulator transition has a maximum if γ>3 and diverges if γ<3.

Synchronous patterns in complex systems

When a complex network is slightly desynchronized, a few of the network nodes will be escaping from the uniform synchronization background frequently with a random fashion, leading to the intermittent network synchronization. Here, based on the eigenvectors of the network coupling matrix, we propose a new method which is able to figure out the unstable nodes in the general case of desynchronized complex networks. Moreover, with this method, we are also able to regulate the seemingly random network dynamics into stable and visible synchronous patterns. The efficiency of this method is verified by a variety of network models, including varying the network structures, the node local dynamics, and the desynchronization types. Our studies show that, even for the complex network systems, synchronous patterns can still be identified and characterized.

Small-world network spectra in mean-field theory

Collective dynamics on small-world networks emerge in a broad range of systems with their spectra characterizing fundamental asymptotic features. Here we derive analytic mean-field predictions for the spectra of small-world models that systematically interpolate between regular and random topologies by varying their randomness. These theoretical predictions agree well with the actual spectra (obtained by numerical diagonalization) for undirected and directed networks and from fully regular to strongly random topologies. These results may provide analytical insights to empirically found features of dynamics on small-world networks from various research fields, including biology, physics, engineering, and social science.

The brain matures with stronger functional connectivity and decreased randomness of its network

We investigated the development of the brain's functional connectivity throughout the life span (ages 5 through 71 years) by measuring EEG activity in a large population-based sample. Connectivity was established with Synchronization Likelihood. Relative randomness of the connectivity patterns was established with Watts and Strogatz' (1998) graph parameters C (local clustering) and L (global path length) for alpha (~10 Hz), beta (~20 Hz), and theta (~4 Hz) oscillation networks. From childhood to adolescence large increases in connectivity in alpha, theta and beta frequency bands were found that continued at a slower pace into adulthood (peaking at ~50 yrs). Connectivity changes were accompanied by increases in L and C reflecting decreases in network randomness or increased order (peak levels reached at ~18 yrs). Older age (55+) was associated with weakened connectivity. Semi-automatically segmented T1 weighted MRI images of 104 young adults revealed that connectivity was significantly correlated to cerebral white matter volume (alpha oscillations: r = 33, p<01; theta: r = 22, p<05), while path length was related to both white matter (alpha: max. r = 38, p<001) and gray matter (alpha: max. r = 36, p<001; theta: max. r = 36, p<001) volumes. In conclusion, EEG connectivity and graph theoretical network analysis may be used to trace structural and functional development of the brain.

Anatomical connectivity influences both intra- and inter-brain synchronizations

Recent development in diffusion spectrum brain imaging combined to functional simulation has the potential to further our understanding of how structure and dynamics are intertwined in the human brain. At the intra-individual scale, neurocomputational models have already started to uncover how the human connectome constrains the coordination of brain activity across distributed brain regions. In parallel, at the inter-individual scale, nascent social neuroscience provides a new dynamical vista of the coupling between two embodied cognitive agents. Using EEG hyperscanning to record simultaneously the brain activities of subjects during their ongoing interaction, we have previously demonstrated that behavioral synchrony correlates with the emergence of inter-brain synchronization. However, the functional meaning of such synchronization remains to be specified. Here, we use a biophysical model to quantify to what extent inter-brain synchronizations are related to the anatomical and functional similarity of the two brains in interaction. Pairs of interacting brains were numerically simulated and compared to real data. Results show a potential dynamical property of the human connectome to facilitate inter-individual synchronizations and thus may partly account for our propensity to generate dynamical couplings with others.

Forecasting synchronizability of complex networks from data

Given a complex networked system whose topology and dynamical equations are unknown, is it possible to foresee that a certain type of collective dynamics can potentially emerge in the system, provided that only time-series measurements are available? We address this question by focusing on a commonly studied type of collective dynamics, namely, synchronization in coupled dynamical networks. We demonstrate that, using the compressive-sensing paradigm, even when the coupling strength is not uniform so that the network is effectively weighted, the full topology, the coupling weights, and the nodal dynamical equations can all be uncovered accurately. The reconstruction accuracy and data requirement are systematically analyzed, in a process that includes a validation of the reconstructed eigenvalue spectrum of the underlying coupling matrix. A master stability function (MSF), the fundamental quantity determining the network synchronizability, can then be calculated based on the reconstructed dynamical system, the accuracy of which can be assessed as well. With the coupling matrix and MSF fully uncovered, the emergence of synchronous dynamics in the network can be anticipated and controlled. To forecast the collective dynamics on complex networks is an extremely challenging problem with significant applications in many disciplines, and our work represents an initial step in this important area.

OPTIMAL GUARANTEED COST CONTROL OF UNCERTAIN STOCHASTIC COMPLEX DELAYED DYNAMICAL NETWORKS

This paper investigates the optimal guaranteed cost control of synchronization for uncertain stochastic complex networks with time-varying delays. The aim is to design state-feedback controllers such that the complex networks are globally asymptotical mean-square synchronization, and meanwhile the optimal upper bound of cost function is guaranteed. Based on Lyapunov–Krasovskii stability theory and Itô differential rule, sufficient condition for the existence of the optimal guaranteed cost control laws is given in terms of linear matrix inequalities (LMIs). A numerical example is given to illustrate the effectiveness of the proposed method.

Effects of long-range links on metastable states in a dynamic interaction network

We introduce a model for random-walking agents on a two-dimensional periodic lattice, where the dynamic interaction network is defined using local short-range interactions and E randomly added long-range interactions. With periodic states for agents and an interaction rule of repeated averaging, we numerically find two types of metastable states at low- and high-E limits, respectively, along with consensus states. If we apply this model to opinion dynamics, metastable states can be interpreted as sustainable diversities in our societies, and our results then imply that, while diversities decrease and eventually disappear with more long-range interactions, other types of diverse states can appear under this rule when networks are almost fully connected.

Effect of network architecture on synchronization and entrainment properties of the circadian oscillations in the suprachiasmatic nucleus

In mammals, the suprachiasmatic nucleus (SCN) of the hypothalamus constitutes the central circadian pacemaker. The SCN receives light signals from the retina and controls peripheral circadian clocks (located in the cortex, the pineal gland, the liver, the kidney, the heart, etc.). This hierarchical organization of the circadian system ensures the proper timing of physiological processes. In each SCN neuron, interconnected transcriptional and translational feedback loops enable the circadian expression of the clock genes. Although all the neurons have the same genotype, the oscillations of individual cells are highly heterogeneous in dispersed cell culture: many cells present damped oscillations and the period of the oscillations varies from cell to cell. In addition, the neurotransmitters that ensure the intercellular coupling, and thereby the synchronization of the cellular rhythms, differ between the two main regions of the SCN. In this work, a mathematical model that accounts for this heterogeneous organization of the SCN is presented and used to study the implication of the SCN network topology on synchronization and entrainment properties. The results show that oscillations with larger amplitude can be obtained with scale-free networks, in contrast to random and local connections. Networks with the small-world property such as the scale-free networks used in this work can adapt faster to a delay or advance in the light/dark cycle (jet lag). Interestingly a certain level of cellular heterogeneity is not detrimental to synchronization performances, but on the contrary helps resynchronization after jet lag. When coupling two networks with different topologies that mimic the two regions of the SCN, efficient filtering of pulse-like perturbations in the entrainment pattern is observed. These results suggest that the complex and heterogeneous architecture of the SCN decreases the sensitivity of the network to short entrainment perturbations while, at the same time, improving its adaptation abilities to long term changes.

In order to adapt to their cycling environment, virtually all living organisms have developed an internal timer, the circadian clock. In mammals, the circadian pacemaker is composed of about 20,000 neurons, called the suprachiasmatic nucleus (SCN) located in the hypothalamus. The SCN receives light signals from the retina and controls peripheral circadian clocks to ensure the proper timing of physiological processes. In each SCN neuron, a genetic regulatory network enables the circadian expression of the clock genes, but individual dynamics are highly heterogeneous in dispersed cell culture: many cells present damped oscillations and the period of the oscillations varies from cell to cell. In addition, the neurotransmitters that ensure the intercellular coupling, and thereby the synchronization of the cellular rhythms, differ between the two main regions of the SCN. We present here a mathematical model that accounts for this heterogeneous organization of the SCN and study the implication of the network topology on synchronization and entrainment properties. Our results show that cellular heterogeneity may help the resynchronization after jet lag and suggest that the complex architecture of the SCN decreases the sensitivity of the network to short entrainment perturbations while, at the same time, improving its adaptation abilities to long term changes.

Markov dynamics as a zooming lens for multiscale community detection: non clique-like communities and the field-of-view limit

In recent years, there has been a surge of interest in community detection algorithms for complex networks. A variety of computational heuristics, some with a long history, have been proposed for the identification of communities or, alternatively, of good graph partitions. In most cases, the algorithms maximize a particular objective function, thereby finding the 'right' split into communities. Although a thorough comparison of algorithms is still lacking, there has been an effort to design benchmarks, i.e., random graph models with known community structure against which algorithms can be evaluated. However, popular community detection methods and benchmarks normally assume an implicit notion of community based on clique-like subgraphs, a form of community structure that is not always characteristic of real networks. Specifically, networks that emerge from geometric constraints can have natural non clique-like substructures with large effective diameters, which can be interpreted as long-range communities. In this work, we show that long-range communities escape detection by popular methods, which are blinded by a restricted 'field-of-view' limit, an intrinsic upper scale on the communities they can detect. The field-of-view limit means that long-range communities tend to be overpartitioned. We show how by adopting a dynamical perspective towards community detection [1], [2], in which the evolution of a Markov process on the graph is used as a zooming lens over the structure of the network at all scales, one can detect both clique- or non clique-like communities without imposing an upper scale to the detection. Consequently, the performance of algorithms on inherently low-diameter, clique-like benchmarks may not always be indicative of equally good results in real networks with local, sparser connectivity. We illustrate our ideas with constructive examples and through the analysis of real-world networks from imaging, protein structures and the power grid, where a multiscale structure of non clique-like communities is revealed.

It's a small world after all: contrasting hierarchical and edge networks in a simulated intelligence analysis task

This article presents the rationale behind an important enhancement to a socio-technical model of organisations and teams derived from military research. It combines this with empirical results which take advantage of these enhancements. In Part 1, a new theoretical legacy for the model is developed based on Ergonomics theories and insights. This allows team communications data to be plotted into the model and for it to demonstrate discriminate validity between alternative team structures. Part 2 presents multinational data from the Experimental Laboratory for Investigating Collaboration, Information-sharing, and Trust (ELICIT) community. It was surprising to see that teams in both traditional hierarchical command and control and networked 'peer-to-peer' organisations operate in broadly the same area of the model, a region occupied by networks of communication exhibiting 'small world' properties. Small world networks may be of considerable importance for the Ergonomics analysis of team organisation and performance.

PRACTITIONER SUMMARY

This article is themed around macro and systems Ergonomics, and examines the effects of command and control structures. Despite some differences in behaviour and measures of agility, when given the freedom to do so, participants organised themselves into a small world network. This network type has important and interesting implications for the Ergonomics design of teams and organisations.

Common and unique network dynamics in football games

The sport of football is played between two teams of eleven players each using a spherical ball. Each team strives to score by driving the ball into the opposing goal as the result of skillful interactions among players. Football can be regarded from the network perspective as a competitive relationship between two cooperative networks with a dynamic network topology and dynamic network node. Many complex large-scale networks have been shown to have topological properties in common, based on a small-world network and scale-free network models. However, the human dynamic movement pattern of this network has never been investigated in a real-world setting. Here, we show that the power law in degree distribution emerged in the passing behavior in the 2006 FIFA World Cup Final and an international “A” match in Japan, by describing players as vertices connected by links representing passes. The exponent values are similar to the typical values that occur in many real-world networks, which are in the range of , and are larger than that of a gene transcription network, . Furthermore, we reveal the stochastically switched dynamics of the hub player throughout the game as a unique feature in football games. It suggests that this feature could result not only in securing vulnerability against intentional attack, but also in a power law for self-organization. Our results suggest common and unique network dynamics of two competitive networks, compared with the large-scale networks that have previously been investigated in numerous works. Our findings may lead to improved resilience and survivability not only in biological networks, but also in communication networks.

Rewiring-induced chaos in pulse-coupled neural networks

The dependence of the dynamics of pulse-coupled neural networks on random rewiring of excitatory and inhibitory connections is examined. When both excitatory and inhibitory connections are rewired, periodic synchronization emerges with a Hopf-like bifurcation and a subsequent period-doubling bifurcation; chaotic synchronization is also observed. When only excitatory connections are rewired, periodic synchronization emerges with a saddle node-like bifurcation, and chaotic synchronization is also observed. This result suggests that randomness in the system does not necessarily contaminate the system, and sometimes it even introduces rich dynamics to the system such as chaos.

Chaotic phase synchronization in a modular neuronal network of small-world subnetworks

We investigate the onset of chaotic phase synchronization of bursting oscillators in a modular neuronal network of small-world subnetworks. A transition to mutual phase synchronization takes place on the bursting time scale of coupled oscillators, while on the spiking time scale, they behave asynchronously. It is shown that this bursting synchronization transition can be induced not only by the variations of inter- and intra-coupling strengths but also by changing the probability of random links between different subnetworks. We also analyze the effect of external chaotic phase synchronization of bursting behavior in this clustered network by an external time-periodic signal applied to a single neuron. Simulation results demonstrate a frequency locking tongue in the driving parameter plane, where bursting synchronization is maintained, even with the external driving. The width of this synchronization region increases with the signal amplitude and the number of driven neurons but decreases rapidly with the network size. Considering that the synchronization of bursting neurons is thought to play a key role in some pathological conditions, the presented results could have important implications for the role of externally applied driving signal in controlling bursting activity in neuronal ensembles.

Optimal pinning synchronization on directed complex network

In this paper, pinning synchronization on directed network was considered. By analyzing, some general synchronization criteria on directed network were established. And then, we verified it on directed globally coupled network, directed scale-free network, and directed small-world network, respectively. The pinning nodes were selected, respectively, according to order of in-degrees and out-degrees. Through comparing and analyzing simulations, the optimal pinning scheme was found, and a practical principle was induced finally.

Corepressive interaction and clustering of degrade-and-fire oscillators

Strongly nonlinear degrade-and-fire (DF) oscillations may emerge in genetic circuits having a delayed negative feedback loop as their core element. Here we study the synchronization of DF oscillators coupled through a common repressor field. For weak coupling, initially distinct oscillators remain desynchronized. For stronger coupling, oscillators can be forced to wait in the repressed state until the global repressor field is sufficiently degraded, and then they fire simultaneously forming a synchronized cluster. Our analytical theory provides necessary and sufficient conditions for clustering and specifies the maximum number of clusters that can be formed in the asymptotic regime. We find that in the thermodynamic limit a phase transition occurs at a certain coupling strength from the weakly clustered regime with only microscopic clusters to a strongly clustered regime where at least one giant cluster has to be present.

Relaying phase synchrony in chaotic oscillator chains

We study the manner in which the effect of an external drive is transmitted through mutually coupled response systems by examining the phase synchrony between the drive and the response. Two different coupling schemes are used. Homogeneous couplings are via the same variables while heterogeneous couplings are through different variables. With the latter scenario, synchronization regimes are truncated with an increasing number of mutually coupled oscillators in contrast to homogeneous coupling schemes. Our results are illustrated for systems of coupled chaotic Rössler oscillators.

Spectra of sparse regular graphs with loops

We derive exact equations that determine the spectra of undirected and directed sparsely connected regular graphs containing loops of arbitrary lengths. The implications of our results for the structural and dynamical properties of network models are discussed by showing how loops influence the size of the spectral gap and the propensity for synchronization. Analytical formulas for the spectrum are obtained for specific lengths of the loops.