On the topology of synchrony optimized networks of a Kuramoto-model with non-identical oscillators

We study synchrony optimized networks. In particular, we focus on the Kuramoto model with non-identical native frequencies on a random graph. In a first step, we generate synchrony optimized networks using a dynamic breeding algorithm, whereby an initial network is successively rewired toward increased synchronization. These networks are characterized by a large anti-correlation between neighbouring frequencies. In a second step, the central part of our paper, we show that synchrony optimized networks can be generated much more cost efficiently by minimization of an energy-like quantity E and subsequent random rewires to control the average path length. We demonstrate that synchrony optimized networks are characterized by a balance between two opposing structural properties: A large number of links between positive and negative frequencies of equal magnitude and a small average path length. Remarkably, these networks show the same synchronization behaviour as those networks generated by the dynamic rewiring process. Interestingly, synchrony-optimized network also exhibit significantly enhanced synchronization behaviour for weak coupling, below the onset of global synchronization, with linear growth of the order parameter with increasing coupling strength. We identify the underlying dynamical and topological structures, which give rise to this atypical local synchronization, and provide a simple analytical argument for its explanation.     

Synchronization from disordered driving forces in arrays of coupled oscillators

The effects of disorder in external forces on the dynamical behavior of coupled nonlinear oscillator networks are studied. When driven synchronously, i.e., all driving forces have the same phase, the networks display chaotic dynamics. We show that random phases in the driving forces result in regular, periodic network behavior. Intermediate phase disorder can produce network synchrony. Specifically, there is an optimal amount of phase disorder, which can induce the highest level of synchrony. These results demonstrate that the spatiotemporal structure of external influences can control chaos and lead to synchronization in nonlinear systems.     

最优的Newman-Watts网络与遍历网络的同步

在Hindmarsh-Rose神经元动力系统中研究了Newman-Watts （NW）网络的同步,给出了一些最优同步网络的拓扑结构. 数值结果表明：NW网络的同步能力主要由耦合点在耦合空间的分布决定,耦合点分布均匀的NW网络一般具有较强的同步能力;在给定连边数的情况下,可能存在多个结构不同的最优同步网络,最优同步网络具有最强的同步能力、均匀的度分布和较好的对称性,但是其对称性不一定是最好的. 最优同步网络一般是非规则网络,但在少数情况下,规则网络也有可能是最优同步网络. 提出了一种新的网络——遍历网络,该网络具有最优同步网络的特点和很强的同步能力. 关键词： Newman-Watts网络 对称度 耦合空间 同步     

Synchronization in an array of coupled Boolean networks

This Letter presents an analytical study of synchronization in an array of coupled deterministic Boolean networks. A necessary and sufficient criterion for synchronization is established based on algebraic representations of logical dynamics in terms of the semi-tensor product of matrices. Some basic properties of a synchronized array of Boolean networks are then derived for the existence of transient states and the upper bound of the number of fixed points. Particularly, an interesting consequence indicates that a “large” mismatch between two coupled Boolean networks in the array may result in loss of synchrony in the entire system. Examples, including the Boolean model of coupled oscillations in the cell cycle, are given to illustrate the present results.     

Robust projective outer synchronization of coupled uncertain fractional-order complex networks

In this work, we propose a novel projective outer synchronization (POS) between unidirectionally coupled uncertain fractional-order complex networks through scalar transmitted signals. Based on the state observer theory, a control law is designed and some criteria are given in terms of linear matrix inequalities which guarantee global robust POS between such networks. Interestingly, in the POS regime, we show that different choices of scaling factor give rise to different outer synchrony, with various special cases including complete outer synchrony, anti-outer synchrony and even a state of amplitude death. Furthermore, it is demonstrated that although stability of POS is irrelevant to the inner-coupling strength, it will affect the convergence speed of POS. In particular, stronger inner synchronization can induce faster POS. The effectiveness of our method is revealed by numerical simulations on fractional-order complex networks with small-world communication topology.     

Synchronization of bursting neurons: what matters in the network topology

