Arthur Noronha Montanari
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
Research Subjects
Arthur Noronha Montanari has a total of 33 co-authors. Here are the top co-authors by number of shared publications:
- Adilson E. Motter
Northwestern University
7 shared publications - Luis Antonio Aguirre
Universidade Federal de Minas Gerais
5 shared publications Ana Elisa D. Barioni
Northwestern University
3 shared publications- Chao Duan
School of Electrical Engineering, Xian Jiaotong University, Xian, China
3 shared publications - Jorge Goncalves
Luxembourg Centre for Systems Biomedicine, University of Luxembourg, Belvaux, Luxembourg
3 shared publications Chao Duan
School of Electrical Engineering, Xi’an Jiaotong University, Xi’an, China
2 shared publications
Latest Publications
- 17 September 2026
- Published by American Association for the Advancement of Science (AAAS) in Science
- Vol. 393 (6817) , 1241-1249
Disorder-promoted stability
Previous studies of network dynamics have suggested that heterogeneity among nodes inhibits stability, which is at odds with the ubiquity of inherently heterogeneous natural and engineered systems. Here, we show that this conclusion arises from model reductions introduced for mathematical tractability and breaks down when nodal dynamics are higher-dimensional, yielding non-Hermitian Jacobians. In such systems, including neural, power-grid, and material networks, nodal heterogeneity can instead enhance stability, even when parameters are randomly disordered. Non-Hermiticity also underlies the stabilizing effects of network heterogeneity, which can arise even in one-dimensional nodal dynamics through nonreciprocal interactions, as shown for ecological networks. Our framework reveals disorder not as a liability but as a general resource for stabilizing complex systems.
- 17 September 2026
- Published by American Association for the Advancement of Science (AAAS) in Science
- Vol. 393 (6817) , 1241-1249
Disorder-promoted stability
Previous studies of network dynamics have suggested that heterogeneity among nodes inhibits stability, which is at odds with the ubiquity of inherently heterogeneous natural and engineered systems. Here, we show that this conclusion arises from model reductions introduced for mathematical tractability and breaks down when nodal dynamics are higher-dimensional, yielding non-Hermitian Jacobians. In such systems, including neural, power-grid, and material networks, nodal heterogeneity can instead enhance stability, even when parameters are randomly disordered. Non-Hermiticity also underlies the stabilizing effects of network heterogeneity, which can arise even in one-dimensional nodal dynamics through nonreciprocal interactions, as shown for ecological networks. Our framework reveals disorder not as a liability but as a general resource for stabilizing complex systems.
- 21 August 2026
- Published by American Physical Society (APS) in Physical Review E
- Vol. 114 (2) , L022202
Experimental Kuramoto platform
Phase reduction provides a principled relationship between high-dimensional oscillator dynamics and low-dimensional phase models such as the Kuramoto model. However, connecting analytical results derived from the Kuramoto framework to experimental data remains an open challenge, as many physical platforms violate the weak-coupling assumptions underlying standard phase reduction. Here, we present an experimental platform based on electronic quadrature oscillators whose phase dynamics are, under certain assumptions, equivalent to the Kuramoto model. Crucially, this equivalence is achieved for both weak and strong coupling through a nondiffusive coupling circuit, and the design approach supports arbitrary (weighted and directed) network topologies while preserving scalability and oscillation regularity. Across different coupling schemes, we demonstrate that the platform reliably reproduces phase transitions predicted by the Kuramoto model for both global and cluster synchronization. This cost-effective platform enables systematic experimental validation of analytical and numerical results for synchronization in complex networks.
- 21 August 2026
- Published by American Physical Society (APS) in Physical Review E
- Vol. 114 (2) , L022202
Experimental Kuramoto platform
Phase reduction provides a principled relationship between high-dimensional oscillator dynamics and low-dimensional phase models such as the Kuramoto model. However, connecting analytical results derived from the Kuramoto framework to experimental data remains an open challenge, as many physical platforms violate the weak-coupling assumptions underlying standard phase reduction. Here, we present an experimental platform based on electronic quadrature oscillators whose phase dynamics are, under certain assumptions, equivalent to the Kuramoto model. Crucially, this equivalence is achieved for both weak and strong coupling through a nondiffusive coupling circuit, and the design approach supports arbitrary (weighted and directed) network topologies while preserving scalability and oscillation regularity. Across different coupling schemes, we demonstrate that the platform reliably reproduces phase transitions predicted by the Kuramoto model for both global and cluster synchronization. This cost-effective platform enables systematic experimental validation of analytical and numerical results for synchronization in complex networks.
- 5 November 2025
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 135 (19) , 197401
Interpretable Disorder-Promoted Synchronization and Coherence in Coupled Laser Networks
Coupled lasers offer a promising approach to scaling the power output of photonic devices for applications demanding high frequency precision and beam coherence. However, maintaining coherence among lasers remains a fundamental challenge due to desynchronizing instabilities arising from time delay in the optical coupling. Here, we depart from the conventional notion that disorder is detrimental to synchronization and instead propose an interpretable mechanism through which heterogeneity in the laser parameters can be harnessed to promote synchronization. Our approach allows for stabilization of prespecified synchronous states that, while abundant, are often unstable in systems of identical lasers. The results show that stable synchronization enabling coherence can be frequently achieved by introducing intermediate levels of random mismatches in any of several laser constructive parameters. Our results establish a principled framework for enhancing coherence in large laser networks, offering a robust strategy for power scaling in photonic systems.
- 5 November 2025
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 135 (19) , 197401
Interpretable Disorder-Promoted Synchronization and Coherence in Coupled Laser Networks
Coupled lasers offer a promising approach to scaling the power output of photonic devices for applications demanding high frequency precision and beam coherence. However, maintaining coherence among lasers remains a fundamental challenge due to desynchronizing instabilities arising from time delay in the optical coupling. Here, we depart from the conventional notion that disorder is detrimental to synchronization and instead propose an interpretable mechanism through which heterogeneity in the laser parameters can be harnessed to promote synchronization. Our approach allows for stabilization of prespecified synchronous states that, while abundant, are often unstable in systems of identical lasers. The results show that stable synchronization enabling coherence can be frequently achieved by introducing intermediate levels of random mismatches in any of several laser constructive parameters. Our results establish a principled framework for enhancing coherence in large laser networks, offering a robust strategy for power scaling in photonic systems.
- Open Access
- 31 October 2025
- Published by Springer Nature in Nature Communications
- Vol. 16 (1) , 1-14
Optimal flock formation induced by agent heterogeneity
The study of flocking in biological systems has identified conditions for self-organized collective behavior, inspiring the development of decentralized strategies to coordinate the dynamics of swarms of drones and other autonomous vehicles. Previous research has focused primarily on the role of the time-varying interaction network among agents while assuming that the agents themselves are identical or nearly identical. Here, we depart from this conventional assumption to investigate how inter-individual differences between agents affect stability and convergence in flocking dynamics. We show that flocks of agents with optimally assigned heterogeneous parameters significantly outperform their homogeneous counterparts, achieving 20−40% faster convergence to desired formations across various control tasks. These tasks include target tracking, flock formation, and obstacle maneuvering. In systems with communication delays, heterogeneity can enable convergence even when flocking is unstable for identical agents. Our results challenge existing paradigms in multi-agent control and establish system disorder as an adaptive, distributed mechanism to promote collective behavior in flocking dynamics.
- 31 October 2025
- Published by Springer Nature in Nature Communications
- Vol. 16 (1) , 1-14
Open AccessOptimal flock formation induced by agent heterogeneity
The study of flocking in biological systems has identified conditions for self-organized collective behavior, inspiring the development of decentralized strategies to coordinate the dynamics of swarms of drones and other autonomous vehicles. Previous research has focused primarily on the role of the time-varying interaction network among agents while assuming that the agents themselves are identical or nearly identical. Here, we depart from this conventional assumption to investigate how inter-individual differences between agents affect stability and convergence in flocking dynamics. We show that flocks of agents with optimally assigned heterogeneous parameters significantly outperform their homogeneous counterparts, achieving 20−40% faster convergence to desired formations across various control tasks. These tasks include target tracking, flock formation, and obstacle maneuvering. In systems with communication delays, heterogeneity can enable convergence even when flocking is unstable for identical agents. Our results challenge existing paradigms in multi-agent control and establish system disorder as an adaptive, distributed mechanism to promote collective behavior in flocking dynamics.
- 27 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. PP, 1
Distributed Lyapunov Functions for Nonlinear Networks
Nonlinear networks are often multistable, exhibiting coexisting stable states with competing regions of attraction (ROAs). As a result, ROAs can have complex “tentacle-like” morphologies that are challenging to characterize analytically or computationally. In addition, the high dimensionality of the state space prohibits the automated construction of Lyapunov functions using state-of-the-art optimization methods, such as sum-of-squares (SOS) programming. In this letter, we propose a distributed approach for the construction of Lyapunov functions based solely on local information. To this end, we establish an augmented comparison lemma that characterizes the existence conditions of partial Lyapunov functions, while also accounting for residual effects caused by the associated dimensionality reduction. These theoretical results allow us to formulate an SOS optimization that iteratively constructs such partial functions, whose aggregation forms a composite Lyapunov function. The resulting composite function provides accurate approximations of both the volumes and shapes of the ROAs. We validate our method on networks of van der Pol and Ising oscillators, demonstrating its effectiveness in characterizing high-dimensional systems with non-convex ROAs.
- 27 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. PP, 1
Distributed Lyapunov Functions for Nonlinear Networks
Nonlinear networks are often multistable, exhibiting coexisting stable states with competing regions of attraction (ROAs). As a result, ROAs can have complex “tentacle-like” morphologies that are challenging to characterize analytically or computationally. In addition, the high dimensionality of the state space prohibits the automated construction of Lyapunov functions using state-of-the-art optimization methods, such as sum-of-squares (SOS) programming. In this letter, we propose a distributed approach for the construction of Lyapunov functions based solely on local information. To this end, we establish an augmented comparison lemma that characterizes the existence conditions of partial Lyapunov functions, while also accounting for residual effects caused by the associated dimensionality reduction. These theoretical results allow us to formulate an SOS optimization that iteratively constructs such partial functions, whose aggregation forms a composite Lyapunov function. The resulting composite function provides accurate approximations of both the volumes and shapes of the ROAs. We validate our method on networks of van der Pol and Ising oscillators, demonstrating its effectiveness in characterizing high-dimensional systems with non-convex ROAs.
- Open Access
Optimal flock formation induced by agent heterogeneity
The study of flocking in biological systems has identified conditions for self-organized collective behavior, inspiring the development of decentralized strategies to coordinate the dynamics of swarms of drones and other autonomous vehicles. Previous research has focused primarily on the role of the time-varying interaction network among agents while assuming that the agents themselves are identical or nearly identical. Here, we depart from this conventional assumption to investigate how inter-individual differences between agents affect the stability and convergence in flocking dynamics. We show that flocks of agents with optimally assigned heterogeneous parameters significantly outperform their homogeneous counterparts, achieving 20-40% faster convergence to desired formations across various control tasks. These tasks include target tracking, flock formation, and obstacle maneuvering. In systems with communication delays, heterogeneity can enable convergence even when flocking is unstable for identical agents. Our results challenge existing paradigms in multi-agent control and establish system disorder as an adaptive, distributed mechanism to promote collective behavior in flocking dynamics.
Open AccessOptimal flock formation induced by agent heterogeneity
The study of flocking in biological systems has identified conditions for self-organized collective behavior, inspiring the development of decentralized strategies to coordinate the dynamics of swarms of drones and other autonomous vehicles. Previous research has focused primarily on the role of the time-varying interaction network among agents while assuming that the agents themselves are identical or nearly identical. Here, we depart from this conventional assumption to investigate how inter-individual differences between agents affect the stability and convergence in flocking dynamics. We show that flocks of agents with optimally assigned heterogeneous parameters significantly outperform their homogeneous counterparts, achieving 20-40% faster convergence to desired formations across various control tasks. These tasks include target tracking, flock formation, and obstacle maneuvering. In systems with communication delays, heterogeneity can enable convergence even when flocking is unstable for identical agents. Our results challenge existing paradigms in multi-agent control and establish system disorder as an adaptive, distributed mechanism to promote collective behavior in flocking dynamics.
- 17 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 70 (8) , 5584-5591
Duality Between Controllability and Observability for Target Control and Estimation in Networks
Output controllability and functional observability are properties that enable respectively the control and estimation of part of the state vector. These notions are of utmost importance in applications to high-dimensional systems, such as large-scale networks, in which only a target subset of variables (nodes) is sought to be controlled or estimated. Although the duality between controllability and observability is well established, the characterization of the duality between their generalized counterparts remains an outstanding problem. Here, we establish both the weak and the strong duality between output controllability and functional observability. Specifically, we show that functional observability of a system implies output controllability of a dual system (weak duality), and that under a certain condition the converse holds (strong duality). As an application of the strong duality, we derive a necessary and sufficient condition for target control via static feedback. This allow us to establish a separation principle between the design of target controllers and functional observers in closed-loop systems. These results generalize the classical duality and separation principles in modern control theory.
- 17 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 70 (8) , 5584-5591
Duality Between Controllability and Observability for Target Control and Estimation in Networks
Output controllability and functional observability are properties that enable respectively the control and estimation of part of the state vector. These notions are of utmost importance in applications to high-dimensional systems, such as large-scale networks, in which only a target subset of variables (nodes) is sought to be controlled or estimated. Although the duality between controllability and observability is well established, the characterization of the duality between their generalized counterparts remains an outstanding problem. Here, we establish both the weak and the strong duality between output controllability and functional observability. Specifically, we show that functional observability of a system implies output controllability of a dual system (weak duality), and that under a certain condition the converse holds (strong duality). As an application of the strong duality, we derive a necessary and sufficient condition for target control via static feedback. This allow us to establish a separation principle between the design of target controllers and functional observers in closed-loop systems. These results generalize the classical duality and separation principles in modern control theory.
- Open Access
- 1 June 2024
- Published by Springer Nature in npj Digital Medicine
- Vol. 7 (1) , 1-9
Towards automatic home-based sleep apnea estimation using deep learning
Apnea and hypopnea are common sleep disorders characterized by the obstruction of the airways. Polysomnography (PSG) is a sleep study typically used to compute the Apnea-Hypopnea Index (AHI), the number of times a person has apnea or certain types of hypopnea per hour of sleep, and diagnose the severity of the sleep disorder. Early detection and treatment of apnea can significantly reduce morbidity and mortality. However, long-term PSG monitoring is unfeasible as it is costly and uncomfortable for patients. To address these issues, we propose a method, named DRIVEN, to estimate AHI at home from wearable devices and detect when apnea, hypopnea, and periods of wakefulness occur throughout the night. The method can therefore assist physicians in diagnosing the severity of apneas. Patients can wear a single sensor or a combination of sensors that can be easily measured at home: abdominal movement, thoracic movement, or pulse oximetry. For example, using only two sensors, DRIVEN correctly classifies 72.4% of all test patients into one of the four AHI classes, with 99.3% either correctly classified or placed one class away from the true one. This is a reasonable trade-off between the model’s performance and the patient’s comfort. We use publicly available data from three large sleep studies with a total of 14,370 recordings. DRIVEN consists of a combination of deep convolutional neural networks and a light-gradient-boost machine for classification. It can be implemented for automatic estimation of AHI in unsupervised long-term home monitoring systems, reducing costs to healthcare systems and improving patient care.
- 1 June 2024
- Published by Springer Nature in npj Digital Medicine
- Vol. 7 (1) , 1-9
Open AccessTowards automatic home-based sleep apnea estimation using deep learning
Apnea and hypopnea are common sleep disorders characterized by the obstruction of the airways. Polysomnography (PSG) is a sleep study typically used to compute the Apnea-Hypopnea Index (AHI), the number of times a person has apnea or certain types of hypopnea per hour of sleep, and diagnose the severity of the sleep disorder. Early detection and treatment of apnea can significantly reduce morbidity and mortality. However, long-term PSG monitoring is unfeasible as it is costly and uncomfortable for patients. To address these issues, we propose a method, named DRIVEN, to estimate AHI at home from wearable devices and detect when apnea, hypopnea, and periods of wakefulness occur throughout the night. The method can therefore assist physicians in diagnosing the severity of apneas. Patients can wear a single sensor or a combination of sensors that can be easily measured at home: abdominal movement, thoracic movement, or pulse oximetry. For example, using only two sensors, DRIVEN correctly classifies 72.4% of all test patients into one of the four AHI classes, with 99.3% either correctly classified or placed one class away from the true one. This is a reasonable trade-off between the model’s performance and the patient’s comfort. We use publicly available data from three large sleep studies with a total of 14,370 recordings. DRIVEN consists of a combination of deep convolutional neural networks and a light-gradient-boost machine for classification. It can be implemented for automatic estimation of AHI in unsupervised long-term home monitoring systems, reducing costs to healthcare systems and improving patient care.
- Open Access
Identifiability of Differential-Algebraic Systems
Data-driven modeling of dynamical systems often faces numerous data-related challenges. A fundamental requirement is the existence of a unique set of parameters for a chosen model structure, an issue commonly referred to as identifiability. Although this problem is well studied for ordinary differential equations (ODEs), few studies have focused on the more general class of systems described by differential-algebraic equations (DAEs). Examples of DAEs include dynamical systems with algebraic equations representing conservation laws or approximating fast dynamics. This work introduces a novel identifiability test for models characterized by nonlinear DAEs. Unlike previous approaches, our test only requires prior knowledge of the system equations and does not need nonlinear transformation, index reduction, or numerical integration of the DAEs. We employed our identifiability analysis across a diverse range of DAE models, illustrating how system identifiability depends on the choices of sensors, experimental conditions, and model structures. Given the added challenges involved in identifying DAEs when compared to ODEs, we anticipate that our findings will have broad applicability and contribute significantly to the development and validation of data-driven methods for DAEs and other structure-preserving models.
Open AccessIdentifiability of Differential-Algebraic Systems
Data-driven modeling of dynamical systems often faces numerous data-related challenges. A fundamental requirement is the existence of a unique set of parameters for a chosen model structure, an issue commonly referred to as identifiability. Although this problem is well studied for ordinary differential equations (ODEs), few studies have focused on the more general class of systems described by differential-algebraic equations (DAEs). Examples of DAEs include dynamical systems with algebraic equations representing conservation laws or approximating fast dynamics. This work introduces a novel identifiability test for models characterized by nonlinear DAEs. Unlike previous approaches, our test only requires prior knowledge of the system equations and does not need nonlinear transformation, index reduction, or numerical integration of the DAEs. We employed our identifiability analysis across a diverse range of DAE models, illustrating how system identifiability depends on the choices of sensors, experimental conditions, and model structures. Given the added challenges involved in identifying DAEs when compared to ODEs, we anticipate that our findings will have broad applicability and contribute significantly to the development and validation of data-driven methods for DAEs and other structure-preserving models.
- 27 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 7, 3060-3065
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 for full-state estimation, and vice-versa. For 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 (special cases of output controllability and functional observability for structured systems, respectively). 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.
- 27 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 7, 3060-3065
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 for full-state estimation, and vice-versa. For 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 (special cases of output controllability and functional observability for structured systems, respectively). 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.