Browse
Submit Data
Databases
API
Help

Dataset Information

43 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Energy scaling of targeted optimal control of complex networks.

ABSTRACT: 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.

SUBMITTER: Klickstein I

PROVIDER: S-EPMC5413984 | biostudies-literature | 2017 Apr

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

Energy scaling of targeted optimal control of complex networks.

Klickstein Isaac I Shirin Afroza A Sorrentino Francesco F

Nature communications 20170424

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 ...[more]

PMID: 28436417

Similar Datasets

Optimal control of aging in complex networks.

Project description:Many complex systems experience damage accumulation, which leads to aging, manifest as an increasing probability of system collapse with time. This naturally raises the question of how to maximize health and longevity in an aging system at minimal cost of maintenance and intervention. Here, we pose this question in the context of a simple interdependent network model of aging in complex systems and show that it exhibits cascading failures. We then use both optimal control theory and reinforcement learning alongside a combination of analysis and simulation to determine optimal maintenance protocols. These protocols may motivate the rational design of strategies for promoting longevity in aging complex systems with potential applications in therapeutic schedules and engineered system maintenance.

| S-EPMC7456090 | biostudies-literature

Minimum energy control for complex networks.

Project description:The aim of this paper is to shed light on the problem of controlling a complex network with minimal control energy. We show first that the control energy depends on the time constant of the modes of the network, and that the closer the eigenvalues are to the imaginary axis of the complex plane, the less energy is required for complete controllability. In the limit case of networks having all purely imaginary eigenvalues (e.g. networks of coupled harmonic oscillators), several constructive algorithms for minimum control energy driver node selection are developed. A general heuristic principle valid for any directed network is also proposed: the overall cost of controlling a network is reduced when the controls are concentrated on the nodes with highest ratio of weighted outdegree vs indegree.

| S-EPMC5816648 | biostudies-literature

Multipartite state generation in quantum networks with optimal scaling.

Project description:We introduce a repeater scheme to efficiently distribute multipartite entangled states in a quantum network with optimal scaling. The scheme allows to generate graph states such as 2D and 3D cluster states of growing size or GHZ states over arbitrary distances, with a constant overhead per node/channel that is independent of the distance. The approach is genuine multipartite, and is based on the measurement-based implementation of multipartite hashing, an entanglement purification protocol that operates on a large ensemble together with local merging/connection of elementary building blocks. We analyze the performance of the scheme in a setting where local or global storage is limited, and compare it to bipartite and hybrid approaches that are based on the distribution of entangled pairs. We find that the multipartite approach offers a storage advantage, which results in higher efficiency and better performance in certain parameter regimes. We generalize our approach to arbitrary network topologies and different target graph states.

| S-EPMC6342956 | biostudies-literature

Optimal control of transient dynamics in balanced networks supports generation of complex movements.

Project description:Populations of neurons in motor cortex engage in complex transient dynamics of large amplitude during the execution of limb movements. Traditional network models with stochastically assigned synapses cannot reproduce this behavior. Here we introduce a class of cortical architectures with strong and random excitatory recurrence that is stabilized by intricate, fine-tuned inhibition, optimized from a control theory perspective. Such networks transiently amplify specific activity states and can be used to reliably execute multidimensional movement patterns. Similar to the experimental observations, these transients must be preceded by a steady-state initialization phase from which the network relaxes back into the background state by way of complex internal dynamics. In our networks, excitation and inhibition are as tightly balanced as recently reported in experiments across several brain areas, suggesting inhibitory control of complex excitatory recurrence as a generic organizational principle in cortex.

| S-EPMC6364799 | biostudies-literature

Optimizing target nodes selection for the control energy of directed complex networks.

Project description:The energy needed in controlling a complex network is a problem of practical importance. Recent works have focused on the reduction of control energy either via strategic placement of driver nodes, or by decreasing the cardinality of nodes to be controlled. However, optimizing control energy with respect to target nodes selection has yet been considered. In this work, we propose an iterative method based on Stiefel manifold optimization of selectable target node matrix to reduce control energy. We derive the matrix derivative gradient needed for the search algorithm in a general way, and search for target nodes which result in reduced control energy, assuming that driver nodes placement is fixed. Our findings reveal that the control energy is optimal when the path distances from driver nodes to target nodes are minimized. We corroborate our algorithm with extensive simulations on elementary network topologies, random and scale-free networks, as well as various real networks. The simulation results show that the control energy found using our algorithm outperforms heuristic selection strategies for choosing target nodes by a few orders of magnitude. Our work may be applicable to opinion networks, where one is interested in identifying the optimal group of individuals that the driver nodes can influence.

