Synchronization in small-world systems

Phase synchronization on spatially embedded duplex networks with total cost constraint

Synchronization on multiplex networks has attracted increasing attention in the past few years. We investigate collective behaviors of Kuramoto oscillators on single layer and duplex spacial networks with total cost restriction, which was introduced by Li et al. [Phys. Rev. Lett. 104, 018701 (2010)] and termed as the Li network afterwards. We first explore how the topology of the network influences synchronizability of Kuramoto oscillators on single layer Li networks and find that the closer the Li network is to a regular lattice, the more difficult for it to evolve into synchronization. Then, we investigate synchronizability of duplex Li networks and find that the existence of inter-layer interaction can greatly enhance inter-layer and global synchronizability. When the inter-layer coupling strength is larger than a certain critical value, inter-layer synchronization will always occur. Furthermore, on single layer Li networks, nodes with larger degrees reach global synchronization more easily than those with smaller degrees, while on duplex Li networks, due to inter-layer interaction, this phenomenon becomes much less obvious. The results are important for us to gain insight into collective behaviors of many real-world complex systems which inherently possess multiplex architecture.

Enhancing network synchronization by phase modulation

Due to time delays in signal transmission and processing, phase lags are inevitable in realistic complex oscillator networks. Conventional wisdom is that phase lags are detrimental to network synchronization. Here we show that judiciously chosen phase lag modulations can result in significantly enhanced network synchronization. We justify our strategy of phase modulation, demonstrate its power in facilitating and enhancing network synchronization with synthetic and empirical network models, and provide an analytic understanding of the underlying mechanism. Our work provides an alternative approach to synchronization optimization in complex networks, with insights into control of complex nonlinear networks.

Beta-Rhythm Oscillations and Synchronization Transition in Network Models of Izhikevich Neurons: Effect of Topology and Synaptic Type

Despite their significant functional roles, beta-band oscillations are least understood. Synchronization in neuronal networks have attracted much attention in recent years with the main focus on transition type. Whether one obtains explosive transition or a continuous transition is an important feature of the neuronal network which can depend on network structure as well as synaptic types. In this study we consider the effect of synaptic interaction (electrical and chemical) as well as structural connectivity on synchronization transition in network models of Izhikevich neurons which spike regularly with beta rhythms. We find a wide range of behavior including continuous transition, explosive transition, as well as lack of global order. The stronger electrical synapses are more conducive to synchronization and can even lead to explosive synchronization. The key network element which determines the order of transition is found to be the clustering coefficient and not the small world effect, or the existence of hubs in a network. These results are in contrast to previous results which use phase oscillator models such as the Kuramoto model. Furthermore, we show that the patterns of synchronization changes when one goes to the gamma band. We attribute such a change to the change in the refractory period of Izhikevich neurons which changes significantly with frequency.

Identifying nodal properties that are crucial for the dynamical robustness of multistable networks

We investigate the collective dynamics of bistable elements connected in different network topologies and estimate the network response to localized perturbations on different classes of nodes by introducing a variant of the concept of multinode basin stability. We show that perturbations on nodes with high closeness and betweeness centrality drastically reduces the capacity of the system to return to the original state. This effect is most pronounced for a star network, where perturbation of the single hub node can destroy the collective state, while the system manages to recover even when a majority of the peripheral nodes are strongly perturbed. This demonstrates the extreme effect of the centrality of the perturbed node on the stability of the network. Further, we exploit the difference in centrality distributions in random scale-free networks with m=1 and m=2 to probe which property most influences the collective dynamics in heterogeneous networks. Significantly, we find clear evidence that the betweeness centrality of the perturbed node is more crucial for dynamical robustness than closeness centrality or degree of the node. This allows us to decide which nodes to safeguard in order to maintain the collective state of a network against targeted localized attacks.

Complex Network Geometry and Frustrated Synchronization

The dynamics of networks of neuronal cultures has been recently shown to be strongly dependent on the network geometry and in particular on their dimensionality. However, this phenomenon has been so far mostly unexplored from the theoretical point of view. Here we reveal the rich interplay between network geometry and synchronization of coupled oscillators in the context of a simplicial complex model of manifolds called Complex Network Manifold. The networks generated by this model combine small world properties (infinite Hausdorff dimension) and a high modular structure with finite and tunable spectral dimension. We show that the networks display frustrated synchronization for a wide range of the coupling strength of the oscillators, and that the synchronization properties are directly affected by the spectral dimension of the network.

Network synchronization with periodic coupling

The synchronization behavior of networked chaotic oscillators with periodic coupling is investigated. It is observed in simulations that the network synchronizability could be significantly influenced by tuning the coupling frequency, even making the network alternating between the synchronous and nonsynchronous states. Using the master stability function method, we conduct a detailed analysis of the influence of coupling frequency on network synchronizability and find that the network synchronizability is maximized at some characteristic frequencies comparable to the intrinsic frequency of the local dynamics. Moreover, it is found that as the amplitude of the coupling increases, the characteristic frequencies are gradually decreased. Using the finite-time Lyapunov exponent technique, we investigate further the mechanism for the maximized synchronizability and find that at the characteristic frequencies the power spectrum of the finite-time Lyapunov exponent is abruptly changed from the localized to broad distributions. When this feature is absent or not prominent, the network synchronizability is less influenced by the periodic coupling. Our study shows the efficiency of finite-time Lyapunov exponent in exploring the synchronization behavior of temporally coupled oscillators and sheds lights on the interplay between the system dynamics and structure in general temporal networks.

Numerical optimization of coordinated reset stimulation for desynchronizing neuronal network dynamics