We study the influence of coupling strength and network topology on synchronization behavior in pulse-coupled networks of bursting Hindmarsh-Rose neurons. Surprisingly, we find that the stability of the completely synchronous state in such networks only depends on the number of signals each neuron receives, independent of all other details of the network topology. This is in contrast with linearly coupled bursting neurons where complete synchrony strongly depends on the network structure and number of cells. Through analysis and numerics, we show that the onset of synchrony in a network with any coupling topology admitting complete synchronization is ensured by one single condition.     

Modularity density of network community divisions

The problem of dividing a network into communities is extremely complex and grows very rapidly with the number of nodes and edges that are involved. In order to develop good algorithms to identify optimal community divisions it is extremely beneficial to identify properties that are similar for most networks. We introduce the concept of modularity density, the distribution of modularity values as a function of the number of communities, and find strong indications that the general features of this modularity density are quite similar for different networks. The region of high modularity generally has very low probability density and occurs where the number of communities is small. The properties and shape of the modularity density may give valuable information and aid in the search for efficient algorithms to find community divisions with high modularities.     

Implications of heterogeneous inputs and connectivity on the synchronization in excitable networks

We study the combined implications of connectivity and heterogeneous inputs on the synchronization features of a one-dimensional chain of diffusively coupled FitzHugh Nagumo (FHN) systems. The uncoupled systems are triggered into a regime of chaotic firing by periodic parametric forces modeling external stimuli. Due to the parameter dispersion involved in randomly distributed amplitudes and/or phases of the forces the units are nonidentical and the firing events on the chain of uncoupled units will be asynchronous leading to a distribution of the spiking times. Interest is focused on mutually synchronized spikings arising through the coupling where the connectivity of the network may range from nearest-neighbor interaction to global interactions. From our studies we conclude that increasing the interaction radius does not necessarily entail better spike synchrony and the coupling strength plays a more important role than connectivity. It is found that for driving with random amplitudes together with random phases a critical interaction radius exists beyond which firing becomes suppressed if the coupling between the units is too strong. In such cases of ‘firing death’ the units perform only small-amplitude oscillations which are mutually synchronous. The optimal coupling for spike synchrony is of intermediate strength and altering the connectivity does not really matter for the degree of spike synchrony. Distinct to that, when all the phases are equal and only the amplitudes of the forces are randomly distributed enhanced spike synchrony is achieved for sufficiently strong coupling regardless of the interaction radius.     

From complete to modulated synchrony in networks of identical Hindmarsh-Rose neurons

In most cases tendency to synchrony in networks of oscillatory units increases with the coupling strength. Using the popular Hindmarsh-Rose neuronal model, we demonstrate that even for identical neurons and simple coupling the dynamics can be more complicated. Our numerical analysis for globally coupled systems and oscillator lattices reveals a new scenario of synchrony breaking with the increase of coupling, resulting in a quasiperiodic, modulated synchronous state.     

Characterization of synchrony with applications to epileptic brain signals

Measurement of synchrony in networks of complex or high-dimensional, nonstationary, and noisy systems such as the mammalian brain is technically difficult. We present a general method to analyze synchrony from multichannel time series. The idea is to calculate the phase-synchronization times and to construct a matrix. We develop a random-matrix-based criterion for proper choosing of the diagonal matrix elements. Monitoring of the eigenvalues and the determinant provides an effective way to assess changes in synchrony. The method is tested using a prototype nonstationary dynamical system, electroencephalogram (scalp) data from absence seizures for which enhanced synchrony is presumed, and electrocorticogram (intracranial) data from subjects having partial seizures with secondary generalization.     

Scaling, Optimality, and Landscape Evolution

A nonlinear model is studied which describes the evolution of a landscape under the effects of erosion and regeneration by geologic uplift by mean of a simple differential equation. The equation, already in wide use among geomorphologists and in that context obtained phenomenologically, is here derived by reparametrization invariance arguments and exactly solved in dimension d=1. Results of numerical simulations in d=2 show that the model is able to reproduce the critical scaling characterizing landscapes associated with natural river basins. We show that configurations minimizing the rate of energy dissipation (optimal channel networks) are stationary solutions of the equation describing the landscape evolution. Numerical simulations show that a careful annealing of the equation in the presence of additive noise leads to configurations very close to the global minimum of the dissipated energy, characterized by mean field exponents. We further show that if one considers generalized river network configurations in which splitting of the flow (i.e., braiding) and loops are allowed, the minimization of the dissipated energy results in spanning loopless configurations, under the constraints imposed by the continuity equations. This is stated in the form of a general theorem applicable to generic networks, suggesting that other branching structures occurring in nature may possibly arise as optimal structures minimizing a cost function.     

