English
Related papers

Related papers: Partial containment control over signed graphs

200 papers

This paper studies symmetric constrained linear-quadratic optimal control problems and their parametric solutions. The parametric solution of such a problem is a piecewise-affine feedback law that can be equivalently expressed as a set of…

Optimization and Control · Mathematics 2023-03-22 Ruth Mitze , Michal Kvasnica , Martin Mönnigmann

This paper addresses the security allocation problem within networked control systems, which consist of multiple interconnected control systems under the influence of two opposing agents: a defender and a malicious adversary. The adversary…

Systems and Control · Electrical Eng. & Systems 2026-03-31 Anh Tung Nguyen , Andreas Hertzberg , André MH Teixeira

This paper presents a combinatorial study of the power contamination problem, a dynamic variant of power domination modeled on grid graphs. We resolve a conjecture posed by Ainouche and Bouroubi (2021) by proving it is false and instead…

Combinatorics · Mathematics 2026-04-10 El-Mehdi Mehiri , Mohammed L. Nadji

Joint time-vertex graph signals are pervasive in real-world. This paper focuses on the fundamental problem of sampling and reconstruction of joint time-vertex graph signals. We prove the existence and the necessary condition of a critical…

Signal Processing · Electrical Eng. & Systems 2019-11-20 Junhao Yu , Xuan Xie , Hui Feng , Bo Hu

In this paper we consider graph-coloring problems, an important subset of general constraint satisfaction problems that arise in wireless resource allocation. We constructively establish the existence of fully decentralized learning-based…

Networking and Internet Architecture · Computer Science 2015-06-11 Alessandro Checco , Douglas Leith

We consider the minimum weight and smallest weight minimum-size dominating set problems in vertex-weighted graphs and networks. The latter problem is a two-objective optimization problem, which is different from the classic minimum weight…

Combinatorics · Mathematics 2024-01-23 Lukas Dijkstra , Andrei Gagarin , Vadim Zverovich

We prove the following result: If $G$ be a connected graph on $n \ge 6$ vertices, then there exists a set of vertices $D$ with $|D| \le \frac{n}{3}$ and such that $V(G) \setminus N[D]$ is an independent set, where $N[D]$ is the closed…

Combinatorics · Mathematics 2015-05-01 Yair Caro , Adriana Hansberg

A signed graph is a graph where each edge receives a sign, positive or negative. The signed graph model has been used in many real applications, such as protein complex discovery and social network analysis. Finding cohesive subgraphs in…

Databases · Computer Science 2024-06-25 Lantian Xu , Rong-Hua Li , Dong Wen , Qiangqiang Dai , Guoren Wang , Lu Qin

We present an analysis of the transductive node classification problem, where the underlying graph consists of communities that agree with the node labels and node features. For node classification, we propose a novel optimization problem…

Machine Learning · Computer Science 2025-08-29 Firooz Shahriari-Mehr , Javad Aliakbari , Alexandre Graell i Amat , Ashkan Panahi

The aim of this paper is to shed light on the problem of controlling a complex network with minimal control energy. We show first that the control energy depends on the time constant of the modes of the network, and that the closer the…

Systems and Control · Computer Science 2018-03-12 Gustav Lindmark , Claudio Altafini

The purpose of this article is to study a stochastic control problem on a junction, with control at the junction point. The problem of control is formulated in the weak sense, using a relaxed control, namely a control which takes values in…

Optimization and Control · Mathematics 2023-11-28 Isaac Ohavi

In this paper some results about the controllability of spectral centrality in a complex network are presented. In particular, the inverse problem of designing an unweigthed graph with a prescribed centrality is considered, by showing that…

Physics and Society · Physics 2022-11-23 Esther Garcia , Miguel Romance

In a graph $G=(V,E)$ with no isolated vertex, a dominating set $D \subseteq V$, is called a semitotal dominating set if for every vertex $u \in D$ there is another vertex $v \in D$, such that distance between $u$ and $v$ is at most two in…

Combinatorics · Mathematics 2021-09-07 Vikash Tripathi , Arti Pandey , Anil Maheshwari

This work discusses the finite element discretization of an optimal control problem for the linear wave equation with time-dependent controls of bounded variation. The main focus lies on the convergence analysis of the discretization…

Optimization and Control · Mathematics 2019-07-26 Sebastian Engel , Philip Trautmann , Boris Vexler

Identifying the nodes that must be directly controlled to steer a network along a desired trajectory remains an open problem for digraphs, and even more so for hypergraphs. In this manuscript, we investigate network systems coupled via…

Mathematical Physics · Physics 2026-03-17 Fabio Della Rossa , Davide Liuzza , Francesco Lo Iudice , Pietro De Lellis

Previously, the controllability problem of a linear time-invariant dynamical system was mapped to the maximum matching (MM) problem on the bipartite representation of the underlying directed graph, and the sizes of MMs on random bipartite…

Physics and Society · Physics 2019-01-18 Jin-Hua Zhao , Hai-Jun Zhou

We present an approach for accelerating nonlinear model predictive control. If the current optimal input signal is saturated, also the optimal signals in subsequent time steps often are. We propose to use the open-loop optimal input signals…

Optimization and Control · Mathematics 2020-09-15 Raphael Dyrska , Ruth Mitze , Martin Mönnigmann

In remote control, efficient compression or representation of control signals is essential to send them through rate-limited channels. For this purpose, we propose an approach of sparse control signal representation using the compressive…

Systems and Control · Computer Science 2015-06-16 Masaaki Nagahara , Takahiro Matsuda , Kazunori Hayashi

We consider optimal control problems for partial differential equations where the controls take binary values but vary over the time horizon, they can thus be seen as dynamic switches. The switching patterns may be subject to combinatorial…

Optimization and Control · Mathematics 2024-04-04 Christoph Buchheim , Alexandra Grütering , Christian Meyer

We investigate the problem of obtaining agreement protocols in the presence of a mobile adversary, who can control an ever-changing selection of processors. We make improvements to previous results for the case when the communications…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-06-22 Chris Dowden