arXiv subjects

Francesco Sorrentino

Publications and source records attributed to Francesco Sorrentino.

At least 55 records · Page 3Linked to original sources

arXiv2018

Symmetries in the time-averaged dynamics of networks: reducing unnecessary complexity through minimal network models

Complex networks are the subject of fundamental interest from the scientific community at large. Several metrics have been introduced to characterize the structure of these networks, such as the degree distribution, degree correlation, path length, clustering coefficient, centrality measures etc. Another important feature is the presence of network symmetries. In particular, the effect of these symmetries has been studied in the context of network synchronization, where they have been used to predict the emergence and stability of cluster synchronous states. Here we provide theoretical, numerical, and experimental evidence that network symmetries play a role in a substantially broader class of dynamical models on networks, including epidemics, game theory, communication, and coupled excitable systems. Namely, we see that in all these models, nodes that are related by a symmetry relation show the same time-averaged dynamical properties. This discovery leads us to propose reduction techniques for exact, yet minimal, simulation of complex networks dynamics, which we show are effective in order to optimize the use of computational resources, such as computation time and memory.

physics.soc-ph↗

arXiv2018

Control Distance and Energy Scaling of Complex Networks

It has recently been shown that the average energy required to control a subset of nodes in a complex network scales exponentially with the cardinality of the subset. While the mean scales exponentially, the variance of the control energy over different subsets of nodes is large and has as of yet not been explained. Here, we provide an explanation of the large variance as a result of both the length of the path that connects control inputs to the target nodes and the redundancy of paths of shortest length. Our first result provides an exact upper bound of the control energy as a function of path length between driver node and target node along an infinite path graph. We also show that the energy estimation is still very accurate even when finite size effects are taken into account. Our second result refines the upper bound that takes into account not only the length of the path, but also the redundancy of paths. We show that it improves the upper bound approximation by an order of magnitude or more. Finally, we lay out the foundations for a more accurate estimation of the control energy for the multi-target and multi-driver problem.

physics.soc-ph↗

arXiv2018

Generating Graphs with Symmetry

In the field of complex networks and graph theory, new results are typically tested on graphs generated by a variety of algorithms such as the Erdős-Rényi model or the Barabási-Albert model. Unfortunately, most graph generating algorithms do not typically create graphs with symmetries, which have been shown to have an important role on the network dynamics. Here, we present an algorithm to generate graphs with prescribed symmetries. The algorithm can also be used to generate graphs with a prescribed equitable partition but possibly without any symmetry. We also use our graph generator to examine the recently raised question about the relation between the orbits of the automorphism group and a graph's minimal equitable partition.

math.CO↗

arXiv2018

Control Energy of Lattice Graphs

The control of complex networks has generated a lot of interest in a variety of fields from traffic management to neural systems. A commonly used metric to compare two particular control strategies that accomplish the same task is the control energy, the integral of the sum of squares of all control inputs. The minimum control energy problem determines the control input that lower bounds all other control inputs with respect to their control energies. Here, we focus on the infinite lattice graph with linear dynamics and analytically derive the expression for the minimum control energy in terms of the modified Bessel function. We then demonstrate that the control energy of the infinite lattice graph accurately predicts the control energy of finite lattice graphs.

eess.SY↗

arXiv2018

Optimal Input Placement in Lattice Graphs

The control of dynamical, networked systems continues to receive much attention across the engineering and scientific research fields. Of particular interest is the proper way to determine which nodes of the network should receive external control inputs in order to effectively and efficiently control portions of the network. Published methods to accomplish this task either find a minimal set of driver nodes to guarantee controllability or a larger set of driver nodes which optimizes some control metric. Here, we investigate the control of lattice systems which provides analytical insight into the relationship between network structure and controllability. First we derive a closed form expression for the individual elements of the controllability Gramian of infinite lattice systems. Second, we focus on nearest neighbor lattices for which the distance between nodes appears in the expression for the controllability Gramian. We show that common control energy metrics scale exponentially with respect to the maximum distance between a driver node and a target node.

eess.SY↗

arXiv2018

Optimal Control of Networks in the presence of Attackers and Defenders

