Related papers: A Unifying Framework for Strong Structural Control…
This paper addresses problems on the structural design of control systems taking explicitly into consideration the possible application to large-scale systems. We provide an efficient and unified framework to solve the following major…
Efficient resource allocation is one of the main driving forces of human civilizations. Of the many existing approaches to resource allocation, matrix completion is one that is frequently applied. In this paper, we investigate a special…
We introduce a new class of large structured random matrices characterized by four fundamental properties which we discuss. We prove that this class is stable under matrix-valued and pointwise non-linear operations. We then formulate an…
A sparsity pattern in $\mathbb{R}^{n \times m}$, for $m\geq n$, is a vector subspace of matrices admitting a basis consisting of canonical basis vectors in $\mathbb{R}^{n \times m}$. We represent a sparsity pattern by a matrix with…
In a "structured system" of equations, each equation depends on a specified subset of the variables. In this article, we explore properties common to "almost every" system with a fixed structure and how the properties can be read from the…
The lack of studying the complex organization of directed network usually limits to the understanding of underlying relationship between network structures and functions. Structural controllability and structural predictability, two…
This paper studies the open problem of conformalized entry prediction in a row/column-exchangeable matrix. The matrix setting presents novel and unique challenges, but there exists little work on this interesting topic. We meticulously…
The problem of determining whether a diagonally dominant matrix is singular or nonsingular is a classical topic in matrix theory. This paper develops necessary and sufficient conditions for the singularity or nonsingularity of diagonally…
This paper considers the structure of uncertain linear systems building on concepts of robust unobservability and possible controllability which were introduced in previous papers. The paper presents a new geometric characterization of the…
Constraint Satisfaction Problem (CSP) is a fundamental algorithmic problem that appears in many areas of Computer Science. It can be equivalently stated as computing a homomorphism $\mbox{$\bR \rightarrow \bGamma$}$ between two relational…
This paper considers the notion of herdability, a set-based reachability condition, which asks whether the state of a system can be controlled to be element-wise larger than a non-negative threshold. The basic theory of herdable systems is…
Symmetries are an essential feature of complex networks as they regulate how the graph collective dynamics organizes into clustered states. We here show how to control network symmetries, and how to enforce patterned states of…
In this paper we investigate the controllability and observability properties of a family of linear dynamical systems, whose structure is induced by the Laplacian of a grid graph. This analysis is motivated by several applications in…
What can we learn about controlling a system solely from its underlying network structure? Here we adapt a recently developed framework for control of networks governed by a broad class of nonlinear dynamics that includes the major dynamic…
A deductive system is structurally complete if its admissible inference rules are derivable. For several important systems, like modal logic S5, failure of structural completeness is caused only by the underivability of passive rules, i.e.…
In this paper we introduce the concept of universal stabilizability: the condition that every solution of a nonlinear system can be globally stabilized. We give sufficient conditions in terms of the existence of a control contraction…
Signed networks have been a topic of recent interest in the network control community as they allow studying antagonistic interactions in multi-agent systems. Although dynamical characteristics of signed networks have been well-studied,…
To understand the controllability of complex networks is a forefront problem relevant to different fields of science and engineering. Despite recent advances in network controllability theories, an outstanding issue is to understand the…
Graph learning from data represents a canonical problem that has received substantial attention in the literature. However, insufficient work has been done in incorporating prior structural knowledge onto the learning of underlying…
Graph rewrite formalisms are a powerful approach to modeling complex molecular systems. They capture the intrinsic concurrency of molecular interactions, thereby enabling a formal notion of mechanism (a partially ordered set of events) that…