Francesco Sorrentino
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Francesco Sorrentino has a total of 85 co-authors. Here are the top co-authors by number of shared publications:
- Amirhossein Nazerian
Department of Mechanical Engineering, University of New Mexico, Albuquerque, USA
14 shared publications - Isaac Klickstein
Department of Mechanical Engineering University of New Mexico 87131 Albuquerque NM USA
13 shared publications Shirin Panahi
Mechanical Engineering Department, University of New Mexico, Albuquerque, USA
9 shared publicationsAfroza Shirin
Mechanical Engineering Department University of New Mexico 87131 Albuquerque NM
7 shared publications- Afroza Shirin
Aerospace Center, The University of Texas at El Paso, 500 W University Ave, El Paso, TX 79907, USA
7 shared publications Isaac Klickstein
University of New Mexico, Albuquerque, New Mexico 80131, USA
5 shared publications
Latest Publications
- Open Access
- 13 August 2026
- Published by Springer Nature in Nature Communications
- Vol. 17 (1) , 9716
Extreme vulnerability to intruder attacks destabilizes network dynamics
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.
- 13 August 2026
- Published by Springer Nature in Nature Communications
- Vol. 17 (1) , 9716
Open AccessExtreme vulnerability to intruder attacks destabilizes network dynamics
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.
- 1 August 2026
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 36 (8)
Reservoir computing for forecasting non-autonomous dynamics with hidden regime variations
Accurate prediction of nonlinear dynamical systems becomes particularly challenging when the evolution of the dynamics depends on hidden, time-varying factors that are not directly observable. Although reservoir computing (RC) provides an efficient framework for modeling complex dynamics, standard approaches based on a single trained readout often experience reduced accuracy in such non-autonomous settings. We propose a multi-regime RC framework in which multiple readouts are trained under different dynamical conditions and combined through a short observation window to form a trajectory-dependent linear readout. This enables both regime identification and adaptation to unseen or intermediate dynamics. The method is evaluated on a Duffing oscillator with a time-varying forcing input and a Rössler system driven by chaotic forcing from a Chen system. The results show improved prediction accuracy compared to both regime-specific and single global models trained on data aggregated from multiple regimes.
- 1 August 2026
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 36 (8)
Reservoir computing for forecasting non-autonomous dynamics with hidden regime variations
Accurate prediction of nonlinear dynamical systems becomes particularly challenging when the evolution of the dynamics depends on hidden, time-varying factors that are not directly observable. Although reservoir computing (RC) provides an efficient framework for modeling complex dynamics, standard approaches based on a single trained readout often experience reduced accuracy in such non-autonomous settings. We propose a multi-regime RC framework in which multiple readouts are trained under different dynamical conditions and combined through a short observation window to form a trajectory-dependent linear readout. This enables both regime identification and adaptation to unseen or intermediate dynamics. The method is evaluated on a Duffing oscillator with a time-varying forcing input and a Rössler system driven by chaotic forcing from a Chen system. The results show improved prediction accuracy compared to both regime-specific and single global models trained on data aggregated from multiple regimes.
- Open Access
- 27 January 2026
- Published by Springer Nature in Nature Communications
- Vol. 17 (1)
The frequency response of networks as open systems
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}$$ -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.- 27 January 2026
- Published by Springer Nature in Nature Communications
- Vol. 17 (1)
Open AccessThe frequency response of networks as open systems
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}$$ -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. - 1 December 2025
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 35 (12)
Open networks in discrete time: Passing vs blocking behavior
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.
- 1 December 2025
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 35 (12)
Open networks in discrete time: Passing vs blocking behavior
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
Open networks in discrete time: Passing vs blocking behavior
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, using the H2-norm to quantify signal amplification. 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 AccessOpen networks in discrete time: Passing vs blocking behavior
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, using the H2-norm to quantify signal amplification. 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.
- 1 November 2025
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 35 (11)
Constructing directed networks with a desired minimum balanced coloring
Biological, social, and technological networks are made up of many interacting nodes coupled by directed connections. Moreover, the study of empirical networks has shown that often groups of their nodes are “symmetric” to one another, i.e., they are structurally identical to one another within such networks. Many of the popular network-generating algorithms do not control for the emergence of symmetries. Here, we present an algorithm focused on directed networks that enables the user to generate what are called “expanded” directed networks, which transform each node of a base network into a cluster with a desired number of nodes, after checking for the expansion to be feasible. Analytical conditions are provided for an expansion to be feasible and for the generation of the expansion or minimal expansion, i.e., a feasible expansion with the least number of nodes. The algorithm is used to construct synthetic networks with prescribed symmetries.
- 1 November 2025
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 35 (11)
Constructing directed networks with a desired minimum balanced coloring
Biological, social, and technological networks are made up of many interacting nodes coupled by directed connections. Moreover, the study of empirical networks has shown that often groups of their nodes are “symmetric” to one another, i.e., they are structurally identical to one another within such networks. Many of the popular network-generating algorithms do not control for the emergence of symmetries. Here, we present an algorithm focused on directed networks that enables the user to generate what are called “expanded” directed networks, which transform each node of a base network into a cluster with a desired number of nodes, after checking for the expansion to be feasible. Analytical conditions are provided for an expansion to be feasible and for the generation of the expansion or minimal expansion, i.e., a feasible expansion with the least number of nodes. The algorithm is used to construct synthetic networks with prescribed symmetries.
- Open Access
Constructing directed networks with a desired minimum balanced coloring
This work introduces a systematic algorithm for generating directed networks with prescribed symmetries by constructing expansions from a given quotient network. The method enables researchers to synthesize realistic network models with controllable symmetry structure, facilitating studies of symmetry-driven dynamics such as cluster synchronization in biological, social, and technological systems.
Open AccessConstructing directed networks with a desired minimum balanced coloring
This work introduces a systematic algorithm for generating directed networks with prescribed symmetries by constructing expansions from a given quotient network. The method enables researchers to synthesize realistic network models with controllable symmetry structure, facilitating studies of symmetry-driven dynamics such as cluster synchronization in biological, social, and technological systems.
- 10 January 2025
- Published by American Physical Society (APS) in Physical Review E
- Vol. 111 (1) , 014306
Decentralized coupling-when-needed strategy for the synchronization of networked oscillators with delays
A large literature has investigated the stability of the synchronous solution over a chaotic or periodic time evolution, for an arbitrary network of coupled oscillators. Delays may affect the dynamics of an uncoupled oscillator or node-to-node coupling. An important result is that in the presence of small perturbations about the synchronous solution there is a maximum Lyapunov exponent that determines asymptotic stability. However, different regions of a chaotic or periodic attractor have different transverse reactivities, which measure the transient growth of the norm of the perturbations. Knowledge about the reactive characterization of an attractor can be used to implement a control action only when needed and achieve synchronization efficiently, i.e., by reducing the amount of control used. In this paper we consider arbitrary networks of coupled lasers in the presence of self-feedback delay and laser-to-laser communication delays and successfully implement an efficient synchronization strategy, based on knowledge about the reactivity of the attractor.
- 10 January 2025
- Published by American Physical Society (APS) in Physical Review E
- Vol. 111 (1) , 014306
Decentralized coupling-when-needed strategy for the synchronization of networked oscillators with delays
A large literature has investigated the stability of the synchronous solution over a chaotic or periodic time evolution, for an arbitrary network of coupled oscillators. Delays may affect the dynamics of an uncoupled oscillator or node-to-node coupling. An important result is that in the presence of small perturbations about the synchronous solution there is a maximum Lyapunov exponent that determines asymptotic stability. However, different regions of a chaotic or periodic attractor have different transverse reactivities, which measure the transient growth of the norm of the perturbations. Knowledge about the reactive characterization of an attractor can be used to implement a control action only when needed and achieve synchronization efficiently, i.e., by reducing the amount of control used. In this paper we consider arbitrary networks of coupled lasers in the presence of self-feedback delay and laser-to-laser communication delays and successfully implement an efficient synchronization strategy, based on knowledge about the reactivity of the attractor.
- Open Access
- 18 October 2024
- Published by Springer Nature in Nature Communications
- Vol. 15 (1) , 1-13
The efficiency of synchronization dynamics and the role of network syncreactivity
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.
- 18 October 2024
- Published by Springer Nature in Nature Communications
- Vol. 15 (1) , 1-13
Open AccessThe efficiency of synchronization dynamics and the role of network syncreactivity
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.
- Open Access
- 20 June 2024
- Published by Springer Nature in Communications Physics
- Vol. 7 (1) , 1-12
Patterns of synchronized clusters in adaptive networks
Adaptive networks with time-varying connectivity, often called plasticity, provide a fundamental paradigm to model complex dynamical systems. In these systems, different groups of elements frequently exhibit different yet synchronized dynamics within each group. Here we propose a framework to study patterns of synchronous solutions in a large class of plastic networks and derive a general approach to analyze the stability of these solutions. This approach decouples the role of the network topology from that of the dynamic, thus leading to a dimensionality reduction of the stability problem and allowing us to investigate how adaptation affects the emergence of multi-stable patterns of synchronized activity. To illustrate its potentialities, we apply our method to three networks of oscillators, with distinct topology, dynamics, and adaptation rules. Our working framework encompasses a large class of heterogeneous multi-layer dynamical networks, connected (even with delays) via different plastic links, and can have a broad impact on the analysis of complex plastic networks.
- 20 June 2024
- Published by Springer Nature in Communications Physics
- Vol. 7 (1) , 1-12
Open AccessPatterns of synchronized clusters in adaptive networks
Adaptive networks with time-varying connectivity, often called plasticity, provide a fundamental paradigm to model complex dynamical systems. In these systems, different groups of elements frequently exhibit different yet synchronized dynamics within each group. Here we propose a framework to study patterns of synchronous solutions in a large class of plastic networks and derive a general approach to analyze the stability of these solutions. This approach decouples the role of the network topology from that of the dynamic, thus leading to a dimensionality reduction of the stability problem and allowing us to investigate how adaptation affects the emergence of multi-stable patterns of synchronized activity. To illustrate its potentialities, we apply our method to three networks of oscillators, with distinct topology, dynamics, and adaptation rules. Our working framework encompasses a large class of heterogeneous multi-layer dynamical networks, connected (even with delays) via different plastic links, and can have a broad impact on the analysis of complex plastic networks.