We consider the problem of a dynamical network whose dynamics is subject to external perturbations (`attacks') locally applied at a subset of the network nodes. We assume that the network has an ability to defend itself against attacks with appropriate countermeasures, which we model as actuators located at (another) subset of the network nodes. We derive the optimal defense strategy as an optimal control problem. We see that the network topology, as well as the distribution of attackers and defenders over the network affect the optimal control solution and the minimum control energy. We study the optimal control defense strategy for several network topologies, including chain networks, star networks, ring networks, and scale free networks.

eess.SY↗

arXiv2018

Symmetry- and Input-Cluster Synchronization in Networks

We study cluster synchronization in networks and show that the stability of all possible cluster synchronization patterns depends on a small set of Lyapunov exponents. Our approach can be applied to clusters corresponding to both orbital partitions of the network nodes (symmetry-cluster synchronization) and equitable partitions of the network nodes (input-cluster synchronization.) Our results are verified experimentally in networks of coupled opto-electronic oscillators.

nlin.CD↗

arXiv2018

Energy Scaling with Control Distance in Complex Networks

It has recently been shown that the expected energy requirements of a control action applied to a complex network scales exponentially with the number of nodes that are targeted. While the exponential scaling law provides an adequate prediction of the mean required energy, it has also been shown that the spread of energy values for a particular number of targets is large. Here, we explore more closely the effect distance between driver nodes and target nodes and the magnitude of self-regulation has on the energy of the control action. We find that the energy scaling law can be written to include information about the distance between driver nodes and target nodes to more accurately predict control energy.

physics.soc-ph↗

arXiv2017

Locally Optimal Control of Complex Networks

It has recently been shown that the minimum energy solution of the control problem for a linear system produces a control trajectory that is nonlocal. An issue then arises when the dynamics represents a linearization of the underlying nonlinear dynamics of the system where the linearization is only valid in a local region of the state space. Here we provide a solution to the problem of optimally controlling a linearized system by deriving a time-varying set that represents all possible control trajectories parameterized by time and energy. As long as the control action terminus is defined within this set, the control trajectory is guaranteed to be local. If the desired terminus of the control action is far from the initial state, a series of local control actions can be performed in series, re-linearizing the dynamics at each new position.

math.OC↗

arXiv2017

Energy Scaling of Targeted Optimal Control of Complex Networks

Recently it has been shown that the control energy required to control a dynamical complex network is prohibitively large when there are only a few control inputs. Most methods to reduce the control energy have focused on where, in the network, to place additional control inputs. Here, in contrast, we show that by controlling the states of a subset of the nodes of a network, rather than the state of every node, while holding the number of control signals constant, the required energy to control a portion of the network can be reduced substantially. The energy requirements exponentially decay with the number of target nodes, suggesting that large networks can be controlled by a relatively small number of inputs as long as the target set is appropriately sized. We validate our conclusions in model and real networks to arrive at an energy scaling law to better design control objectives regardless of system size, energy restrictions, state restrictions, input node choices and target node choices.

eess.SY↗

arXiv2017

Observability of Nonlinear Complex Networks in the Presence of Symmetries: A Graphical Approach

Reconstructing the states of the nodes of a dynamical network is a problem of fundamental importance in the study of neuronal and genetic networks. An underlying related problem is that of observability, i.e., identifying the conditions under which such a reconstruction is possible. In this paper we study observability of complex dynamical networks, where we consider the effects of network symmetries on observability. We present an efficient algorithm that returns a minimal set of necessary sensor nodes for observability in the presence of symmetries.

nlin.PS↗

arXiv2015

Complete Characterization of Stability of Cluster Synchronization in Complex Dynamical Networks

Synchronization is an important and prevalent phenomenon in natural and engineered systems. In many dynamical networks, the coupling is balanced or adjusted in order to admit global synchronization, a condition called Laplacian coupling. Many networks exhibit incomplete synchronization, where two or more clusters of synchronization persist, and computational group theory has recently proved to be valuable in discovering these cluster states based upon the topology of the network. In the important case of Laplacian coupling, additional synchronization patterns can exist that would not be predicted from the group theory analysis alone. The understanding of how and when clusters form, merge, and persist is essential for understanding collective dynamics, synchronization, and failure mechanisms of complex networks such as electric power grids, distributed control networks, and autonomous swarming vehicles. We describe here a method to find and analyze all of the possible cluster synchronization patterns in a Laplacian-coupled network, by applying methods of computational group theory to dynamically-equivalent networks. We present a general technique to evaluate the stability of each of the dynamically valid cluster synchronization patterns. Our results are validated in an electro-optic experiment on a 5 node network that confirms the synchronization patterns predicted by the theory.

nlin.CD↗

arXiv2014

Inhibition causes ceaseless dynamics in networks of excitable nodes

The collective dynamics of a network of excitable nodes changes dramatically when inhibitory nodes are introduced. We consider inhibitory nodes which may be activated just like excitatory nodes but, upon activating, decrease the probability of activation of network neighbors. We show that, although the direct effect of inhibitory nodes is to decrease activity, the collective dynamics becomes self-sustaining. We explain this counterintuitive result by defining and analyzing a "branching function" which may be thought of as an activity-dependent branching ratio. The shape of the branching function implies that for a range of global coupling parameters dynamics are self-sustaining. Within the self-sustaining region of parameter space lies a critical line along which dynamics take the form of avalanches with universal scaling of size and duration, embedded in ceaseless timeseries of activity. Our analyses, confirmed by numerical simulation, suggest that inhibition may play a counterintuitive role in excitable networks.

q-bio.NC↗

arXiv2013

Symmetries, Cluster Synchronization, and Isolated Desynchronization in Complex Networks

Synchronization is of central importance in power distribution, telecommunication, neuronal, and biological networks. Many networks are observed to produce patterns of synchronized clusters, but it has been difficult to predict these clusters or understand the conditions under which they form, except for in the simplest of networks. In this article, we shed light on the intimate connection between network symmetry and cluster synchronization. We introduce general techniques that use network symmetries to reveal the patterns of synchronized clusters and determine the conditions under which they persist. The connection between symmetry and cluster synchronization is experimentally explored using an electro-optic network. We experimentally observe and theoretically predict a surprising phenomenon in which some clusters lose synchrony while leaving others synchronized. The results could guide the design of new power grid systems or lead to new understanding of the dynamical behavior of networks ranging from neural to social.

nlin.CD↗

arXiv2013

Decentralized identification and control of networks of coupled mobile platforms through adaptive synchronization of chaos

In this paper we propose an application of adaptive synchronization of chaos to detect changes in the topology of a mobile robotic network. We assume that the network may evolve in time due to the relative motion of the mobile robots and due to unknown environmental conditions, such as the presence of obstacles in the environment. We consider that each robotic agent is equipped with a chaotic oscillator whose state is propagated to the other robots through wireless communication, with the goal of synchronizing the oscillators. We introduce an adaptive strategy that each agent independently implements to: (i) estimate the net coupling of all the oscillators in its neighborhood and (ii) synchronize the state of the oscillators onto the same time evolution. We show that by using this strategy, synchronization can be attained and changes in the network topology can be detected. We go one step forward and consider the possibility of using this information to control the mobile network. We show the potential applicability of our technique to the problem of maintaining a formation between a set of mobile platforms, which operate in an inhomogeneous and uncertain environment. We discuss the importance of using chaotic oscillators and validate our methodology by numerical simulations.

nlin.AO↗

arXiv2013

Modeling the dynamics of bivalent histone modifications

Epigenetic modifications to histones may promote either activation or repression of the transcription of nearby genes. Recent experimental studies show that the promoters of many lineage-control genes in stem cells have "bivalent domains" in which the nucleosomes contain both active (H3K4me3) and repressive (H3K27me3) marks. It is generally agreed that bivalent domains play an important role in stem cell differentiation, but the underlying mechanisms remain unclear. Here we formulate a mathematical model to investigate the dynamic properties of histone modification patterns. We then illustrate that our modeling framework can be used to capture key features of experimentally observed combinatorial chromatin states.

q-bio.GN↗

arXiv2013

Experimental Observations of Group Synchrony in a System of Chaotic Optoelectronic Oscillators

We experimentally demonstrate group synchrony in a network of four nonlinear optoelectronic oscillators with time-delayed coupling. We divide the nodes into two groups of two each, by giving each group different parameters and by enabling only inter-group coupling. When coupled in this fashion, the two groups display different dynamics, with no isochronal synchrony between them, but the nodes in a single group are isochronally synchronized, even though there is no intra-group coupling. We compare experimental behavior with theoretical and numerical results.

nlin.CD↗

arXiv2012

Synchronization of dynamical hypernetworks: dimensionality reduction through simultaneous block-diagonalization of matrices

We present a general framework to study stability of the synchronous solution for a hypernetwork of coupled dynamical systems. We are able to reduce the dimensionality of the problem by using simultaneous block-diagonalization of matrices. We obtain necessary and sufficient conditions for stability of the synchronous solution in terms of a set of lower-dimensional problems and test the predictions of our low-dimensional analysis through numerical simulations. Under certain conditions, this technique may yield a substantial reduction of the dimensionality of the problem. For example, for a class of dynamical hypernetworks analyzed in the paper, we discover that arbitrarily large networks can be reduced to a collection of subsystems of dimensionality no more than 2. We apply our reduction techique to a number of different examples, including a class of undirected unweighted hypermotifs of three nodes.

nlin.CD↗