Related papers: Structural Controllability of Undirected Diffusive…
This paper considers the notion of herdability, a set-based reachability condition, which asks whether the state of a system can be controlled to be element-wise larger than a non-negative threshold. The basic theory of herdable systems is…
In this paper we consider the problem of controlling a limited number of target nodes of a network. Equivalently, we can see this problem as controlling the target variables of a structured system, where the state variables of the system…
Some necessary and sufficient conditions are obtained for the controllability and observability of a networked system with linear time invariant (LTI) dynamics. The topology of this system is fixed but arbitrary, and every subsystem is…
The paper introduces and solves a structural controllability problem for continuum ensembles of linear time-invariant systems. All the individual linear systems of an ensemble are sparse, governed by the same sparsity pattern.…
This paper studies the problem of controlling complex networks, that is, the joint problem of selecting a set of control nodes and of designing a control input to steer a network to a target state. For this problem (i) we propose a metric…
In this paper, we study networks of discrete-time linear time-invariant subsystems. Our focus is on situations where subsystems are connected to each other through a time-invariant topology and where there exists a base-station whose aim is…
Social networks inherently exhibit complex relationships that can be positive or negative, as well as directional. Understanding balance in these networks is crucial for unraveling social dynamics, yet traditional theories struggle to…
The paradigm of layered networks is used to describe many real-world systems -- from biological networks, to social organizations and transportation systems. Recently there has been much progress in understanding the general properties of…
We present and analyze a topologically induced transition from ordered, synchronized to disordered dynamics in directed networks of oscillators. The analysis reveals where in the space of networks this transition occurs and its underlying…
We explore the behaviour of chaotic oscillators in hierarchical networks coupled to an external chaotic system whose intrinsic dynamics is dissimilar to the other oscillators in the network. Specifically, each oscillator couples to the…
We propose a conceptually novel method of reconstructing the topology of dynamical networks. By examining the correlation between the variable of one node and the derivative of another node, we derive a simple matrix equation yielding the…
This paper explores the structural controllability of switched linear continuous-time systems. It first identifies a gap in the proof for a pivotal criterion for the structural controllability of switched linear systems in the literature.…
We study synchronization and consensus in a group of dynamical systems coupled via multiple directed networks. We show that even though the coupling in a single network may not be sufficient to synchronize the systems, combination of…
This paper addresses the challenge of network synchronization under limited communication, involving heterogeneous agents with different dynamics and various network topologies, to achieve consensus. We investigate the distributed adaptive…
Multi-stability is a widely observed phenomenon in real complex networked systems, such as technological infrastructures, ecological systems, gene regulation, transportation and more. When a system functions normally but there exists also a…
In this paper we consider complex dynamical networks modeled by means of state space systems running in discrete time. We assume that the dependency structure of the variables within the (nonlinear) network equations is known and use…
A new complex network model, called q-snapback network, is introduced. Basic topological characteristics of the network, such as degree distribution, average path length, clustering coefficient and Pearson correlation coefficient, are…
We study distributed computation in synchronous dynamic networks where an omniscient adversary controls the unidirectional communication links. Its behavior is modeled as a sequence of directed graphs representing the active (i.e. timely)…
In weighted graphs the shortest path between two nodes is often reached through an indirect path, out of all possible connections, leading to structural redundancies which play key roles in the dynamics and evolution of complex networks. We…
This paper explores the conditions for determining fixed nodes in structured networks, specifically focusing on directed acyclic graphs (DAGs). We introduce several necessary and sufficient conditions for determining fixed nodes in…