Related papers: Controllability of Hypergraphs
In this paper, we study the robustness of network topologies. We use the concept of percolation as measuring tool to assess the reliability polynomial of those systems which can be modeled as a general inhomogeneous random graph as well as…
A necessary and sufficient condition is derived for the controllability of Kronecker product networks, where the factor networks are general directed graphs. The condition explicitly illustrates how the controllability of the factor…
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…
This paper addresses questions regarding controllability for `generic parameter' dynamical systems, i.e. the question whether a dynamical system is `structurally controllable'. Unlike conventional methods that deal with structural…
Heterogeneous graph convolutional networks have gained great popularity in tackling various network analytical tasks on heterogeneous network data, ranging from link prediction to node classification. However, most existing works ignore the…
Accurate temporal segmentation of human actions is critical for intelligent robots in collaborative settings, where a precise understanding of sub-activity labels and their temporal structure is essential. However, the inherent noise in…
Most existing neural networks for learning graphs address permutation invariance by conceiving of the network as a message passing scheme, where each node sums the feature vectors coming from its neighbors. We argue that this imposes a…
Heterogeneous Graph Neural Networks (HGNNs) have exhibited powerful performance in heterogeneous graph learning by aggregating information from various types of nodes and edges. However, existing heterogeneous graph models often struggle to…
Applying neural networks as controllers in dynamical systems has shown great promises. However, it is critical yet challenging to verify the safety of such control systems with neural-network controllers in the loop. Previous methods for…
An increasing number of complex systems are now modeled as networks of coupled dynamical entities. Nonlinearity and high-dimensionality are hallmarks of the dynamics of such networks but have generally been regarded as obstacles to control.…
This paper deals with controllability of dynamical networks. It is often unfeasible or unnecessary to fully control large-scale networks, which motivates the control of a prescribed subset of agents of the network. This specific form of…
Recent 2D-to-3D human pose estimation works tend to utilize the graph structure formed by the topology of the human skeleton. However, we argue that this skeletal topology is too sparse to reflect the body structure and suffer from serious…
A new concept of weighted pair graphs (WPGs) is proposed to represent a new reconstructibility definition for Boolean control networks (BCNs), which is a generalization of the reconstructibility definition given in [Fornasini & Valcher,…
In this work we develop a numerical method for solving a type of convex graph-structured tensor optimization problems. This type of problems, which can be seen as a generalization of multi-marginal optimal transport problems with…
In this paper, we consider the distributed optimal control problem for discrete-time linear networked systems. In particular, we are interested in learning distributed optimal controllers using graph recurrent neural networks (GRNNs). Most…
Recently, graph Convolutional Neural Networks (graph CNNs) have been widely used for graph data representation and semi-supervised learning tasks. However, existing graph CNNs generally use a fixed graph which may be not optimal for…
In this paper, we propose a novelty-based metric for quantitative characterization of the controllability of complex networks. This inherently bounded metric describes the average angular separation of an input with respect to the past…
Learning-based methods could provide solutions to many of the long-standing challenges in control. However, the neural networks (NNs) commonly used in modern learning approaches present substantial challenges for analyzing the resulting…
Learning representation for graph classification turns a variable-size graph into a fixed-size vector (or matrix). Such a representation works nicely with algebraic manipulations. Here we introduce a simple method to augment an attributed…
We study distributed control of networked systems through reinforcement learning, where neural policies must be simultaneously scalable, expressive and stabilizing. We introduce a policy parameterization that embeds Graph Neural Networks…