Excessive synchronization in neural activity is a hallmark of Parkinson's disease (PD). A promising technique for treating PD is coordinated reset (CR) neuromodulation in which a neural population is desynchronized by the delivery of spatially-distributed current stimuli using multiple electrodes. In this study, we perform numerical optimization to find the energy-optimal current waveform for desynchronizing neuronal network with CR stimulation, by proposing and applying a new optimization method based on the direct search algorithm. In the proposed optimization method, the stimulating current is described as a Fourier series, and each Fourier coefficient as well as the stimulation period are directly optimized by evaluating the order parameter, which quantifies the synchrony level, from network simulation. This direct optimization scheme has an advantage that arbitrary changes in the dynamical properties of the network can be taken into account in the search process. By harnessing this advantage, we demonstrate the significant influence of externally applied oscillatory inputs and non-random network topology on the efficacy of CR modulation. Our results suggest that the effectiveness of brain stimulation for desynchronization may depend on various factors modulating the dynamics of the target network. We also discuss the possible relevance of the results to the efficacy of the stimulation in PD treatment.

Relay synchronization in multiplex networks

Relay (or remote) synchronization between two not directly connected oscillators in a network is an important feature allowing distant coordination. In this work, we report a systematic study of this phenomenon in multiplex networks, where inter-layer synchronization occurs between distant layers mediated by a relay layer that acts as a transmitter. We show that this transmission can be extended to higher order relay configurations, provided symmetry conditions are preserved. By first order perturbative analysis, we identify the dynamical and topological dependencies of relay synchronization in a multiplex. We find that the relay synchronization threshold is considerably reduced in a multiplex configuration, and that such synchronous state is mostly supported by the lower degree nodes of the outer layers, while hubs can be de-multiplexed without affecting overall coherence. Finally, we experimentally validated the analytical and numerical findings by means of a multiplex of three layers of electronic circuits.

Accurate detection of hierarchical communities in complex networks based on nonlinear dynamical evolution

One of the most challenging problems in network science is to accurately detect communities at distinct hierarchical scales. Most existing methods are based on structural analysis and manipulation, which are NP-hard. We articulate an alternative, dynamical evolution-based approach to the problem. The basic principle is to computationally implement a nonlinear dynamical process on all nodes in the network with a general coupling scheme, creating a networked dynamical system. Under a proper system setting and with an adjustable control parameter, the community structure of the network would "come out" or emerge naturally from the dynamical evolution of the system. As the control parameter is systematically varied, the community hierarchies at different scales can be revealed. As a concrete example of this general principle, we exploit clustered synchronization as a dynamical mechanism through which the hierarchical community structure can be uncovered. In particular, for quite arbitrary choices of the nonlinear nodal dynamics and coupling scheme, decreasing the coupling parameter from the global synchronization regime, in which the dynamical states of all nodes are perfectly synchronized, can lead to a weaker type of synchronization organized as clusters. We demonstrate the existence of optimal choices of the coupling parameter for which the synchronization clusters encode accurate information about the hierarchical community structure of the network. We test and validate our method using a standard class of benchmark modular networks with two distinct hierarchies of communities and a number of empirical networks arising from the real world. Our method is computationally extremely efficient, eliminating completely the NP-hard difficulty associated with previous methods. The basic principle of exploiting dynamical evolution to uncover hidden community organizations at different scales represents a "game-change" type of approach to addressing the problem of community detection in complex networks.

The structural balance analysis of complex dynamical networks based on nodes' dynamical couplings

The nodes and their connection relationships are the two main bodies for dynamic complex networks. In existing theoretical researches, the phenomena of stabilization and synchronization for complex dynamical networks are generally regarded as the dynamic characteristic behaviors of the nodes, which are mainly caused by coupling effect of connection relationships between nodes. However, the connection relationships between nodes are also one main body of a time-varying dynamic complex network, and thus they may evolve with time and maybe show certain characteristic phenomena. For example, the structural balance in the social networks and the synaptic facilitation in the biological neural networks. Therefore, it is important to investigate theoretically the reasons in dynamics for the occurrence. Especially, from the angle of large-scale systems, how the dynamic behaviors of nodes (such as the individuals, neurons) contribute to the connection relationships is one of worthy research directions. In this paper, according to the structural balance theory of triad proposed by F. Heider, we mainly focus on the connection relationships body, which is regarded as one of the two subsystems (another is the nodes body), and try to find the dynamic mechanism of the structural balance with the internal state behaviors of the nodes. By using the Riccati linear matrix differential equation as the dynamic model of connection relationships subsystem, it is proved under some mathematic conditions that the connection relationships subsystem is asymptotical structural balance via the effects of the coupling roles with the internal state of nodes. Finally, the simulation example is given to show the validity of the method in this paper.

Competitive influence maximization and enhancement of synchronization in populations of non-identical Kuramoto oscillators

Many networked systems have evolved to optimize performance of function. Much literature has considered optimization of networks by central planning, but investigations of network formation amongst agents connecting to achieve non-aligned goals are comparatively rare. Here we consider the dynamics of synchronization in populations of coupled non-identical oscillators and analyze adaptations in which individual nodes attempt to rewire network topology to optimize node-specific aims. We demonstrate that, even though individual nodes’ goals differ very widely, rewiring rules in which each node attempts to connect to the rest of the network in such a way as to maximize its influence on the system can enhance synchronization of the collective. The observed speed-up of consensus finding in this competitive dynamics might explain enhanced synchronization in real world systems and shed light on mechanisms for improved consensus finding in society.

Autapses promote synchronization in neuronal networks

