Searcharxiv⌕ Search

arXiv subjects

Adilson E. Motter

Publications and source records attributed to Adilson E. Motter.

At least 37 records · Page 2Linked to original sources
arXiv2025

Global network control from local information

In the classical control of network systems, the control actions on a node are determined as a function of the states of all nodes in the network. Motivated by applications where the global state cannot be reconstructed in real time due to limitations in the collection, communication, and processing of data, here we introduce a control approach in which the control actions can be computed as a function of the states of the nodes within a limited state information neighborhood. The trade-off between the control performance and the size of this neighborhood is primarily determined by the condition number of the controllability Gramian. Our theoretical results are supported by simulations on regular and random networks and are further illustrated by an application to the control of power-grid synchronization. We demonstrate that for well-conditioned Gramians, there is no significant loss of control performance as the size of the state information neighborhood is reduced, allowing efficient control of large networks using only local information.

eess.SY↗
arXiv2024

Asymmetry underlies stability in power grids

Behavioral homogeneity is often critical for the functioning of network systems of interacting entities. In power grids, whose stable operation requires generator frequencies to be synchronized--and thus homogeneous--across the network, previous work suggests that the stability of synchronous states can be improved by making the generators homogeneous. Here, we show that a substantial additional improvement is possible by instead making the generators suitably heterogeneous. We develop a general method for attributing this counterintuitive effect to converse symmetry breaking, a recently established phenomenon in which the system must be asymmetric to maintain a stable symmetric state. These findings constitute the first demonstration of converse symmetry breaking in real-world systems, and our method promises to enable identification of this phenomenon in other networks whose functions rely on behavioral homogeneity.

nlin.AO↗
arXiv2024

Irreversibility in Bacterial Regulatory Networks

Irreversibility, in which a transient perturbation leaves a system in a new state, is an emergent property in systems of interacting entities. This property has well-established implications in statistical physics but remains underexplored in biological networks, especially for bacteria and other prokaryotes whose regulation of gene expression occurs predominantly at the transcriptional level. Focusing on the reconstructed regulatory network of \emph{Escherichia coli}, we examine network responses to transient single-gene perturbations. We predict irreversibility in numerous cases and find that the incidence of irreversibility increases with the proximity of the perturbed gene to positive circuits in the network. Comparison with experimental data suggests a connection between the predicted irreversibility to transient perturbations and the evolutionary response to permanent perturbations.

q-bio.MN↗
arXiv2024

Cell reprogramming design by transfer learning of functional transcriptional networks

Recent developments in synthetic biology, next-generation sequencing, and machine learning provide an unprecedented opportunity to rationally design new disease treatments based on measured responses to gene perturbations and drugs to reprogram cells. The main challenges to seizing this opportunity are the incomplete knowledge of the cellular network and the combinatorial explosion of possible interventions, both of which are insurmountable by experiments. To address these challenges, we develop a transfer learning approach to control cell behavior that is pre-trained on transcriptomic data associated with human cell fates, thereby generating a model of the network dynamics that can be transferred to specific reprogramming goals. The approach combines transcriptional responses to gene perturbations to minimize the difference between a given pair of initial and target transcriptional states. We demonstrate our approach's versatility by applying it to a microarray dataset comprising >9,000 microarrays across 54 cell types and 227 unique perturbations, and an RNASeq dataset consisting of >10,000 sequencing runs across 36 cell types and 138 perturbations. Our approach reproduces known reprogramming protocols with an AUROC of 0.91 while innovating over existing methods by pre-training an adaptable model that can be tailored to specific reprogramming transitions. We show that the number of gene perturbations required to steer from one fate to another increases with decreasing developmental relatedness and that fewer genes are needed to progress along developmental paths than to regress. These findings establish a proof-of-concept for our approach to computationally design control strategies and provide insights into how gene regulatory networks govern phenotype.

q-bio.MN↗
arXiv2023

Target Controllability and Target Observability of Structured Network Systems

