Related papers: Network Design for Controllability Metrics
Network geometry, characterized by nodes with associated latent variables, is a fundamental feature of real-world networks. Still, when only the network edges are given, it may be difficult to assess whether the network contains an…
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…
Voltage control generally requires accurate information about the grid's topology in order to guarantee network stability. However, accurate topology identification is challenging for existing methods, especially as the grid is subject to…
This paper introduces a novel control approach for network scheduling and routing that is predictive and reliable in its nature, yet builds upon a linear program, making it fast in execution. First, we describe the canonical system model…
A statistically principled way of conducting weighted network analysis is still lacking. Comparison of different populations of weighted networks is hard because topology is inherently dependent on wiring cost, where cost is defined as the…
Iterative rounding and relaxation have arguably become the method of choice in dealing with unconstrained and constrained network design problems. In this paper we extend the scope of the iterative relaxation method in two directions: (1)…
Many important complex networks, including critical infrastructure and emerging industrial automation systems, are becoming increasingly intricate webs of interacting feedback control loops. A fundamental concern is to quantify the control…
Exact controllability for the wave equation on a metric graph consisting of a cycle and two attached edges is proven. One boundary and one internal control are used. At the internal vertices, delta-prime conditions are satisfied. As a…
One of the most important and well-studied settings for network design is edge-connectivity requirements. This encompasses uniform demands such as the Minimum $k$-Edge-Connected Spanning Subgraph problem ($k$-ECSS), as well as nonuniform…
We consider hypergraph network design problems where the goal is to construct a hypergraph that satisfies certain connectivity requirements. For graph network design problems where the goal is to construct a graph that satisfies certain…
The analysis of networks characterized by links with heterogeneous intensity or weight suffers from two long-standing problems of arbitrariness. On one hand, the definitions of topological properties introduced for binary graphs can be…
In a recent paper, it has been suggested that the controllability of a diffusively coupled complex network, subject to localized feedback loops at some of its vertices, can be assessed by means of a Master Stability Function approach, where…
We consider the scheduling control problem for a family of unitary networks under heavy traffic, with general interarrival and service times, probabilistic routing and infinite horizon discounted linear holding cost. A natural…
We consider a neural network architecture designed to solve inverse problems where the degradation operator is linear and known. This architecture is constructed by unrolling a forward-backward algorithm derived from the minimization of an…
This paper studies a basic model of a dynamical distribution network, where the network topology is given by a directed graph with storage variables corresponding to the vertices and flow inputs corresponding to the edges. We aim at…
This article investigates the problem of controlling linear time-invariant systems subject to time-varying and a priori unknown cost functions, state and input constraints, and exogenous disturbances. We combine the online convex…
In this paper, we propose to study on sufficient control of complex networks which is to control a sufficiently large portion of the network, where only the quantity of controllable nodes matters. To the best of our knowledge, this is the…
For networked systems, the control law is typically subject to network flaws such as delays and packet dropouts. Hence, the time in between updates of the control law varies unexpectedly. Here, we present a stability theorem for nonlinear…
We describe a convex programming approach to the calculation of lower bounds on the minimum cost of constrained decentralized control problems with nonclassical information structures. The class of problems we consider entail the…
The controllability of networks comprising homogeneous multi-input multi-output linear subsystems with linear couplings among them is examined, from a modal perspective. The eigenvalues of the network model are classified into two groups:…