Neurological disorders such as epileptic seizures are believed to be caused by neuronal synchrony. However, to ascertain the causal role of neuronal synchronization in such diseases through the traditional approach of electrophysiological data analysis remains a controversial, challenging, and outstanding problem. We offer an alternative principle to assess the physiological role of neuronal synchrony based on identifying structural anomalies in the underlying network and studying their impacts on the collective dynamics. In particular, we focus on autapses - time delayed self-feedback links that exist on a small fraction of neurons in the network, and investigate their impacts on network synchronization through a detailed stability analysis. Our main finding is that the proper placement of a small number of autapses in the network can promote synchronization significantly, providing the computational and theoretical bases for hypothesizing a high degree of synchrony in real neuronal networks with autapses. Our result that autapses, the shortest possible links in any network, can effectively modulate the collective dynamics provides also a viable strategy for optimal control of complex network dynamics at minimal cost.

Mirror node correlations tuning synchronization in multiplex networks

We show that the degree-degree correlations have a major impact on global synchronizability (GS) of multiplex networks, enabling the specification of synchronizability by only changing the degree-degree correlations of the mirror nodes while maintaining the connection architecture of the individual layer unaltered. If individual layers have nodes that are mildly correlated, the multiplex network is best synchronizable when the mirror degrees are strongly negatively correlated. If individual layers have nodes with strong degree-degree correlations, mild correlations among the degrees of mirror nodes are the best strategy for the optimization of GS. Global synchronization also depend on the density of connections, a phenomenon not observed in a single layer network. The results are crucial to understand, predict, and specify behavior of systems having multiple types of connections among the interacting units.

Small-world networks exhibit pronounced intermittent synchronization

We report the phenomenon of temporally intermittently synchronized and desynchronized dynamics in Watts-Strogatz networks of chaotic Rössler oscillators. We consider topologies for which the master stability function (MSF) predicts stable synchronized behaviour, as the rewiring probability (p) is tuned from 0 to 1. MSF essentially utilizes the largest non-zero Lyapunov exponent transversal to the synchronization manifold in making stability considerations, thereby ignoring the other Lyapunov exponents. However, for an N-node networked dynamical system, we observe that the difference in its Lyapunov spectra (corresponding to the N - 1 directions transversal to the synchronization manifold) is crucial and serves as an indicator of the presence of intermittently synchronized behaviour. In addition to the linear stability-based (MSF) analysis, we further provide global stability estimate in terms of the fraction of state-space volume shared by the intermittently synchronized state, as p is varied from 0 to 1. This fraction becomes appreciably large in the small-world regime, which is surprising, since this limit has been otherwise considered optimal for synchronized dynamics. Finally, we characterize the nature of the observed intermittency and its dominance in state-space as network rewiring probability (p) is varied.

Developmental increases in white matter network controllability support a growing diversity of brain dynamics

As the human brain develops, it increasingly supports coordinated control of neural activity. The mechanism by which white matter evolves to support this coordination is not well understood. Here we use a network representation of diffusion imaging data from 882 youth ages 8-22 to show that white matter connectivity becomes increasingly optimized for a diverse range of predicted dynamics in development. Notably, stable controllers in subcortical areas are negatively related to cognitive performance. Investigating structural mechanisms supporting these changes, we simulate network evolution with a set of growth rules. We find that all brain networks are structured in a manner highly optimized for network control, with distinct control mechanisms predicted in child vs. older youth. We demonstrate that our results cannot be explained by changes in network modularity. This work reveals a possible mechanism of human brain development that preferentially optimizes dynamic network control over static network architecture.

Asymmetric couplings enhance the transition from chimera state to synchronization

Chimera state has been well studied recently, but little attention has been paid to its transition to synchronization. We study this topic here by considering two groups of adaptively coupled Kuramoto oscillators. By searching the final states of different initial conditions, we find that the system can easily show a chimera state with robustness to initial conditions, in contrast to the sensitive dependence of chimera state on initial conditions in previous studies. Further, we show that, in the case of symmetric couplings, the behaviors of the two groups are always complementary to each other, i.e., robustness of chimera state, except a small basin of synchronization. Interestingly, we reveal that the basin of synchronization will be significantly increased when either the coupling of inner groups or that of intergroups are asymmetric. This transition from the attractor of chimera state to the attractor of synchronization is closely related to both the phase delay and the asymmetric degree of coupling strengths, resulting in a diversity of attractor's patterns. A theory based on the Ott-Antonsen ansatz is given to explain the numerical simulations. This finding may be meaningful for the control of competition between two attractors in biological systems, such as the cardiac rhythm and ventricular fibrillation, etc.

Stochastic Models of Emerging Infectious Disease Transmission on Adaptive Random Networks

We presented adaptive random network models to describe human behavioral change during epidemics and performed stochastic simulations of SIR (susceptible-infectious-recovered) epidemic models on adaptive random networks. The interplay between infectious disease dynamics and network adaptation dynamics was investigated in regard to the disease transmission and the cumulative number of infection cases. We found that the cumulative case was reduced and associated with an increasing network adaptation probability but was increased with an increasing disease transmission probability. It was found that the topological changes of the adaptive random networks were able to reduce the cumulative number of infections and also to delay the epidemic peak. Our results also suggest the existence of a critical value for the ratio of disease transmission and adaptation probabilities below which the epidemic cannot occur.

Ablation as targeted perturbation to rewire communication network of persistent atrial fibrillation