The duality between controllability and observability enables methods developed for full-state control to be applied to full-state estimation, and vice versa. In applications in which control or estimation of all state variables is unfeasible, the generalized notions of output controllability and functional observability establish the minimal conditions for the control and estimation of a target subset of state variables, respectively. Given the seemly unrelated nature of these properties, thus far methods for target control and target estimation have been developed independently in the literature. Here, we characterize the graph-theoretic conditions for target controllability and target observability (which are, respectively, special cases of output controllability and functional observability for structured systems). This allow us to rigorously establish a weak and strong duality between these generalized properties. When both properties are equivalent (strongly dual), we show that efficient algorithms developed for target controllability can be used for target observability, and vice versa, for the optimal placement of sensors and drivers. These results are applicable to large-scale networks, in which control and monitoring are often sought for small subsets of nodes.

eess.SY↗
arXiv2023

Prevalence of multistability and nonstationarity in driven chemical networks

External flows of energy, entropy, and matter can cause sudden transitions in the stability of biological and industrial systems, fundamentally altering their dynamical function. How might we control and design these transitions in chemical reaction networks? Here, we analyze transitions giving rise to complex behavior in random reaction networks subject to external driving forces. In the absence of driving, we characterize the uniqueness of the steady state and identify the percolation of a giant connected component in these networks as the number of reactions increases. When subject to chemical driving (influx and outflux of chemical species), the steady state can undergo bifurcations, leading to multistability or oscillatory dynamics. By quantifying the prevalence of these bifurcations, we show how chemical driving and network sparsity tend to promote the emergence of these complex dynamics and increased rates of entropy production. We show that catalysis also plays an important role in the emergence of complexity, strongly correlating with the prevalence of bifurcations. Our results suggest that coupling a minimal number of chemical signatures with external driving can lead to features present in biochemical processes and abiogenesis.

q-bio.MN↗
arXiv2022

Prevalence and scalable control of localized networks

The ability to control network dynamics is essential for ensuring desirable functionality of many technological, biological, and social systems. Such systems often consist of a large number of network elements, and controlling large-scale networks remains challenging because the computation and communication requirements increase prohibitively fast with network size. Here, we introduce a notion of network locality that can be exploited to make the control of networks scalable even when the dynamics are nonlinear. We show that network locality is captured by an information metric and is almost universally observed across real and model networks. In localized networks, the optimal control actions and system responses are both shown to be necessarily concentrated in small neighborhoods induced by the information metric. This allows us to develop localized algorithms for determining network controllability and optimizing the placement of driver nodes. This also allows us to develop a localized algorithm for designing local feedback controllers that approach the performance of the corresponding best global controllers while incurring a computational cost orders-of-magnitude lower. We validate the locality, performance, and efficiency of the algorithms in Kuramoto oscillator networks as well as three large empirical networks: synchronization dynamics in the Eastern U.S. power grid, epidemic spreading mediated by the global air transportation network, and Alzheimer's disease dynamics in a human brain network. Taken together, our results establish that large networks can be controlled with computation and communication costs comparable to those for small networks.

eess.SY↗
arXiv2022

Network structural origin of instabilities in large complex systems

A central issue in the study of large complex network systems, such as power grids, financial networks, and ecological systems, is to understand their response to dynamical perturbations. Recent studies recognize that many real networks show nonnormality and that nonnormality can give rise to reactivity--the capacity of a linearly stable system to amplify its response to perturbations, oftentimes exciting nonlinear instabilities. Here, we identify network structural properties underlying the pervasiveness of nonnormality and reactivity in real directed networks, which we establish using the most extensive data set of such networks studied in this context to date. The identified properties are imbalances between incoming and outgoing network links and paths at each node. Based on this characterization, we develop a theory that quantitatively predicts nonnormality and reactivity and explains the observed pervasiveness. We suggest that these results can be used to design, upgrade, control, and manage networks to avoid or promote network instabilities.

nlin.AO↗
arXiv2022

Functional observability and target state estimation in large-scale networks