Enhancement of neural synchrony by time delay

In a network of neuronal oscillators with time-delayed coupling, we uncover a phenomenon of enhancement of neural synchrony by time delay: a stable synchronized state exists at low coupling strengths for significant time delays. By formulating a master stability equation for time-delayed networks of Hindmarsh-Rose neurons, we show that there is always an extended region of stable synchronous activity corresponding to low coupling strengths. Such synchrony could be achieved in the undelayed system only by much higher coupling strengths. This phenomenon of enhanced neural synchrony by delay has important implications, in particular, in understanding synchronization of distant neurons and information processing in the brain.     

Finding community structures in complex networks using mixed integer optimisation

The detection of community structure has been used to reveal the relationships between individual objects and their groupings in networks. This paper presents a mathematical programming approach to identify the optimal community structures in complex networks based on the maximisation of a network modularity metric for partitioning a network into modules. The overall problem is formulated as a mixed integer quadratic programming (MIQP) model, which can then be solved to global optimality using standard optimisation software. The solution procedure is further enhanced by developing special symmetry-breaking constraints to eliminate equivalent solutions. It is shown that additional features such as minimum/maximum module size and balancing among modules can easily be incorporated in the model. The applicability of the proposed optimisation-based approach is demonstrated by four examples. Comparative results with other approaches from the literature show that the proposed methodology has superior performance while global optimum is guaranteed.     

Interaction stochasticity may hinder cooperation in the spatial public goods game

We propose an analytic model to explore the effect of interaction stochasticity on the evolution of cooperation in spatial public goods game. The results show that whether cooperation can dominate in populations crucially depends on the player's probability of opting-out. Stochastic opting-out enhances cooperation as long as the probability of opting-out is less than a threshold depending on the graph's degree. Otherwise the promoting effect of spatial structures on cooperation is hindered even neutralized by stochastic opting-out. Moreover, there exists an intermediate optimal probability with which the advantage of cooperation over defection is maximized in the evolutionary race. Interestingly, the optimal probability is related to the percolation threshold of the underlying graph. Our findings illustrate that spatial structures may not facilitate cooperation when stochastic opting-out is allowed, and provide a link between physics and social sciences.     

Randomness Effect on Cooperation in Memory-Based Snowdrift Game

A memory-based snowdrift game (MBSG) on spatial small-world networks is investigated. It is found that cooperation rate versus temptation shows some step structures on small-world networks, similar to the case on regular lattices. With the increment of rewiring probability based on four-neighbourregular lattices, more steps are observable. Interestingly, it is observed that cooperation rate peaks at a specific value of temptation, which indicates that properly encouraging selfish actions may lead to better cooperative behaviours in the MBSG on small-world networks. Memory effects are also discussed for different rewiring probabilities. Furthermore, optimal regions arefound in the parameter planes. The strategy-related average degrees of individuals are helpful to understand the obtained results.     

Optimal Population Coding for Dynamic Input by Nonequilibrium Networks

The efficient coding hypothesis states that neural response should maximize its information about the external input. Theoretical studies focus on optimal response in single neuron and population code in networks with weak pairwise interactions. However, more biological settings with asymmetric connectivity and the encoding for dynamical stimuli have not been well-characterized. Here, we study the collective response in a kinetic Ising model that encodes the dynamic input. We apply gradient-based method and mean-field approximation to reconstruct networks given the neural code that encodes dynamic input patterns. We measure network asymmetry, decoding performance, and entropy production from networks that generate optimal population code. We analyze how stimulus correlation, time scale, and reliability of the network affect optimal encoding networks. Specifically, we find network dynamics altered by statistics of the dynamic input, identify stimulus encoding strategies, and show optimal effective temperature in the asymmetric networks. We further discuss how this approach connects to the Bayesian framework and continuous recurrent neural networks. Together, these results bridge concepts of nonequilibrium physics with the analyses of dynamics and coding in networks.     

