Searcharxiv⌕ Search

arXiv subjects

Francesco Sorrentino

Publications and source records attributed to Francesco Sorrentino.

At least 73 records · Page 4Linked to original sources

Synchronization of hypernetworks of coupled dynamical systems

We consider synchronization of coupled dynamical systems when different types of interactions are simultaneously present. We assume that a set of dynamical systems are coupled through the connections of two or more distinct networks (each of which corresponds to a distinct type of interaction), and we refer to such a system as a hypernetwork. Applications include neural networks formed of both electrical gap junctions and chemical synapses, the coordinated motion of shoals of fishes communicating through both vision and flow sensing, and hypernetworks of coupled chaotic oscillators. We first analyze the case of a hypernetwork formed of $m=2$ networks. We look for necessary and sufficient conditions for synchronization. We attempt at reducing the linear stability problem in a master stability function form, i.e., at decoupling the effects of the coupling functions from the structure of the networks. Unfortunately, we are unable to obtain a reduction in a master stability function form for the general case. However, we show that such a reduction is possible in three cases of interest: (i) the Laplacian matrices associated with the two networks commute; (ii) one of the two networks is unweighted and fully connected; (iii) one of the two networks is such that the coupling strength from node $i$ to node $j$ is a function of $j$ but not of $i$. Furthermore, we define a class of networks such that if either one of the two coupling networks belongs to this class, the reduction can be obtained independently of the other network. As an example of interest, we study synchronization of a neural hypernetwork for which the connections can be either chemical synapses or electrical gap junctions. We propose a generalization of our stability results to the case of hypernetworks formed of $m\geq 2$ networks.

nlin.CD↗

Estimation of communication-delays through adaptive synchronization of chaos

This paper deals with adaptive synchronization of chaos in the presence of time-varying communication-delays. We consider two bidirectionally coupled systems that seek to synchronize through a signal that each system sends to the other one and is transmitted with an unknown time-varying delay. We show that an appropriate adaptive strategy can be devised that is successful in dynamically identifying the time-varying delay and in synchronizing the two systems. The performance of our strategy with respect to the choice of the initial conditions and the presence of noise in the communication channels is tested by using numerical simulations. Another advantage of our approach is that in addition to estimating the communication-delay, the adaptive strategy could be used to simultaneously identify other parameters, such as e.g., the unknown time-varying amplitude of the received signal.

nlin.CD↗

Stability of strategies in payoff-driven evolutionary games on networks

We consider a network of coupled agents playing the Prisoner's Dilemma game, in which players are allowed to pick a strategy in the interval [0,1], with 0 corresponding to defection, 1 to cooperation, and intermediate values representing mixed strategies in which each player may act as a cooperator or a defector over a large number of interactions with a certain probability. Our model is payoff-driven, i.e., we assume that the level of accumulated payoff at each node is a relevant parameter in the selection of strategies. Also, we consider that each player chooses his/her strategy in a context of limited information. We present a deterministic nonlinear model for the evolution of strategies. We show that the final strategies depend on the network structure and on the choice of the parameters of the game. We find that polarized strategies (pure cooperator/defector states) typically emerge when (i) the network connections are sparse, (ii) the network degree distribution is heterogeneous, (iii) the network is assortative, and surprisingly, (iv) the benefit of cooperation is high.

nlin.AO↗

Analysis of parameter mismatches in the master stability function for network synchronization

In this letter, we perform a sensitivity analysis on the master stability function approach for the synchronization of networks of coupled dynamical systems. More specifically, we analyze the linear stability of a nearly synchronized solution for a network of coupled dynamical systems, for which the individual dynamics and output functions of each unit are approximately identical and the sums of the entries in the rows of the coupling matrix slightly deviate from zero. The motivation for this parametric study comes from experimental instances of synchronization in human-made or natural settings, where ideal conditions are difficult to observe.

cond-mat.dis-nn↗

Dynamic synchronization of a time-evolving optical network of chaotic oscillators

We present and experimentally demonstrate a technique for achieving and maintaining a global state of identical synchrony of an arbitrary network of chaotic oscillators even when the coupling strengths are unknown and time-varying. At each node an adaptive synchronization algorithm dynamically estimates the current strength of the net coupling signal to that node. We experimentally demonstrate this scheme in a network of three bidirectionally coupled chaotic optoelectronic feedback loops and we present numerical simulations showing its application in larger networks. The stability of the synchronous state for arbitrary coupling topologies is analyzed via a master stability function approach.

