Related papers: Zero forcing sets and controllability of dynamical…
This paper begins the study of reconfiguration of zero forcing sets, and more specifically, the zero forcing graph. Given a base graph $G$, its zero forcing graph, $\mathscr{Z}(G)$, is the graph whose vertices are the minimum zero forcing…
The zero forcing number and the positive zero forcing number of a graph are two graph parameters that arise from two types of graph colourings. The zero forcing number is an upper bound on the minimum number of induced paths in the graph,…
In this paper, controllability of undirected networked systems with {diffusively coupled subsystems} is considered, where each subsystem is of {identically {\emph{fixed}}} general high-order single-input-multi-output dynamics. The…
Structural controllability has been proposed as an analytical framework for making predictions regarding the control of complex networks across myriad disciplines in the physical and life sciences (Liu et al., Nature:473(7346):167-173,…
Controlling complex networks is of paramount importance in science and engineering. Despite the recent development of structural-controllability theory, we continue to lack a framework to control undirected complex networks, especially…
The controllability of networked sampled-data systems with zero-order holders on the control and transmission channels is explored, where single- and multi-rate sampling patterns are considered, respectively. The effects of sampling on the…
This paper presents conditions for establishing topological controllability in undirected networks of diffusively coupled agents. Specifically, controllability is considered based on the signs of the edges (negative, positive or zero). Our…
This paper investigates the robustness of strong structural controllability for linear time-invariant and linear time-varying directed networks with respect to structural perturbations, including edge deletions and additions. In this…
For arrays of identical linear systems coupled through relative actuation four problems are studied: controllability, positive controllability, pairwise controllability, and positive pairwise controllability. To this end, related to the…
Temporal networks are a class of time-varying networks, which change their topology according to a given time-ordered sequence of static networks (known as subsystems). This paper investigates the reachability and controllability of…
Zero forcing is a propagation process on a graph, or digraph, defined in linear algebra to provide a bound for the minimum rank problem. Independently, zero forcing was introduced in physics, computer science and network science, areas…
This paper considers the problem of minimal control inputs to affect the system states such that the resulting system is structurally controllable. This problem and the dual problem of minimal observability are claimed to have no…
In this paper, we propose computational approaches for the zero forcing problem, the connected zero forcing problem, and the problem of forcing a graph within a specified number of timesteps. Our approaches are based on a combination of…
Zero forcing and power domination are iterative processes on graphs where an initial set of vertices are observed, and additional vertices become observed based on some rules. In both cases, the goal is to eventually observe the entire…
In this paper, a necessary and sufficient condition for the controllability of networked systems with heterogeneous dynamics is established where the nodes are higher dimensional linear time invariant systems and the network topology is…
In this paper, we study graphical conditions for structural controllability and accessibility of drifted bilinear systems over Lie groups. We consider a bilinear control system with drift and controlled terms that evolves over the special…
In this paper, we investigate the controllability of a linear time-invariant network following a Laplacian dynamics defined on a threshold graph. In this direction, an algorithm for deriving the modal matrix associated with the Laplacian…
Influence diagram is a graphical representation of belief networks with uncertainty. This article studies the structural properties of a probabilistic model in an influence diagram. In particular, structural controllability theorems and…
Zero forcing number has recently become an interesting graph parameter studied in its own right since its introduction by the "AIM Minimum Rank -- Special Graphs Work Group", whereas metric dimension is a well-known graph parameter. We…
Zero forcing is an iterative graph coloring process where at each discrete time step, a colored vertex with a single uncolored neighbor forces that neighbor to become colored. The zero forcing number of a graph is the cardinality of the…