Related papers: On the Controllability of Matrix-weighted Networks
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…
Network theory provides a rich toolbox consisting of methods, measures, and models for studying the structure and dynamics of complex systems found in nature, society, or technology. Recently, it has been pointed out that many real-world…
In this paper, we study the well-posedness and approximate controllability of a class of network systems having delays and controls at the boundary conditions. The particularity of this work is that the network system is defined on infinite…
Robust control theory has been successfully applied to numerous real-world problems using a small set of devices called {\it controllers}. However, the real systems represented by networks contain unreliable components and modern robust…
Weight thresholding is a simple technique that aims at reducing the number of edges in weighted networks that are otherwise too dense for the application of standard graph theoretical methods. We show that the group structure of real…
The importance of studying properties of networks is manifest in diverse fields ranging from biology, engineering, physics, chemistry, neuroscience, and medicine. The functionality of networks with regard to performance, throughput,…
We investigate graphs that can be disconnected into small components by removing a vanishingly small fraction of their vertices. We show that when a quantum network is described by such a graph, the network is efficiently controllable, in…
The classical notions of structural controllability and structural observability are receiving increasing attention in Network Science, since they provide a mathematical basis to answer how the network structure of a dynamic system affects…
This paper deals with strong structural controllability of structured networks. A structured network is a family of structured systems (called node systems) that are interconnected by means of a structured interconnection law. The node…
Given any complex directed network, a set of acyclic subgraphs - the hierarchical backbone of the network - can be extracted that will provide valuable information about its hierarchical structure. The current paper presents how the…
We study the question of reconstructing a weighted, directed network up to isomorphism from its motifs. In order to tackle this question we first relax the usual (strong) notion of graph isomorphism to obtain a relaxation that we call weak…
Controllability of complex networks arises in many technological problems involving social, financial, road, communication, and smart grid networks. In many practical situations, the underlying topology might change randomly with time, due…
Two competing types of interactions often play an important part in shaping system behavior, such as activatory or inhibitory functions in biological systems. Hence, signed networks, where each connection can be either positive or negative,…
This work considers the robustness of uncertain consensus networks. The first set of results studies the stability properties of consensus networks with negative edge weights. We show that if either the negative weight edges form a cut in…
In this paper, we consider the $\mathcal{H}_2$-norm of networked systems with multi-time scale consensus dynamics and vector-valued agent states. This allows us to explore how measurement and process noise affect consensus on…
Topological metrics of graphs provide a natural way to describe the prominent features of various types of networks. Graph metrics describe the structure and interplay of graph edges and have found applications in many scientific fields. In…
Most real-world networks display not only a heterogeneous distribution of degrees, but also a heterogeneous distribution of weights in the strengths of the connections. Each of these heterogeneities alone has been shown to suppress…
We propose a geometric growth model for weighted scale-free networks, which is controlled by two tunable parameters. We derive exactly the main characteristics of the networks, which are partially determined by the parameters. Analytical…
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…
Scale-free (SF) networks and small world networks have been found to occur in very diverse contexts. It is this striking universality which makes one look for widely applicable mechanisms which lead to the formation of such networks. In…