Related papers: Controllability and Accessibility on Graphs for Bi…
In this paper, controllability of systems defined on graphs is discussed. We consider the problem of controllability of the network for a family of matrices carrying the structure of an underlying directed graph. A one-to-one correspondence…
This paper is concerned with the controllability problem of a connected threshold graph following the Laplacian dynamics. An algorithm is proposed to generate a spanning set of orthogonal Laplacian eigenvectors of the graph from a…
In this paper, we investigate the controllability of bilinear control systems of the form $\dot{s} = As + uBs$, where $s \in \mathbb{S}^2$ and $A, B \in gl(3, \mathbb{R})$ are skew-symmetric matrices. First, we prove that the algebraic…
This paper is devoted to the study of controllability of linear systems on generalized Heisenberg groups. Some general necessary controllability conditions and some sufficient ones are provided. We introduce the notion of decoupled systems,…
In this paper, we examine the controllability of Laplacian dynamic networks on cographs. Cographs appear in modeling a wide range of networks and include as special instances, the threshold graphs. In this work, we present necessary and…
This document explores structural controllability of polynomial dynamical systems or polysystems. We extend Lin's concept of structural controllability for linear systems, offering hypergraph-theoretic methods to rapidly assess strong…
In this paper we investigate a relaxed concept of controllability, known in the literature as herdability, namely the capability of a system to be driven towards the(interior of the) positive orthant. Specifically, we investigate…
We consider a bilinear control problem for the wave equation on a torus of arbitrary dimension. We show that the system is globally approximately controllable in arbitrarily small times from a dense family of initial states. The control…
This paper studies the structural controllability of a class of uncertain switched linear systems, where the parameters of subsystems state matrices are either unknown or zero. The structural controllability is a generalization of the…
Global control offers a promising route to scalable quantum computing. A recent conjecture by Hu et al. (arXiv:2508.19075) proposes that any connected qubit graph equipped with global Ising-type interactions and tunable global transverse…
In this paper, we analyze the chain control sets of linear control systems on connected Lie groups. Our main result shows that the compactness of the central subgroup associated with the drift is a necessary and sufficient condition to…
We investigate the controllability of an infinite-dimensional quantum system: a quantum particle confined on a Thick Quantum Graph, a generalisation of Quantum Graphs whose edges are allowed to be manifolds of arbitrary dimension with…
In this work, we study the controllability of the bilinear Schr\"odinger equation on infinite graphs for periodic quantum states. We consider the bilinear Schr\"odinger equation $i\partial_t\psi=-\Delta\psi+u(t)B\psi$ in the Hilbert space…
In this paper, we investigate the controllability of a class of formation control systems. Given a directed graph, we assign an agent to each of its vertices and let the edges of the graph describe the information flow in the system. We…
One version of the concept of structural controllability defined for single-input systems by Lin and subsequently generalized to multi-input systems by others, states that a parameterized matrix pair $(A, B)$ whose nonzero entries are…
We prove that a connected, locally finite, quasi-transitive graph which is quasi-isometric to a planar graph is necessarily accessible. This leads to a complete classification of the finitely generated groups which are quasi-isometric to…
The controllability condition for finite dimensional quantum systems, the Lie Algebra Rank Condition, has been stated assuming that the right invariant differential system under consideration is bilinear. We remark that this assumption is…
Using techniques from the theory of von Neumann algebras, we propose a framework for addressing questions of controllability of bilinear systems on infinite dimensional Hilbert spaces. In the setup, we assume only that the drift and control…
We investigate the universality of multi-spin systems in architectures of various symmetries of coupling type and topology. Explicit reachability sets under symmetry constraints are provided. Thus for a given (possibly symmetric)…
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…