The quantitative understanding and precise control of complex dynamical systems can only be achieved by observing their internal states via measurement and/or estimation. In large-scale dynamical networks, it is often difficult or physically impossible to have enough sensor nodes to make the system fully observable. Even if the system is in principle observable, high-dimensionality poses fundamental limits on the computational tractability and performance of a full-state observer. To overcome the curse of dimensionality, we instead require the system to be functionally observable, meaning that a targeted subset of state variables can be reconstructed from the available measurements. Here, we develop a graph-based theory of functional observability, which leads to highly scalable algorithms to i) determine the minimal set of required sensors and ii) design the corresponding state observer of minimum order. Compared to the full-state observer, the proposed functional observer achieves the same estimation quality with substantially less sensing and computational resources, making it suitable for large-scale networks. We apply the proposed methods to the detection of cyber-attacks in power grids from limited phase measurement data and the inference of the prevalence rate of infection during an epidemic under limited testing conditions. The applications demonstrate that the functional observer can significantly scale up our ability to explore otherwise inaccessible dynamical processes on complex networks.

eess.SY↗
arXiv2021

Comment on "Synchronization dynamics in non-normal networks: the trade-off for optimality"

A recent paper by R. Muolo, T. Carletti, J. P. Gleeson, and M. Asllani [Entropy 23, 36 (2021)] presents a mainly numerical study on the role of non-normality in the synchronization of coupled periodic oscillators, deriving apparent contradictions with the existing literature. Here, we show that their conclusions are artifactual due to a misinterpretation of the master stability function formalism and confirm that the existing literature is correct. We also point to a broader existing literature in which research considered in this paper was correctly addressed numerically, analytically, and experimentally.

nlin.AO↗
arXiv2021

Comparative analysis of existing models for power-grid synchronization

The dynamics of power-grid networks is becoming an increasingly active area of research within the physics and network science communities. The results from such studies are typically insightful and illustrative, but are often based on simplifying assumptions that can be either difficult to assess or not fully justified for realistic applications. Here we perform a comprehensive comparative analysis of three leading models recently used to study synchronization dynamics in power-grid networks -- a fundamental problem of practical significance given that frequency synchronization of all power generators in the same interconnection is a necessary condition for a power grid to operate. We show that each of these models can be derived from first principles within a common framework based on the classical model of a generator, thereby clarifying all assumptions involved. This framework allows us to view power grids as complex networks of coupled second-order phase oscillators with both forcing and damping terms. Using simple illustrative examples, test systems, and real power-grid datasets, we study the inherent frequencies of the oscillators as well as their coupling structure, comparing across the different models. We demonstrate, in particular, that if the network structure is not homogeneous, generators with identical parameters need to be modeled as non-identical oscillators in general. We also discuss an approach to estimate the required (dynamical) parameters that are unavailable in typical power-grid datasets, their use for computing the constants of each of the three models, and an open-source MATLAB toolbox that we provide for these computations.

physics.soc-ph↗
arXiv2021

Network experiment demonstrates converse symmetry breaking

Symmetry breaking--the phenomenon in which the symmetry of a system is not inherited by its stable states--underlies pattern formation, superconductivity, and numerous other effects. Recent theoretical work has established the possibility of converse symmetry breaking (CSB), a phenomenon in which the stable states are symmetric only when the system itself is not. This includes scenarios in which interacting entities are required to be nonidentical in order to exhibit identical behavior, such as in reaching consensus. Here we present an experimental demonstration of this phenomenon. Using a network of alternating-current electromechanical oscillators, we show that their ability to achieve identical frequency synchronization is enhanced when the oscillators are tuned to be suitably nonidentical and that CSB persists for a range of noise levels. These results have implications for the optimization and control of network dynamics in a broad class of systems whose function benefits from harnessing uniform behavior.

nlin.AO↗
arXiv2021

Unified treatment of synchronization patterns in generalized networks with higher-order, multilayer, and temporal interactions