Persistent atrial fibrillation (AF) can be viewed as disintegrated patterns of information transmission by action potential across the communication network consisting of nodes linked by functional connectivity. To test the hypothesis that ablation of persistent AF is associated with improvement in both local and global connectivity within the communication networks, we analyzed multi-electrode basket catheter electrograms of 22 consecutive patients (63.5 ± 9.7 years, 78% male) during persistent AF before and after the focal impulse and rotor modulation-guided ablation. Eight patients (36%) developed recurrence within 6 months after ablation. We defined communication networks of AF by nodes (cardiac tissue adjacent to each electrode) and edges (mutual information between pairs of nodes). To evaluate patient-specific parameters of communication, thresholds of mutual information were applied to preserve 10% to 30% of the strongest edges. There was no significant difference in network parameters between both atria at baseline. Ablation effectively rewired the communication network of persistent AF to improve the overall connectivity. In addition, successful ablation improved local connectivity by increasing the average clustering coefficient, and also improved global connectivity by decreasing the characteristic path length. As a result, successful ablation improved the efficiency and robustness of the communication network by increasing the small-world index. These changes were not observed in patients with AF recurrence. Furthermore, a significant increase in the small-world index after ablation was associated with synchronization of the rhythm by acute AF termination. In conclusion, successful ablation rewires communication networks during persistent AF, making it more robust, efficient, and easier to synchronize. Quantitative analysis of communication networks provides not only a mechanistic insight that AF may be sustained by spatially localized sources and global connectivity, but also patient-specific metrics that could serve as a valid endpoint for therapeutic interventions.

Altered brain structural networks in attention deficit/hyperactivity disorder children revealed by cortical thickness

This study investigated the cortical thickness and topological features of human brain anatomical networks related to attention deficit/hyperactivity disorder. Data were collected from 40 attention deficit/hyperactivity disorder children and 40 normal control children. Interregional correlation matrices were established by calculating the correlations of cortical thickness between all pairs of cortical regions (68 regions) of the whole brain. Further thresholds were applied to create binary matrices to construct a series of undirected and unweighted graphs, and global, local, and nodal efficiencies were computed as a function of the network cost. These experimental results revealed abnormal cortical thickness and correlations in attention deficit/hyperactivity disorder, and showed that the brain structural networks of attention deficit/hyperactivity disorder subjects had inefficient small-world topological features. Furthermore, their topological properties were altered abnormally. In particular, decreased global efficiency combined with increased local efficiency in attention deficit/hyperactivity disorder children led to a disorder-related shift of the network topological structure toward regular networks. In addition, nodal efficiency, cortical thickness, and correlation analyses revealed that several brain regions were altered in attention deficit/hyperactivity disorder patients. These findings are in accordance with a hypothesis of dysfunctional integration and segregation of the brain in patients with attention deficit/hyperactivity disorder and provide further evidence of brain dysfunction in attention deficit/hyperactivity disorder patients by observing cortical thickness on magnetic resonance imaging.

Graph spectral characterization of the XY model on complex networks

There is recent evidence that the XY spin model on complex networks can display three different macroscopic states in response to the topology of the network underpinning the interactions of the spins. In this work we present a way to characterize the macroscopic states of the XY spin model based on the spectral decomposition of time series using topological information about the underlying networks. We use three different classes of networks to generate time series of the spins for the three possible macroscopic states. We then use the temporal Graph Signal Transform technique to decompose the time series of the spins on the eigenbasis of the Laplacian. From this decomposition, we produce spatial power spectra, which summarize the activation of structural modes by the nonlinear dynamics, and thus coherent patterns of activity of the spins. These signatures of the macroscopic states are independent of the underlying network class and can thus be used as robust signatures for the macroscopic states. This work opens avenues to analyze and characterize dynamics on complex networks using temporal Graph Signal Analysis.

Development of structural correlations and synchronization from adaptive rewiring in networks of Kuramoto oscillators

Synchronization of non-identical oscillators coupled through complex networks is an important example of collective behavior, and it is interesting to ask how the structural organization of network interactions influences this process. Several studies have explored and uncovered optimal topologies for synchronization by making purposeful alterations to a network. On the other hand, the connectivity patterns of many natural systems are often not static, but are rather modulated over time according to their dynamics. However, this co-evolution and the extent to which the dynamics of the individual units can shape the organization of the network itself are less well understood. Here, we study initially randomly connected but locally adaptive networks of Kuramoto oscillators. In particular, the system employs a co-evolutionary rewiring strategy that depends only on the instantaneous, pairwise phase differences of neighboring oscillators, and that conserves the total number of edges, allowing the effects of local reorganization to be isolated. We find that a simple rule-which preserves connections between more out-of-phase oscillators while rewiring connections between more in-phase oscillators-can cause initially disordered networks to organize into more structured topologies that support enhanced synchronization dynamics. We examine how this process unfolds over time, finding a dependence on the intrinsic frequencies of the oscillators, the global coupling, and the network density, in terms of how the adaptive mechanism reorganizes the network and influences the dynamics. Importantly, for large enough coupling and after sufficient adaptation, the resulting networks exhibit interesting characteristics, including degree-frequency and frequency-neighbor frequency correlations. These properties have previously been associated with optimal synchronization or explosive transitions in which the networks were constructed using global information. On the contrary, by considering a time-dependent interplay between structure and dynamics, this work offers a mechanism through which emergent phenomena and organization can arise in complex systems utilizing local rules.

Synchronization of fluctuating delay-coupled chaotic networks

We study the synchronization of chaotic units connected through time-delayed fluctuating interactions. Focusing on small-world networks of Bernoulli and Logistic units with a fixed chiral backbone, we compare the synchronization properties of static and fluctuating networks in the regime of large delays. We find that random network switching may enhance the stability of synchronized states. Synchronization appears to be maximally stable when fluctuations are much faster than the time-delay, whereas it disappears for very slow fluctuations. For fluctuation time scales of the order of the time-delay, we report a resynchronizing effect in finite-size networks. Moreover, we observe characteristic oscillations in all regimes, with a periodicity related to the time-delay, as the system approaches or drifts away from the synchronized state.

Synchronization of moving oscillators in three dimensional space