Detecting the optimal number of communities in complex networks

To obtain the optimal number of communities is an important problem in detecting community structures. In this paper, we use the extended measurement of community detecting algorithms to find the optimal community number. Based on the normalized mutual information index, which has been used as a measure for similarity of communities, a statistic Ω(c) is proposed to detect the optimal number of communities. In general, when Ω(c) reaches its local maximum, especially the first one, the corresponding number of communities c is likely to be optimal in community detection. Moreover, the statistic Ω(c) can also measure the significance of community structures in complex networks, which has been paid more attention recently. Numerical and empirical results show that the index Ω(c) is effective in both artificial and real world networks.     

Cross-approximate entropy of cortical local field potentials quantifies effects of anesthesia - a pilot study in rats

Background

Anesthetics dose-dependently shift electroencephalographic (EEG) activity towards high-amplitude, slow rhythms, indicative of a synchronization of neuronal activity in thalamocortical networks. Additionally, they uncouple brain areas in higher (gamma) frequency ranges possibly underlying conscious perception. It is currently thought that both effects may impair brain function by impeding proper information exchange between cortical areas. But what happens at the local network level? Local networks with strong excitatory interconnections may be more resilient towards global changes in brain rhythms, but depend heavily on locally projecting, inhibitory interneurons. As anesthetics bias cortical networks towards inhibition, we hypothesized that they may cause excessive synchrony and compromise information processing already on a small spatial scale. Using a recently introduced measure of signal independence, cross-approximate entropy (XApEn), we investigated to what degree anesthetics synchronized local cortical network activity. We recorded local field potentials (LFP) from the somatosensory cortex of three rats chronically implanted with multielectrode arrays and compared activity patterns under control (awake state) with those at increasing concentrations of isoflurane, enflurane and halothane.

Results

Cortical LFP signals were more synchronous, as expressed by XApEn, in the presence of anesthetics. Specifically, XApEn was a monotonously declining function of anesthetic concentration. Isoflurane and enflurane were indistinguishable; at a concentration of 1 MAC (the minimum alveolar concentration required to suppress movement in response to noxious stimuli in 50% of subjects) both volatile agents reduced XApEn by about 70%, whereas halothane was less potent (50% reduction).

Conclusions

The results suggest that anesthetics strongly diminish the independence of operation of local cortical neuronal populations, and that the quantification of these effects in terms of XApEn has a similar discriminatory power as changes of spontaneous action potential rates. Thus, XApEn of field potentials recorded from local cortical networks provides valuable information on the anesthetic state of the brain.

     

Chimeras in a network of three oscillator populations with varying network topology

We study a network of three populations of coupled phase oscillators with identical frequencies. The populations interact nonlocally, in the sense that all oscillators are coupled to one another, but more weakly to those in neighboring populations than to those in their own population. Using this system as a model system, we discuss for the first time the influence of network topology on the existence of so-called chimera states. In this context, the network with three populations represents an interesting case because the populations may either be connected as a triangle, or as a chain, thereby representing the simplest discrete network of either a ring or a line segment of oscillator populations. We introduce a special parameter that allows us to study the effect of breaking the triangular network structure, and to vary the network symmetry continuously such that it becomes more and more chain-like. By showing that chimera states only exist for a bounded set of parameter values, we demonstrate that their existence depends strongly on the underlying network structures, and conclude that chimeras exist on networks with a chain-like character.     

Social power and opinion formation in complex networks

In this paper we investigate the effects of social power on the evolution of opinions in model networks as well as in a number of real social networks. A continuous opinion formation model is considered and the analysis is performed through numerical simulation. Social power is given to a proportion of agents selected either randomly or based on their degrees. As artificial network structures, we consider scale-free networks constructed through preferential attachment and Watts–Strogatz networks. Numerical simulations show that scale-free networks with degree-based social power on the hub nodes have an optimal case where the largest number of the nodes reaches a consensus. However, given power to a random selection of nodes could not improve consensus properties. Introducing social power in Watts–Strogatz networks could not significantly change the consensus profile.