When describing complex interconnected systems, one often has to go beyond the standard network description to account for generalized interactions. Here, we establish a unified framework to simplify the stability analysis of cluster synchronization patterns for a wide range of generalized networks, including hypergraphs, multilayer networks, and temporal networks. The framework is based on finding a simultaneous block diagonalization of the matrices encoding the synchronization pattern and the network topology. As an application, we use simultaneous block diagonalization to unveil an intriguing type of chimera states that appear only in the presence of higher-order interactions. The unified framework established here can be extended to other dynamical processes and can facilitate the discovery of emergent phenomena in complex systems with generalized interactions.

nlin.AO↗
arXiv2021

Hierarchical Power Flow Control in Smart Grids: Enhancing Rotor Angle and Frequency Stability with Demand-Side Flexibility

Large-scale integration of renewables in power systems gives rise to new challenges for keeping synchronization and frequency stability in volatile and uncertain power flow states. To ensure the safety of operation, the system must maintain adequate disturbance rejection capability at the time scales of both rotor angle and system frequency dynamics. This calls for flexibility to be exploited on both the generation and demand sides, compensating volatility and ensuring stability at the two separate time scales. This article proposes a hierarchical power flow control architecture that involves both transmission and distribution networks as well as individual buildings to enhance both small-signal rotor angle stability and frequency stability of the transmission network. The proposed architecture consists of a transmission-level optimizer enhancing system damping ratios, a distribution-level controller following transmission commands and providing frequency support, and a building-level scheduler accounting for quality of service and following the distribution-level targets. We validate the feasibility and performance of the whole control architecture through real-time hardware-in-loop tests involving real-world transmission and distribution network models along with real devices at the Stone Edge Farm Microgrid.

eess.SY↗
arXiv2021

Practical Challenges in Real-time Demand Response

We report on a real-time demand response experiment with 100 controllable devices. The experiment reveals several key challenges in the deployment of a real-time demand response program, including time delays, uncertainties, characterization errors, multiple timescales, and nonlinearity, which have been largely ignored in previous studies. To resolve these practical issues, we develop and implement a two-level multi-loop control structure integrating feed-forward proportional-integral controllers and optimization solvers in closed loops, which eliminates steady-state errors and improves the dynamical performance of the overall building response. The proposed methods are validated by Hardware-in-the-Loop (HiL) tests.

eess.SY↗
arXiv2021

Heterogeneity-stabilized homogeneous states in driven media

Understanding the relationship between symmetry breaking, system properties, and instabilities has been a problem of longstanding scientific interest. Symmetry-breaking instabilities underlie the formation of important patterns in driven systems, but there are many instances in which such instabilities are undesirable. Using parametric resonance as a model process, here we show that a range of states that would be destabilized by symmetry-breaking instabilities can be preserved and stabilized by the introduction of suitable system asymmetry. Because symmetric states are spatially homogeneous and asymmetric systems are spatially heterogeneous, we refer to this effect as heterogeneity-stabilized homogeneity. We illustrate this effect theoretically using driven pendulum array models and demonstrate it experimentally using Faraday wave instabilities. Our results have potential implications for the mitigation of instabilities in engineered systems and the emergence of homogeneous states in natural systems with inherent heterogeneities.

cond-mat.dis-nn↗
arXiv2021

Forget Partitions: Cluster Synchronization in Directed Networks Generate Hierarchies

We present a scalable approach for simplifying the stability analysis of cluster synchronization patterns on directed networks. When a network has directional couplings, decomposition of the coupling matrix into independent blocks (which in turn decouples the variational equation) is no longer adequate to reveal the full relations among perturbation modes. Instead, it is often necessary to introduce directional dependencies among the blocks and establish hierarchies among perturbation modes. For this purpose, we develop an algorithm that finds the simultaneous block upper triangularization of sets of asymmetric matrices, which generalizes the Jordan canonical decomposition from a single matrix to an arbitrary number of matrices. The block upper triangularization orders subspaces of the variational equation in a directional manner, allowing the stability of perturbation modes to be analyzed in sequence. We show that our algorithm gives the greatest possible simplification under mild assumptions, both in terms of the sizes of the blocks and in terms of the number of nonzero upper triangular entries linking the blocks.

nlin.AO↗