We investigate the macroscopic behavior of a dynamical network consisting of a time-evolving wiring of interactions among a group of random walkers. We assume that each walker (agent) has an oscillator and show that depending upon the nature of interaction, synchronization arises where each of the individual oscillators are allowed to move in such a random walk manner in a finite region of three dimensional space. Here, the vision range of each oscillator decides the number of oscillators with which it interacts. The live interaction between the oscillators is of intermediate type (i.e., not local as well as not global) and may or may not be bidirectional. We analytically derive the density dependent threshold of coupling strength for synchronization using linear stability analysis and numerically verify the obtained analytical results. Additionally, we explore the concept of basin stability, a nonlinear measure based on volumes of basin of attractions, to investigate how stable the synchronous state is under large perturbations. The synchronization phenomenon is analyzed taking limit cycle and chaotic oscillators for wide ranges of parameters like interaction strength k between the walkers, speed of movement v, and vision range r.

Optimization of synchronizability in multiplex networks by rewiring one layer

The mathematical framework of multiplex networks has been increasingly realized as a more suitable framework for modeling real-world complex systems. In this work, we investigate the optimization of synchronizability in multiplex networks by evolving only one layer while keeping other layers fixed. Our main finding is to show the conditions under which the efficiency of convergence to the most optimal structure is almost as good as the case where both layers are rewired during an optimization process. In particular, interlayer coupling strength responsible for the integration between the layers turns out to be a crucial factor governing the efficiency of optimization even for the cases when the layer going through the evolution has nodes interacting much more weakly than those in the fixed layer. Additionally, we investigate the dependency of synchronizability on the rewiring probability which governs the network structure from a regular lattice to the random networks. The efficiency of the optimization process preceding evolution driven by the optimization process is maximum when the fixed layer has regular architecture, whereas the optimized network is more synchronizable for the fixed layer having the rewiring probability lying between the small-world transition and the random structure.

Griffiths phase on hierarchical modular networks with small-world edges

The Griffiths phase has been proposed to induce a stretched critical regime that facilitates self-organizing of brain networks for optimal function. This phase stems from the intrinsic structural heterogeneity of brain networks, i.e., the hierarchical modular structure. In this work, the Griffiths phase is studied in modified hierarchical networks with small-world connections based on the 3-regular Hanoi network. Through extensive simulations, the hierarchical level-dependent inter-module wiring probabilities are identified to determine the emergence of the Griffiths phase. Numerical results and the complementary spectral analysis of the relevant networks can be helpful for a deeper understanding of the essential structural characteristics of finite-dimensional networks to support the Griffiths phase.

Quantum synchronization and quantum state sharing in an irregular complex network

We investigate the quantum synchronization phenomenon of the complex network constituted by coupled optomechanical systems and prove that the unknown identical quantum states can be shared or distributed in the quantum network even though the topology is varying. Considering a channel constructed by quantum correlation, we show that quantum synchronization can sustain and maintain high levels in Markovian dissipation for a long time. We also analyze the state-sharing process between two typical complex networks, and the results predict that linked nodes can be directly synchronized, but the whole network will be synchronized only if some specific synchronization conditions are satisfied. Furthermore, we give the synchronization conditions analytically through analyzing network dynamics. This proposal paves the way for studying multi-interaction synchronization and achieving effective quantum information processing in a complex network.

Chaotic Griffiths Phase with Anomalous Lyapunov Spectra in Coupled Map Networks

Dynamics of coupled chaotic oscillators on a network are studied using coupled maps. Within a broad range of parameter values representing the coupling strength or the degree of elements, the system repeats formation and split of coherent clusters. The distribution of the cluster size follows a power law with the exponent α, which changes with the parameter values. The number of positive Lyapunov exponents and their spectra are scaled anomalously with the power of the system size with the exponent β, which also changes with the parameters. The scaling relation α∼2(β+1) is uncovered, which is universal independent of parameters and among random networks.

Transitivity reinforcement in the coevolving voter model

One of the fundamental structural properties of many networks is triangle closure. Whereas the influence of this transitivity on a variety of contagion dynamics has been previously explored, existing models of coevolving or adaptive network systems typically use rewiring rules that randomize away this important property, raising questions about their applicability. In contrast, we study here a modified coevolving voter model dynamics that explicitly reinforces and maintains such clustering. Carrying out numerical simulations for a variety of parameter settings, we establish that the transitions and dynamical states observed in coevolving voter model networks without clustering are altered by reinforcing transitivity in the model. We then use a semi-analytical framework in terms of approximate master equations to predict the dynamical behaviors of the model for a variety of parameter settings.

Interplay of degree correlations and cluster synchronization

We study the evolution of coupled chaotic dynamics on networks and investigate the role of degree-degree correlation in the networks' cluster synchronizability. We find that an increase in the disassortativity can lead to an increase or a decrease in the cluster synchronizability depending on the degree distribution and average connectivity of the network. Networks with heterogeneous degree distribution exhibit significant changes in cluster synchronizability as well as in the phenomena behind cluster synchronization as compared to those of homogeneous networks. Interestingly, cluster synchronizability of a network may be very different from global synchronizability due to the presence of the driven phenomenon behind the cluster formation. Furthermore, we show how degeneracy at the zero eigenvalues provides an understanding of the occurrence of the driven phenomenon behind the synchronization in disassortative networks. The results demonstrate the importance of degree-degree correlations in determining cluster synchronization behavior of complex networks and hence have potential applications in understanding and predicting dynamical behavior of complex systems ranging from brain to social systems.

Trade-offs between robustness and small-world effect in complex networks