nlin.CD↗

Identification of delays and discontinuity points of unknown systems by using synchronization of chaos

In this paper we present an approach in which synchronization of chaos is used to address identification problems. In particular, we are able to identify: (i) the discontinuity points of systems described by piecewise dynamical equations and (ii) the delays of systems described by delay differential equations. Delays and discontinuities are widespread features of the dynamics of both natural and manmade systems. The foremost goal of the paper is to present a general and flexible methodology that can be used in a broad variety of identification problems.

math-ph↗

The stability of adaptive synchronization of chaotic systems

In past works, various schemes for adaptive synchronization of chaotic systems have been proposed. The stability of such schemes is central to their utilization. As an example addressing this issue, we consider a recently proposed adaptive scheme for maintaining the synchronized state of identical coupled chaotic systems in the presence of a priori unknown slow temporal drift in the couplings. For this illustrative example, we develop an extension of the master stability function technique to study synchronization stability with adaptive coupling. Using this formulation, we examine local stability of synchronization for typical chaotic orbits and for unstable periodic orbits within the synchronized chaotic attractor (bubbling). Numerical experiments illustrating the results are presented. We observe that the stable range of synchronism can be sensitively dependent on the adaption parameters, and we discuss the strong implication of bubbling for practically achievable adaptive synchronization.

cond-mat.dis-nn↗

Adaptive synchronization of coupled chaotic oscillators

We experimentally demonstrate and numerically simulate a new adaptive method to maintain synchronization between coupled nonlinear chaotic oscillators, when the coupling between the systems is unknown and time-varying (e.g., due to environmental parameter drift). The technique is applied to optoelectronic feedback loops exhibiting high dimensional chaotic dynamics. In addition to keeping the two systems isochronally synchronized in the presence of a priori unknown time-varying coupling strength, the technique provides an estimate of the time-varying coupling.

nlin.CD↗

Complex Dynamics and Synchronization of Delayed-Feedback Nonlinear Oscillators

We describe a flexible and modular delayed-feedback nonlinear oscillator that is capable of generating a wide range of dynamical behaviours, from periodic oscillations to high-dimensional chaos. The oscillator uses electrooptic modulation and fibre-optic transmission, with feedback and filtering implemented through real-time digital-signal processing. We consider two such oscillators that are coupled to one another, and we identify the conditions under which they will synchronize. By examining the rates of divergence or convergence between two coupled oscillators, we quantify the maximum Lyapunov exponents or transverse Lyapunov exponents of the system, and we present an experimental method to determine these rates that does not require a mathematical model of the system. Finally, we demonstrate a new adaptive control method that keeps two oscillators synchronized even when the coupling between them is changing unpredictably.

nlin.CD↗

Adaptive coupling for achieving stable synchronization of chaos

We consider synchronization of coupled chaotic systems and propose an adaptive strategy that aims at evolving the strength of the coupling to achieve stability of the synchronized evolution. We test this idea in a simple configuration in which two chaotic systems are unidirectionally coupled (a sender and a receiver) and we study conditions for the receiver to adaptively synchronize with the sender. Numerical simulations show that, under certain conditions, our strategy is successful in dynamically evolving the coupling strength until it converges to a value that is compatible with synchronization.

cond-mat.other↗

Using synchronization of chaos to identify the dynamics of unknown systems

We address the issue of how to identify the equations of a largely unknown chaotic system from knowledge about its state evolution. The technique can be applied to the estimation of parameters that drift slowly with time. To accomplish this, we propose an adaptive strategy that aims at synchronizing the unknown real system with another system whose parameters are adaptively evolved to converge on those of the real one. Our proposed strategy is tested to identify the equations of the Lorenz and the Rossler systems. We also consider the effects of measurement noise and of deviation of our fitting model from consistency with the true dynamics.

cond-mat.dis-nn↗

Using synchronism of chaos for adaptive learning of network topology

