ANAmirhossein Nazerian

Amirhossein Nazerian

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Amirhossein Nazerian has a total of 18 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Extreme vulnerability to intruder attacks destabilizes network dynamics

    by Amirhossein Nazerian, Sahand Tangerami, Malbor Asllani, David Phillips, Hernán Makse, Francesco Sorrentino

    Consensus, synchronization, formation control, and power grid balance are examples of desirable dynamical states that arise in networks. Here we investigate how such states can be destabilized by an intruder agent within an otherwise functioning network. We see that a single adversarial node, coupled through adversarial connections to one or more other nodes, is sufficient to destabilize the entire network. We further show that concentrating the attack on a single low-indegree node induces the greatest instability, challenging the common assumption that hubs are the most critical nodes. This leads to a new characterization of network vulnerability, identifying low-indegree nodes as the most vulnerable components. Although derived for linear systems, our results extend to nonlinear networks, including the Kuramoto model. These findings reveal an intrinsic vulnerability of technological, social, and biological networks.

  • Open Access

    The frequency response of networks as open systems

    by Amirhossein Nazerian, Malbor Asllani, Melvyn Tyloo, Wai Lim Ku, Francesco Sorrentino

    Many biological, technological, and social systems can be effectively described as networks of interacting subsystems. Typically, these networks are not isolated objects, but interact with their environment through both signals and information that are received by specific nodes with an input function or released to the environment by other nodes with an output function. An important question is whether the structure of different networks, together with the particular selection of input and output nodes, is such that it favors the passing or blocking of such signals. For a given network and a given choice of the input and output nodes, the $${{{{\mathcal{H}}}}}_{2}$$ H 2 -norm provides a natural and general quantification of the extent to which input signals–whether deterministic or stochastic, periodic or arbitrary–are amplified. We analyze a diverse set of empirical networks and find that many naturally occurring systems, such as food webs, signaling pathways, and gene regulatory circuits, are structurally organized to enhance the passing of signals; in contrast, the structure of engineered systems like power grids appears to be intentionally designed to suppress signal propagation.


  • Open networks in discrete time: Passing vs blocking behavior

    by Amirhossein Nazerian, Malbor Asllani, Melvyn Tyloo, Francesco Sorrentino

    This paper presents a unified framework for analyzing the input–output behavior of discrete-time complex networks viewed as open systems. Importantly, we focus on systems that are inherently modeled in discrete time—such as opinion dynamics, Markov chains, diffusion on networks, and population models—reflecting their natural formulation in many real-world contexts. By an open network, we mean one that is coupled to its environment, through both external signals that are received by designated input nodes and response signals that are released back into the environment via a separate set of output nodes. We develop a general framework for characterizing whether such networks amplify (pass) or suppress (block) the external inputs. Our approach combines the transfer function of the network with the discrete-time controllability Gramian, and uses the H2-norm as a comprehensive measure of signal gain across various classes of inputs. We introduce a computationally efficient network index based on the Gramian trace and eigenvalues, enabling scalable comparisons across network topologies. Application of our method to a broad set of empirical networks—spanning biological, technological, and ecological domains—uncovers consistent structural signatures associated with passing or blocking behavior. These findings shed light on how the network architecture and the particular selection of input and output nodes shape information flow in real-world systems, with broad implications for control, signal processing, and network design.


  • Open Access

    The efficiency of synchronization dynamics and the role of network syncreactivity

    by Amirhossein Nazerian, Joseph D. Hart, Matteo Lodi, Francesco Sorrentino

    Synchronization of coupled oscillators is a fundamental process in both natural and artificial networks. While much work has investigated the asymptotic stability of the synchronous solution, the fundamental question of the transient behavior toward synchronization has received far less attention. In this work, we present the transverse reactivity as a metric to quantify the instantaneous rate of growth or decay of desynchronizing perturbations. We first use the transverse reactivity to design a coupling-efficient and energy-efficient synchronization strategy that involves varying the coupling strength dynamically according to the current state of the system. We find that our synchronization strategy is able to synchronize networks in both simulation and experiment over a significantly larger (often by orders of magnitude) range of coupling strengths than is possible when the coupling strength is constant. Then, we characterize the effects of network topology on the transient dynamics towards synchronization by introducing the concept of network syncreactivity: A network with a larger syncreactivity has a larger transverse reactivity at every point on the synchronization manifold, independent of the oscillator dynamics. We classify real-world examples of complex networks in terms of their syncreactivity.


  • The Reactability of Discrete Time Systems

    by Amirhossein Nazerian, David Phillips, Mattia Frasca, Francesco Sorrentino

    An important property of a dynamical system is its reactivity, i.e., the initial rate of growth of the norm of the state vector. However, most literature on reactivity has focused on continuous time systems. Here we define the reactivity of discrete time systems and apply it to characterize the dynamics of network systems and Markov chains. We also introduce the concept of reactability, which measures the ability of a system to be made reactive, under the condition that the system is stable. We identify properties of a system that provide minimal reactability. Then we formulate and solve an optimization problem that perturbs an existing discrete time system to make it minimally reactable.


  • Open Access

    Synchronizing chaos using reservoir computing

    by Amirhossein Nazerian, Chad Nathe, Joseph D. Hart, Francesco Sorrentino

    We attempt to achieve complete synchronization between a drive system unidirectionally coupled with a response system, under the assumption that limited knowledge on the states of the drive is available at the response. Machine-learning techniques have been previously implemented to estimate the states of a dynamical system from limited measurements. We consider situations in which knowledge of the non-measurable states of the drive system is needed in order for the response system to synchronize with the drive. We use a reservoir computer to estimate the non-measurable states of the drive system from its measured states and then employ these measured states to achieve complete synchronization of the response system with the drive.


  • Open Access

    Author Correction: Synchronization in networked systems with large parameter heterogeneity

    by Amirhossein Nazerian, Shirin Panahi, Francesco Sorrentino

  • Open Access

    Synchronization in networked systems with large parameter heterogeneity

    by Amirhossein Nazerian, Shirin Panahi, Francesco Sorrentino

    Systems that synchronize in nature are intrinsically different from one another, with possibly large differences from system to system. While a vast part of the literature has investigated the emergence of network synchronization for the case of small parametric mismatches, we consider the general case that parameter mismatches may be large. We present a unified stability analysis that predicts why the range of stability of the synchronous solution either increases or decreases with parameter heterogeneity for a given network. We introduce a parametric approach, based on the definition of a curvature contribution function, which allows us to estimate the effect of mismatches on the stability of the synchronous solution in terms of contributions of pairs of eigenvalues of the Laplacian. For cases in which synchronization occurs in a bounded interval of a parameter, we study the effects of parameter heterogeneity on both transitions (asynchronous to synchronous and synchronous to asynchronous.).


  • Single-Integrator Consensus Dynamics Over Minimally Reactive Networks

    by Amirhossein Nazerian, David Phillips, Hernán A. Makse, Francesco Sorrentino

    The problem of achieving consensus in a network of connected systems arises in many science and engineering applications. In contrast to previous works, we focus on the system reactivity, i.e., the initial amplification of the norm of the system states. We identify a class of networks that we call minimally reactive, which are such that the indegree and the outdegree of each node of the network are the same. We propose several optimization procedures in which minimum perturbations (links or link weights) are imposed on a given network topology to make it minimally reactive. A new concept of structural reactivity is introduced which measures how much a given network is far from becoming minimally reactive by link perturbations. The structural reactivity of directed random graphs is studied.


  • Open Access

    Single-Integrator Consensus Dynamics over Minimally Reactive Networks

    by Amirhossein Nazerian, David Phillips, Hernan A. Makse, Francesco Sorrentino

    The problem of achieving consensus in a network of connected systems arises in many science and engineering applications. In contrast to previous works, we focus on the system reactivity, i.e., the initial amplification of the norm of the system states. We identify a class of networks that we call minimally reactive, which are such that the indegree and the outdegree of each node of the network are the same. We propose several optimization procedures in which minimum perturbations (links or link weights) are imposed on a given network topology to make it minimally reactive. A new concept of structural reactivity is introduced which measures how much a given network is far from becoming minimally reactive by link perturbations. The structural reactivity of directed random graphs is studied.