Robustness and small-world effect are two crucial structural features of complex networks and have attracted increasing attention. However, little is known about the relation between them. Here we demonstrate that, there is a conflicting relation between robustness and small-world effect for a given degree sequence. We suggest that the robustness-oriented optimization will weaken the small-world effect and vice versa. Then, we propose a multi-objective trade-off optimization model and develop a heuristic algorithm to obtain the optimal trade-off topology for robustness and small-world effect. We show that the optimal network topology exhibits a pronounced core-periphery structure and investigate the structural properties of the optimized networks in detail.

Recovery of couplings and parameters of elements in networks of time-delay systems from time series

We propose a method for the recovery of coupling architecture and the parameters of elements in networks consisting of coupled oscillators described by delay-differential equations. For each oscillator in the network, we introduce an objective function characterizing the distance between the points of the reconstructed nonlinear function. The proposed method is based on the minimization of this objective function and the separation of the recovered coupling coefficients into significant and insignificant coefficients. The efficiency of the method is shown for chaotic time series generated by model equations of diffusively coupled time-delay systems and for experimental chaotic time series gained from coupled electronic oscillators with time-delayed feedback.

Synchronization in networks with multiple interaction layers

The structure of many real-world systems is best captured by networks consisting of several interaction layers. Understanding how a multilayered structure of connections affects the synchronization properties of dynamical systems evolving on top of it is a highly relevant endeavor in mathematics and physics and has potential applications in several socially relevant topics, such as power grid engineering and neural dynamics. We propose a general framework to assess the stability of the synchronized state in networks with multiple interaction layers, deriving a necessary condition that generalizes the master stability function approach. We validate our method by applying it to a network of Rössler oscillators with a double layer of interactions and show that highly rich phenomenology emerges from this. This includes cases where the stability of synchronization can be induced even if both layers would have individually induced unstable synchrony, an effect genuinely arising from the true multilayer structure of the interactions among the units in the network.

Hodge Decomposition of Information Flow on Small-World Networks

We investigate the influence of the small-world topology on the composition of information flow on networks. By appealing to the combinatorial Hodge theory, we decompose information flow generated by random threshold networks on the Watts-Strogatz model into three components: gradient, harmonic and curl flows. The harmonic and curl flows represent globally circular and locally circular components, respectively. The Watts-Strogatz model bridges the two extreme network topologies, a lattice network and a random network, by a single parameter that is the probability of random rewiring. The small-world topology is realized within a certain range between them. By numerical simulation we found that as networks become more random the ratio of harmonic flow to the total magnitude of information flow increases whereas the ratio of curl flow decreases. Furthermore, both quantities are significantly enhanced from the level when only network structure is considered for the network close to a random network and a lattice network, respectively. Finally, the sum of these two ratios takes its maximum value within the small-world region. These findings suggest that the dynamical information counterpart of global integration and that of local segregation are the harmonic flow and the curl flow, respectively, and that a part of the small-world region is dominated by internal circulation of information flow.

Small-World Brain Networks Revisited

It is nearly 20 years since the concept of a small-world network was first quantitatively defined, by a combination of high clustering and short path length; and about 10 years since this metric of complex network topology began to be widely applied to analysis of neuroimaging and other neuroscience data as part of the rapid growth of the new field of connectomics. Here, we review briefly the foundational concepts of graph theoretical estimation and generation of small-world networks. We take stock of some of the key developments in the field in the past decade and we consider in some detail the implications of recent studies using high-resolution tract-tracing methods to map the anatomical networks of the macaque and the mouse. In doing so, we draw attention to the important methodological distinction between topological analysis of binary or unweighted graphs, which have provided a popular but simple approach to brain network analysis in the past, and the topology of weighted graphs, which retain more biologically relevant information and are more appropriate to the increasingly sophisticated data on brain connectivity emerging from contemporary tract-tracing and other imaging studies. We conclude by highlighting some possible future trends in the further development of weighted small-worldness as part of a deeper and broader understanding of the topology and the functional value of the strong and weak links between areas of mammalian cortex.

Virtual Cortical Resection Reveals Push-Pull Network Control Preceding Seizure Evolution

In ∼20 million people with drug-resistant epilepsy, focal seizures originating in dysfunctional brain networks will often evolve and spread to surrounding tissue, disrupting function in otherwise normal brain regions. To identify network control mechanisms that regulate seizure spread, we developed a novel tool for pinpointing brain regions that facilitate synchronization in the epileptic network. Our method measures the impact of virtually resecting putative control regions on synchronization in a validated model of the human epileptic network. By applying our technique to time-varying functional networks, we identified brain regions whose topological role is to synchronize or desynchronize the epileptic network. Our results suggest that greater antagonistic push-pull interaction between synchronizing and desynchronizing brain regions better constrains seizure spread. These methods, while applied here to epilepsy, are generalizable to other brain networks and have wide applicability in isolating and mapping functional drivers of brain dynamics in health and disease.

Synchronization of mobile chaotic oscillator networks

We study synchronization of systems in which agents holding chaotic oscillators move in a two-dimensional plane and interact with nearby ones forming a time dependent network. Due to the uncertainty in observing other agents' states, we assume that the interaction contains a certain amount of noise that turns out to be relevant for chaotic dynamics. We find that a synchronization transition takes place by changing a control parameter. But this transition depends on the relative dynamic scale of motion and interaction. When the topology change is slow, we observe an intermittent switching between laminar and burst states close to the transition due to small noise. This novel type of synchronization transition and intermittency can happen even when complete synchronization is linearly stable in the absence of noise. We show that the linear stability of the synchronized state is not a sufficient condition for its stability due to strong fluctuations of the transverse Lyapunov exponent associated with a slow network topology change. Since this effect can be observed within the linearized dynamics, we can expect such an effect in the temporal networks with noisy chaotic oscillators, irrespective of the details of the oscillator dynamics. When the topology change is fast, a linearized approximation describes well the dynamics towards synchrony. These results imply that the fluctuations of the finite-time transverse Lyapunov exponent should also be taken into account to estimate synchronization of the mobile contact networks.

