Related papers: Global Uniform Ultimate Boundedness of Semi-Passiv…
This paper studies zeros of networked linear systems with time-invariant interconnection topology. While the characterization of zeros is given for both heterogeneous and homogeneous networks, homogeneous networks are explored in greater…
Quantifying the eigenvalue spectra of large random matrices allows one to understand the factors that contribute to the stability of dynamical systems with many interacting components. This work explores the effect that the interaction…
In this two-part paper, we identify a broad class of decentralized output-feedback LQG systems for which the optimal control strategies have a simple intuitive estimation structure and can be computed efficiently. Roughly, we consider the…
We study the inverse eigenvector centrality problem on connected undirected graphs, namely, whether a given positive vector can be realized by assigning suitable edge weights. We provide a complete characterization in terms of stable sets…
It has been previously shown by the authors that a directed graph on a linearly ordered set of edges (ordered graph) with adjacent unique source and sink (bipolar digraph) has a unique fully optimal spanning tree, that satisfies a simple…
We consider the problem of optimizing the interconnection graphs of complex networks to promote synchronization. When traditional optimization methods are inapplicable, due to uncertain or unknown node dynamics, we propose a data-driven…
This paper deals with linear algebraic equations where the global coefficient matrix and constant vector are given respectively, by the summation of the coefficient matrices and constant vectors of the individual agents. Our approach is…
In this paper we deal with the notion of the effective impedance of AC networks consisting of resistances, coils and capacitors. Mathematically such a network is a locally finite graph whose edges are endowed with complex-valued weights…
We consider a class of optimal control problems on networks that generically permits a reduction to a universal set of reference problems without differential constraints that may be solved analytically. The derivation shows that input…
We consider a control system with dynamics which are affine in the (unbounded) derivative of the control $u$. We introduce a notion of generalized solution $x$ on $[0,T]$ for controls $u$ of bounded total variation on $[0,t]$ for every…
Graph-theoretic tools and techniques have seen wide use in the multi-agent systems literature, and the unpredictable nature of some multi-agent communications has been successfully modeled using random communication graphs. Across both…
We study the stability of coupled impedance passive regular linear systems under power-preserving interconnections. We present new conditions for strong, exponential, and non-uniform stability of the closed-loop system. We apply the…
The behavior of complex systems is determined not only by the topological organization of their interconnections but also by the dynamical processes taking place among their constituents. A faithful modeling of the dynamics is essential…
During the past decades significant efforts have been made to propose data structures for answering connectivity queries on fully dynamic graphs, i.e., graphs with frequent insertions and deletions of edges. However, a comprehensive…
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…
In this paper, we study finite-time state consensus problems for continuous nonlinear multi-agent systems. Building on the theory of finite-time Lyapunov stability, we propose sufficient criteria which guarantee the system to reach a…
We present the main concepts and results for Graph Directed Markov Systems that have a finitely irreducible incidence matrix. We then see how these results change when the incidence matrix is not assumed to be finitely irreducible.
Consensus over networked agents is typically studied using undirected or directed communication graphs. Undirected graphs enforce symmetry in information exchange, leading to convergence to the average of initial states, while directed…
We introduce a broad class of equations that are described by a graph, which includes many well-studied systems. For these, we show that the number of solutions (or the dimension of the solution set) can be bounded by studying certain…
We consider a basic model of a dynamical distribution network, modeled as a directed graph with storage variables corresponding to every vertex and flow inputs corresponding to every edge, subject to unknown but constant inflows and…