| S-EPMC7581767 | biostudies-literature

Information theoretical limits for quantum optimal control solutions: error scaling of noisy control channels.

Project description:Accurate manipulations of an open quantum system require a deep knowledge of its controllability properties and the information content of the implemented control fields. By using tools of information and quantum optimal control theory, we provide analytical bounds (information-time bounds) to characterize our capability to control the system when subject to arbitrary sources of noise. Moreover, since the presence of an external noise field induces open quantum system dynamics, we also show that the results provided by the information-time bounds are in very good agreement with the Kofman-Kurizki universal formula describing decoherence processes. Finally, we numerically test the scaling of the control accuracy as a function of the noise parameters, by means of the dressed chopped random basis (dCRAB) algorithm for quantum optimal control.

| S-EPMC9741659 | biostudies-literature

Inverse Power Law Scaling of Energy Dissipation Rate in Nonequilibrium Reaction Networks.

Project description:The energy dissipation rate in a nonequilibrium reaction system can be determined by the reaction rates in the underlying reaction network. By developing a coarse-graining process in state space and a corresponding renormalization procedure for reaction rates, we find that energy dissipation rate has an inverse power-law dependence on the number of microscopic states in a coarse-grained state. The dissipation scaling law requires self-similarity of the underlying network, and the scaling exponent depends on the network structure and the probability flux correlation. Existence of the inverse dissipation scaling law is shown in realistic biochemical systems such as biochemical oscillators and microtubule-kinesin active flow systems.

| S-EPMC8286115 | biostudies-literature

Optimal partition and effective dynamics of complex networks.

Project description:Given a large and complex network, we would like to find the best partition of this network into a small number of clusters. This question has been addressed in many different ways. Here we propose a strategy along the lines of optimal prediction for the Markov chains associated with the dynamics on these networks. We develop the necessary ingredients for such an optimal partition strategy, and we compare our strategy with the previous ones. We show that when the Markov chain is lumpable, we recover the partition with respect to which the chain is lumpable. We also discuss the case of well-clustered networks. Finally, we illustrate our strategy on several examples.

| S-EPMC2786939 | biostudies-literature

Optimal localization of diffusion sources in complex networks.

Project description:Locating sources of diffusion and spreading from minimum data is a significant problem in network science with great applied values to the society. However, a general theoretical framework dealing with optimal source localization is lacking. Combining the controllability theory for complex networks and compressive sensing, we develop a framework with high efficiency and robustness for optimal source localization in arbitrary weighted networks with arbitrary distribution of sources. We offer a minimum output analysis to quantify the source locatability through a minimal number of messenger nodes that produce sufficient measurement for fully locating the sources. When the minimum messenger nodes are discerned, the problem of optimal source localization becomes one of sparse signal reconstruction, which can be solved using compressive sensing. Application of our framework to model and empirical networks demonstrates that sources in homogeneous and denser networks are more readily to be located. A surprising finding is that, for a connected undirected network with random link weights and weak noise, a single messenger node is sufficient for locating any number of sources. The framework deepens our understanding of the network source localization problem and offers efficient tools with broad applications.

| S-EPMC5414272 | biostudies-literature

Optimal search strategies on complex multi-linked networks.

Project description:In this paper we consider the problem of optimal search strategies on multi-linked networks, i.e. graphs whose nodes are endowed with several independent sets of links. We focus preliminarily on agents randomly hopping along the links of a graph, with the additional possibility of performing non-local hops to randomly chosen nodes with a given probability. We show that an optimal combination of the two jump rules exists that maximises the efficiency of target search, the optimum reflecting the topology of the network. We then generalize our results to multi-linked networks with an arbitrary number of mutually interfering link sets.

| S-EPMC4423499 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data