In this paper we consider networks of dynamical systems that evolve in synchrony and investigate how dynamical information from the synchronization dynamics can be effectively used to learn the network topology, i.e., identify the time evolution of the couplings between the network nodes. To this aim, we present an adaptive strategy that, based on a potential that the network systems seek to minimize in order to maintain synchronization, can be successfully applied to identify the time evolution of the network from limited information. This strategy takes advantage of the properties of synchronism of chaos and of the presence of different communication delays over the network links. As a motivating example we consider a network of sensors surveying an area, in which information regarding the time evolution of the network connections can be used, e.g., to detect changes taking place within the area. We propose two different setups for our strategy. In the first one, synchronization has to be achieved at each node (as well as the identification of the couplings over the network links), based solely on a single scalar signal representing a superposition of signals from the other nodes in the network. In the second one, we incorporate an additional node, termed the maestro, having the function of maintaining network synchronization. We will see that when such an arrangement is realized, it will become possible to effectively identify the time evolution of networks that are much larger than would be possible in the absence of a maestro.

physics.soc-ph↗

Adaptive synchronization of dynamics on evolving complex networks

We study the problem of synchronizing a general complex network by means of an adaptive strategy in the case where the network topology is slowly time varying and every node receives at each time only one aggregate signal from the set of its neighbors. We introduce an appropriately defined potential that each node seeks to minimize in order to reach/maintain synchronization. We show that our strategy is effective in tracking synchronization as well as in achieving synchronization when appropriate conditions are met.

cond-mat.dis-nn↗

Network synchronization of groups

In this paper we study synchronized motions in complex networks in which there are distinct groups of nodes where the dynamical systems on each node within a group are the same but are different for nodes in different groups. Both continuous time and discrete time systems are considered. We initially focus on the case where two groups are present and the network has bipartite topology (i.e., links exist between nodes in different groups but not between nodes in the same group). We also show that group synchronous motions are compatible with more general network topologies, where there are also connections within the groups.

cond-mat.dis-nn↗

Effects of the network structural properties on its controllability

In a recent paper, it has been suggested that the controllability of a diffusively coupled complex network, subject to localized feedback loops at some of its vertices, can be assessed by means of a Master Stability Function approach, where the network controllability is defined in terms of the spectral properties of an appropriate Laplacian matrix. Following that approach, a comparison study is reported here among different network topologies in terms of their controllability. The effects of heterogeneity in the degree distribution, as well as of degree correlation and community structure, are discussed.

cond-mat.dis-nn↗

Pinning-controllability of complex networks

We study the problem of controlling a general complex network towards an assigned synchronous evolution, by means of a pinning control strategy. We define the pinning-controllability of the network in terms of the spectral properties of an extended network topology. The roles of the control and coupling gains as well as of the number of pinned nodes are also discussed.

cond-mat.dis-nn↗

Synchronizability and synchronization dynamics of weighed and unweighed scale free networks with degree mixing

We study the synchronizability and the synchronization dynamics of networks of nonlinear oscillators. We investigate how the synchronization of the network is influenced by some of its topological features such as variations of the power law exponent $γ$ and the degree correlation coefficient $r$. Using an appropriate construction algorithm based on clustering the network vertices in $p$ classes according to their degrees, we construct networks with an assigned power law distribution but changing degree correlation properties. We find that the network synchronizability improves when the network becomes disassortative, i.e. when nodes with low degree are more likely to be connected to nodes with higher degree. We consider the case of both weighed and unweighed networks. The analytical results reported in the paper are then confirmed by a set of numerical observations obtained on weighed and unweighed networks of nonlinear Rössler oscillators. Using a nonlinear optimization strategy we also show that negative degree correlation is an emerging property of networks when synchronizability is to be optimized. This suggests that negative degree correlation observed experimentally in a number of physical and biological networks might be motivated by their need to synchronize better.

cond-mat.dis-nn↗

Communication models with distributed transmission rates and buffer sizes

The paper is concerned with the interplay between network structure and traffic dynamics in a communications network, from the viewpoint of end-to-end performance of packet transfer. We use a model of network generation that allows the transition from random to scale-free networks. Specifically, we are able to consider three different topologycal types of networks: (a) random; (b) scale-free with γ=3; (c) scale free with γ=2. We also use an LRD traffic generator in order to reproduce the fractal behavior that is observed in real world data communication. The issue is addressed of how the traffic behavior on the network is influenced by the variable factors of the transmission rates and queue length restrictions at the network vertices. We show that these factors can induce drastic changes in the throughput and delivery time of network performance and are able to counter-balance some undesirable effects due to the topology.

cond-mat.dis-nn↗