Related papers: Controllability and data-driven identification of …

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…

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…

We present measures, models and link prediction algorithms based on the structural balance in signed social networks. Certain social networks contain, in addition to the usual 'friend' links, 'enemy' links. These networks are called signed…

Bilinear systems emerge in a wide variety of fields as natural models for dynamical systems ranging from robotics to quantum dots. Analyzing controllability of such systems is of fundamental and practical importance, for example, for the…

In this paper, we consider the problem of tuning the edge weights of a networked system described by linear time-invariant dynamics. We assume that the topology of the underlying network is fixed and that the set of feasible edge weights is…

This paper studies the signed networks in the presence of stubborn links, based on the structural balance theory. Each agent in the network has a mixture of positive and negative links represent friendly and antagonistic interactions and…

The modeling of networks, specifically generative models, have been shown to provide a plethora of information about the underlying network structures, as well as many other benefits behind their construction. Recently there has been a…

This paper discusses the controllability problem of complex networks. It is shown that almost any weighted complex network with noise on the strength of communication links is controllable in the sense of Kalman controllability. The concept…

This paper studies consensus problems for multi-agent systems defined on directed graphs where the consensus dynamics involves nonlinear and discontinuous functions. Sufficient conditions, involving the nonlinear functions and the topology…

We review the main tools which allow for the statistical characterization of weighted networks. We then present two case studies, the airline connection network and the scientific collaboration network, which are representative of critical…

We present sufficient conditions under which a given linear nonautonomous system and its nonlinear perturbation are topologically conjugated. Our conditions are of a very general form and provided that the nonlinear perturbations are…

Multiagent systems consist of agents that locally exchange information through a physical network subject to a graph topology. Current control methods for networked multiagent systems assume the knowledge of graph topologies in order to…

Pinning control on complex dynamical networks has emerged as a very important topic in recent trends of control theory due to the extensive study of collective coupled behaviors and their role in physics, engineering and biology. In…

In signed networks, each edge is labeled as either positive or negative. The edge sign captures the polarity of a relationship. Balance of signed networks is a well-studied property in graph theory. In a balanced (sub)graph, the vertices…

We study probabilistic protocols for concurrent threshold-based load balancing in networks. There are n resources or machines represented by nodes in an undirected graph and m >> n users that try to find an acceptable resource by moving…

Complex numbers define the relationship between entities in many situations. A canonical example would be the off-diagonal terms in a Hamiltonian matrix in quantum physics. Recent years have seen an increasing interest to extend the tools…

We recently introduced a formalism for the modeling of temporal networks, that we call stream graphs. It emphasizes the streaming nature of data and allows rigorous definitions of many important concepts generalizing classical graphs. This…

It is well-known that the controllability of finite-dimensional nonlinear systems can be established by showing the controllability of the linearized system. However, this classical result does not generalize to infinite-dimensional…

This paper investigates the non-trivial consensus problem on directed signed matrix-weighted networks\textemdash a novel convergence state that has remained largely unexplored despite prior studies on bipartite consensus and trivial…

What can we learn about controlling a system solely from its underlying network structure? Here we adapt a recently developed framework for control of networks governed by a broad class of nonlinear dynamics that includes the major dynamic…