Related papers: Controllability of Bandlimited Graph Processes Ove…
The graph identification problem consists of discovering the interactions among nodes in a network given their state/feature trajectories. This problem is challenging because the behavior of a node is coupled to all the other nodes by the…
We study the target control problem of asynchronous Boolean networks, to identify a set of nodes, the perturbation of which can drive the dynamics of the network from any initial state to the desired steady state (or attractor). We are…
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…
This letter examines the controllability of consensus dynamics on matrix-weighed networks from a graph-theoretic perspective. Unlike the scalar-weighted networks, the rank of weight matrix introduces additional intricacies into…
Network controllability measures how well a networked system can be controlled to a target state, and its robustness reflects how well the system can maintain the controllability against malicious attacks by means of node-removals or…
Many real-world complex systems, such as epidemic spreading networks and ecosystems, can be modeled as networked dynamical systems that produce multivariate time series. Learning the intrinsic dynamics from observational data is pivotal for…
Nonlinear networked systems are of interest in several areas of research, such as multi-agent systems and social networks. In this paper, we examine the controllability of several classes of nonlinear networked dynamics on which the…
Graph models provide efficient tools to capture the underlying structure of data defined over networks. Many real-world network topologies are subject to change over time. Learning to model the dynamic interactions between entities in such…
Symmetries are ubiquitous in network systems and have profound impacts on the observable dynamics. At the most fundamental level, many synchronization patterns are induced by underlying network symmetry, and a high degree of symmetry is…
Graph filters are a staple tool for processing signals over graphs in a multitude of downstream tasks. However, they are commonly designed for graphs with a fixed number of nodes, despite real-world networks typically grow over time. This…
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…
We address the problem of computing a Minimal Dominating Set in highly dynamic distributed systems. We assume weak connectivity, i.e., the network may be disconnected at each time instant and topological changes are unpredictable. We make…
Dynamical processes taking place on networks have received much attention in recent years, especially on various models of random graphs (including small world and scale free networks). They model a variety of phenomena, including the…
Over the past decades, network systems have surged in significance, driven by merging technological advancements. These systems play pivotal roles in diverse applications ranging from autonomous driving to smart grids, yet they confront…
This paper presents methods to analyze functional brain networks and signals from graph spectral perspectives. The notion of frequency and filters traditionally defined for signals supported on regular domains such as discrete time and…
Despite significant advancement in technology, communication and computational failures are still prevalent in safety-critical engineering applications. Often, networked control systems experience packet dropouts, leading to open-loop…
Optimization problems over dynamic networks have been extensively studied and widely used in the past decades to formulate numerous real-world problems. However, (1) traditional optimization-based approaches do not scale to large networks,…
This paper examines the structural controllability for a group of agents, called followers, connected to each other based on the consensus law under commands of multiple leaders, which are agents with superior capabilities, over a fixed…
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…
In this Letter we propose a method to control a set of arbitrary nodes in a directed network such that they follow a synchronous trajectory which is, in general, not shared by the other units of the network. The problem is inspired to those…