Mathematical problems for complex networks

Copyright @ 2012 Zidong Wang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. This article is made available through the Brunel Open Access Publishing Fund.Complex networks do exist in our lives. The brain is a neural network. The global economy is a network of national economies. Computer viruses routinely spread through the Internet. Food-webs, ecosystems, and metabolic pathways can be represented by networks. Energy is distributed through transportation networks in living organisms, man-made infrastructures, and other physical systems. Dynamic behaviors of complex networks, such as stability, periodic oscillation, bifurcation, or even chaos, are ubiquitous in the real world and often reconfigurable. Networks have been studied in the context of dynamical systems in a range of disciplines. However, until recently there has been relatively little work that treats dynamics as a function of network structure, where the states of both the nodes and the edges can change, and the topology of the network itself often evolves in time. Some major problems have not been fully investigated, such as the behavior of stability, synchronization and chaos control for complex networks, as well as their applications in, for example, communication and bioinformatics

Complex partial synchronization patterns in networks of delay-coupled neurons

We study the spatio-temporal dynamics of a multiplex network of delay-coupled FitzHugh–Nagumo oscillators with non-local and fractal connectivities. Apart from chimera states, a new regime of coexistence of slow and fast oscillations is found. An analytical explanation for the emergence of such coexisting partial synchronization patterns is given. Furthermore, we propose a control scheme for the number of fast and slow neurons in each layer.DFG, 163436311, SFB 910: Kontrolle selbstorganisierender nichtlinearer Systeme: Theoretische Methoden und Anwendungskonzept

Interregional synchrony of visuomotor tracking: perturbation effects and individual differences

The present study evaluated the neural and behavioural correlates associated with a visuomotor tracking task during which a sensory perturbation was introduced that created a directional bias between moving hand and cursor position. The results revealed that trajectory error increased as a result of the perturbation in conjunction with a dynamic neural reorganization of cluster patterns that reflected distinct processing. In particular, a negatively activated cluster, characterizing the degraded information processing due to the perturbation, involved both hemispheres as well as midline area. Conversely, a positively activated cluster, indicative of compensatory processing was strongly confined to the left (dominant) hemisphere. In addition, a brain-behavioural association of good vs. poor performing participants enabled to localize a neural circuit within the left hemisphere and midline area that linked with successful performance. Overall, these data reinforce the functional significance of interregional synchrony in defining response output and behavioural success

Community structure in real-world networks from a non-parametrical synchronization-based dynamical approach

This work analyzes the problem of community structure in real-world networks based on the synchronization of nonidentical coupled chaotic R\"{o}ssler oscillators each one characterized by a defined natural frequency, and coupled according to a predefined network topology. The interaction scheme contemplates an uniformly increasing coupling force to simulate a society in which the association between the agents grows in time. To enhance the stability of the correlated states that could emerge from the synchronization process, we propose a parameterless mechanism that adapts the characteristic frequencies of coupled oscillators according to a dynamic connectivity matrix deduced from correlated data. We show that the characteristic frequency vector that results from the adaptation mechanism reveals the underlying community structure present in the network.Comment: 21 pages, 7 figures; Chaos, Solitons & Fractals (2012

Synchronization and state estimation for discrete-time complex networks with distributed delays

Copyright [2008] IEEE. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Brunel University's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.In this paper, a synchronization problem is investigated for an array of coupled complex discrete-time networks with the simultaneous presence of both the discrete and distributed time delays. The complex networks addressed which include neural and social networks as special cases are quite general. Rather than the commonly used Lipschitz-type function, a more general sector-like nonlinear function is employed to describe the nonlinearities existing in the network. The distributed infinite time delays in the discrete-time domain are first defined. By utilizing a novel Lyapunov-Krasovskii functional and the Kronecker product, it is shown that the addressed discrete-time complex network with distributed delays is synchronized if certain linear matrix inequalities (LMIs) are feasible. The state estimation problem is then studied for the same complex network, where the purpose is to design a state estimator to estimate the network states through available output measurements such that, for all admissible discrete and distributed delays, the dynamics of the estimation error is guaranteed to be globally asymptotically stable. Again, an LMI approach is developed for the state estimation problem. Two simulation examples are provided to show the usefulness of the proposed global synchronization and state estimation conditions. It is worth pointing out that our main results are valid even if the nominal subsystems within the network are unstable

Heterogeneity induces emergent functional networks for synchronization

We study the evolution of heterogeneous networks of oscillators subject to a state-dependent interconnection rule. We find that heterogeneity in the node dynamics is key in organizing the architecture of the functional emerging networks. We demonstrate that increasing heterogeneity among the nodes in state-dependent networks of phase oscillators causes a differentiation in the activation probabilities of the links. This, in turn, yields the formation of hubs associated to nodes with larger distances from the average frequency of the ensemble. Our generic local evolutionary strategy can be used to solve a wide range of synchronization and control problems

Collective stability of networks of winner-take-all circuits

The neocortex has a remarkably uniform neuronal organization, suggesting that common principles of processing are employed throughout its extent. In particular, the patterns of connectivity observed in the superficial layers of the visual cortex are consistent with the recurrent excitation and inhibitory feedback required for cooperative-competitive circuits such as the soft winner-take-all (WTA). WTA circuits offer interesting computational properties such as selective amplification, signal restoration, and decision making. But, these properties depend on the signal gain derived from positive feedback, and so there is a critical trade-off between providing feedback strong enough to support the sophisticated computations, while maintaining overall circuit stability. We consider the question of how to reason about stability in very large distributed networks of such circuits. We approach this problem by approximating the regular cortical architecture as many interconnected cooperative-competitive modules. We demonstrate that by properly understanding the behavior of this small computational module, one can reason over the stability and convergence of very large networks composed of these modules. We obtain parameter ranges in which the WTA circuit operates in a high-gain regime, is stable, and can be aggregated arbitrarily to form large stable networks. We use nonlinear Contraction Theory to establish conditions for stability in the fully nonlinear case, and verify these solutions using numerical simulations. The derived bounds allow modes of operation in which the WTA network is multi-stable and exhibits state-dependent persistent activities. Our approach is sufficiently general to reason systematically about the stability of any network, biological or technological, composed of networks of small modules that express competition through shared inhibition.Comment: 7 Figure