相关论文: Laplacian Dynamics on Cographs: Controllability An…

The quantification of controllability and observability has recently received new interest in the context of large, complex networks of dynamical systems. A fundamental but computationally difficult problem is the placement or selection of…

We consider the problem of controlling a partially-observed dynamic process on a graph by a limited number of interventions. This problem naturally arises in contexts such as scheduling virus tests to curb an epidemic; targeted marketing in…

This paper deals with dynamical networks for which the relations between node signals are described by proper transfer functions and external signals can influence each of the node signals. We are interested in graph-theoretic conditions…

In this paper, structural properties of chordal graphs are analysed, in order to establish a relationship between these structures and integer Laplacian eigenvalues. We present the characterization of chordal graphs with equal vertex and…

Graph Laplacian learning, also known as network topology inference, is a problem of great interest to multiple communities. In Gaussian graphical models (GM), graph learning amounts to endowing covariance selection with the Laplacian…

The spectrum of the normalized Laplacian matrix cannot determine the number of edges in a graph, however finding constructions of cospectral graphs with differing number of edges has been elusive. In this paper we use basic properties of…

This paper studies the problem of selecting input nodes (leaders) to make networks strong structurally controllable despite misbehaving nodes and edges. We utilize a graph-based characterization of network strong structural controllability…

Network interactions that are nonlinear in the state of more than two nodes - also known as higher-order interactions - can have a profound impact on the collective network dynamics. Here we develop a coupled cell hypernetwork formalism to…

The controllability and observability of Boolean control network(BCN) are two fundamental properties. But the verification of latter is much harder than the former. This paper considers the observability of BCN via controllability. First,…

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 propose a structure-preserving model-reduction methodology for large-scale dynamic networks with tightly-connected components. First, the coherent groups are identified by a spectral clustering algorithm on the graph Laplacian matrix…

This paper studies structural controllability for a networked dynamic system (NDS), in which each subsystem may have different dynamics, and unknown parameters may exist both in subsystem dynamics and in subsystem interconnections. In…

Laplacian dynamics on a signless graph characterize a class of linear interactions, where pairwise cooperative interactions between all agents lead to the convergence to a common state. On a structurally balanced signed graph, the agents…

This paper studies the controllability of networked multi-input-multi-output (MIMO) systems, in which the network topology is weighted and directed, and the nodes are heterogeneous higher-dimensional linear time-invariant (LTI) dynamical…

This paper studies the controllability of networked relative coupling systems (NRCSs), in which subsystems are of fixed high-order linear dynamics and coupled through relative variables depending on their neighbors, from a structural…

We consider networks of massive particles connected by non-linear springs. Some particles interact with heat baths at different temperatures, which are modeled as stochastic driving forces. The structure of the network is arbitrary, but the…

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…

We show that the steady-state variance as a performance measure for a class of networked linear control systems is expressible as the summation of a rational function over the Laplacian eigenvalues of the network graph. Moreover, we…

There is a deep and interesting connection between the topological properties of a graph and the behaviour of the dynamical system defined on it. We analyse various kind of graphs, with different contrasting connectivity or degree…

Let $G$ be a graph on $n$ vertices with adjacency matrix $A$, and let $\mathbf{1}$ be the all-ones vector. We call $G$ controllable if the set of vectors $\mathbf{1}, A\mathbf{1}, \dots, A^{n-1}\mathbf{1}$ spans the whole space…