Graph partitions and cluster synchronization in networks of oscillators

Synchronization over networks depends strongly on the structure of the coupling between the oscillators. When the coupling presents certain regularities, the dynamics can be coarse-grained into clusters by means of External Equitable Partitions of the network graph and their associated quotient graphs. We exploit this graph-theoretical concept to study the phenomenon of cluster synchronization, in which different groups of nodes converge to distinct behaviors. We derive conditions and properties of networks in which such clustered behavior emerges and show that the ensuing dynamics is the result of the localization of the eigenvectors of the associated graph Laplacians linked to the existence of invariant subspaces. The framework is applied to both linear and non-linear models, first for the standard case of networks with positive edges, before being generalized to the case of signed networks with both positive and negative interactions. We illustrate our results with examples of both signed and unsigned graphs for consensus dynamics and for partial synchronization of oscillator networks under the master stability function as well as Kuramoto oscillators.

Tweaking synchronization by connectivity modifications

Natural and man-made networks often possess locally treelike substructures. Taking such tree networks as our starting point, we show how the addition of links changes the synchronization properties of the network. We focus on two different methods of link addition. The first method adds single links that create cycles of a well-defined length. Following a topological approach, we introduce cycles of varying length and analyze how this feature, as well as the position in the network, alters the synchronous behavior. We show that in particular short cycles can lead to a maximum change of the Laplacian's eigenvalue spectrum, dictating the synchronization properties of such networks. The second method connects a certain proportion of the initially unconnected nodes. We simulate dynamical systems on these network topologies, with the nodes' local dynamics being either discrete or continuous. Here our main result is that a certain number of additional links, with the relative position in the network being crucial, can be beneficial to ensure stable synchronization.

The role of dimensionality in neuronal network dynamics

Recent results from network theory show that complexity affects several dynamical properties of networks that favor synchronization. Here we show that synchronization in 2D and 3D neuronal networks is significantly different. Using dissociated hippocampal neurons we compared properties of cultures grown on a flat 2D substrates with those formed on 3D graphene foam scaffolds. Both 2D and 3D cultures had comparable glia to neuron ratio and the percentage of GABAergic inhibitory neurons. 3D cultures because of their dimension have many connections among distant neurons leading to small-world networks and their characteristic dynamics. After one week, calcium imaging revealed moderately synchronous activity in 2D networks, but the degree of synchrony of 3D networks was higher and had two regimes: a highly synchronized (HS) and a moderately synchronized (MS) regime. The HS regime was never observed in 2D networks. During the MS regime, neuronal assemblies in synchrony changed with time as observed in mammalian brains. After two weeks, the degree of synchrony in 3D networks decreased, as observed in vivo. These results show that dimensionality determines properties of neuronal networks and that several features of brain dynamics are a consequence of its 3D topology.

Concurrent enhancement of percolation and synchronization in adaptive networks

Co-evolutionary adaptive mechanisms are not only ubiquitous in nature, but also beneficial for the functioning of a variety of systems. We here consider an adaptive network of oscillators with a stochastic, fitness-based, rule of connectivity, and show that it self-organizes from fragmented and incoherent states to connected and synchronized ones. The synchronization and percolation are associated to abrupt transitions, and they are concurrently (and significantly) enhanced as compared to the non-adaptive case. Finally we provide evidence that only partial adaptation is sufficient to determine these enhancements. Our study, therefore, indicates that inclusion of simple adaptive mechanisms can efficiently describe some emergent features of networked systems’ collective behaviors, and suggests also self-organized ways to control synchronization and percolation in natural and social systems.

Quantization Effects on Complex Networks

Weights of edges in many complex networks we constructed are quantized values of the real weights. To what extent does the quantization affect the properties of a network? In this work, quantization effects on network properties are investigated based on the spectrum of the corresponding Laplacian. In contrast to the intuition that larger quantization level always implies a better approximation of the quantized network to the original one, we find a ubiquitous periodic jumping phenomenon with peak-value decreasing in a power-law relationship in all the real-world weighted networks that we investigated. We supply theoretical analysis on the critical quantization level and the power laws.

Effects of distance-dependent delay on small-world neuronal networks

We study firing behaviors and the transitions among them in small-world noisy neuronal networks with electrical synapses and information transmission delay. Each neuron is modeled by a two-dimensional Rulkov map neuron. The distance between neurons, which is a main source of the time delay, is taken into consideration. Through spatiotemporal patterns and interspike intervals as well as the interburst intervals, the collective behaviors are revealed. It is found that the networks switch from resting state into intermittent firing state under Gaussian noise excitation. Initially, noise-induced firing behaviors are disturbed by small time delays. Periodic firing behaviors with irregular zigzag patterns emerge with an increase of the delay and become progressively regular after a critical value is exceeded. More interestingly, in accordance with regular patterns, the spiking frequency doubles compared with the former stage for the spiking neuronal network. A growth of frequency persists for a larger delay and a transition to antiphase synchronization is observed. Furthermore, it is proved that these transitions are generic also for the bursting neuronal network and the FitzHugh-Nagumo neuronal network. We show these transitions due to the increase of time delay are robust to the noise strength, coupling strength, network size, and rewiring probability.

Growth, collapse, and self-organized criticality in complex networks

Network growth is ubiquitous in nature (e.g., biological networks) and technological systems (e.g., modern infrastructures). To understand how certain dynamical behaviors can or cannot persist as the underlying network grows is a problem of increasing importance in complex dynamical systems as well as sustainability science and engineering. We address the question of whether a complex network of nonlinear oscillators can maintain its synchronization stability as it expands. We find that a large scale avalanche over the entire network can be triggered in the sense that the individual nodal dynamics diverges from the synchronous state in a cascading manner within a relatively short time period. In particular, after an initial stage of linear growth, the network typically evolves into a critical state where the addition of a single new node can cause a group of nodes to lose synchronization, leading to synchronization collapse for the entire network. A statistical analysis reveals that the collapse size is approximately algebraically distributed, indicating the emergence of self-organized criticality. We demonstrate the generality of the phenomenon of synchronization collapse using a variety of complex network models, and uncover the underlying dynamical mechanism through an eigenvector analysis.

Limitations and tradeoffs in synchronization of large-scale networks with uncertain links

The synchronization of nonlinear systems connected over large-scale networks has gained popularity in a variety of applications, such as power grids, sensor networks, and biology. Stochastic uncertainty in the interconnections is a ubiquitous phenomenon observed in these physical and biological networks. We provide a size-independent network sufficient condition for the synchronization of scalar nonlinear systems with stochastic linear interactions over large-scale networks. This sufficient condition, expressed in terms of nonlinear dynamics, the Laplacian eigenvalues of the nominal interconnections, and the variance and location of the stochastic uncertainty, allows us to define a synchronization margin. We provide an analytical characterization of important trade-offs between the internal nonlinear dynamics, network topology, and uncertainty in synchronization. For nearest neighbour networks, the existence of an optimal number of neighbours with a maximum synchronization margin is demonstrated. An analytical formula for the optimal gain that produces the maximum synchronization margin allows us to compare the synchronization properties of various complex network topologies.

Network-scale effect on synchronizability of fully coupled network with connection delay

Network-scale effect on synchronizability of fully coupled network with connection delay is investigated in this paper. The master stability function, which governs the stability of synchronization manifold, is first obtained by separating the synchronization manifold direction from other transverse directions. Then, by introducing a new time variable in the master stability function, it is shown the effect of connection delay can be weakened with the increase of network scale, and thus, in contrast to the situation without connection delay, large network scale is more positive to the synchronizability of fully coupled network with connection delay. Those findings are confirmed by the studies on two specific networks with nodes of typical nonlinear dynamical systems.

Controlling synchronous patterns in complex networks

Although the set of permutation symmetries of a complex network could be very large, few of them give rise to stable synchronous patterns. Here we present a general framework and develop techniques for controlling synchronization patterns in complex network of coupled chaotic oscillators. Specifically, according to the network permutation symmetry, we design a small-size and weighted network, namely the control network, and use it to control the large-size complex network by means of pinning coupling. We argue mathematically that for any of the network symmetries, there always exists a critical pinning strength beyond which the unstable synchronous pattern associated to this symmetry can be stabilized. The feasibility of the control method is verified by numerical simulations of both artificial and real-world networks and demonstrated experimentally in systems of coupled chaotic circuits. Our studies show the controllability of synchronous patterns in complex networks of coupled chaotic oscillators.

SYNCHRONIZATION OF HETEROGENEOUS OSCILLATORS UNDER NETWORK MODIFICATIONS: PERTURBATION AND OPTIMIZATION OF THE SYNCHRONY ALIGNMENT FUNCTION

Synchronization is central to many complex systems in engineering physics (e.g., the power-grid, Josephson junction circuits, and electro-chemical oscillators) and biology (e.g., neuronal, circadian, and cardiac rhythms). Despite these widespread applications-for which proper functionality depends sensitively on the extent of synchronization-there remains a lack of understanding for how systems can best evolve and adapt to enhance or inhibit synchronization. We study how network modifications affect the synchronization properties of network-coupled dynamical systems that have heterogeneous node dynamics (e.g., phase oscillators with non-identical frequencies), which is often the case for real-world systems. Our approach relies on a synchrony alignment function (SAF) that quantifies the interplay between heterogeneity of the network and of the oscillators and provides an objective measure for a system's ability to synchronize. We conduct a spectral perturbation analysis of the SAF for structural network modifications including the addition and removal of edges, which subsequently ranks the edges according to their importance to synchronization. Based on this analysis, we develop gradient-descent algorithms to efficiently solve optimization problems that aim to maximize phase synchronization via network modifications. We support these and other results with numerical experiments.

Approximating frustration scores in complex networks via perturbed Laplacian spectra

Systems of many interacting components, as found in physics, biology, infrastructure, and the social sciences, are often modeled by simple networks of nodes and edges. The real-world systems frequently confront outside intervention or internal damage whose impact must be predicted or minimized, and such perturbations are then mimicked in the models by altering nodes or edges. This leads to the broad issue of how to best quantify changes in a model network after some type of perturbation. In the case of node removal there are many centrality metrics which associate a scalar quantity with the removed node, but it can be difficult to associate the quantities with some intuitive aspect of physical behavior in the network. This presents a serious hurdle to the application of network theory: real-world utility networks are rarely altered according to theoretic principles unless the kinetic impact on the network's users are fully appreciated beforehand. In pursuit of a kinetically interpretable centrality score, we discuss the f-score, or frustration score. Each f-score quantifies whether a selected node accelerates or inhibits global mean first passage times to a second, independently selected target node. We show that this is a natural way of revealing the dynamical importance of a node in some networks. After discussing merits of the f-score metric, we combine spectral and Laplacian matrix theory in order to quickly approximate the exact f-score values, which can otherwise be expensive to compute. Following tests on both synthetic and real medium-sized networks, we report f-score runtime improvements over exact brute force approaches in the range of 0 to 400% with low error (<3%).