The Graph Geometric Control Condition

In this paper, we introduce a novel concept called the Graph Geometric Control Condition (GGCC). It turns out to be a simple, geometric rewriting of many of the frameworks in which the controllability of PDEs on graphs has been studied. We prove that (GGCC) is a necessary and sufficient condition for the exact controllability of the wave equation on metric graphs with internal controls and Dirichlet boundary conditions. We then investigate the internal exact controllability of the wave equation with mixed boundary conditions and the one of the Schrödinger equation, as well as the internal null-controllability of the heat equation. We show that (GGCC) provides a sufficient condition for the controllability of these equations and we provide explicit examples proving that (GGCC) is not necessary in these cases.

Authors

Institutions

Publication Details

Journal
ArXiv.org
Published
2025-03-24
Primary Topic
Graph Theory and Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

The Graph Geometric Control Condition

Kaïs Ammari, Kévin Le Balc’h, Romain Joly, Alessandro Duca
ArXiv.org
Graph Theory and Algorithms
article

The Graph Geometric Control Condition

Kaïs Ammari, Kévin Le Balc’h, Romain Joly, Alessandro Duca
article en

Abstract

In this paper, we introduce a novel concept called the Graph Geometric Control Condition (GGCC). It turns out to be a simple, geometric rewriting of many of the frameworks in which the controllability of PDEs on graphs has been studied. We prove that (GGCC) is a necessary and sufficient condition for the exact controllability of the wave equation on metric graphs with internal controls and Dirichlet boundary conditions. We then investigate the internal exact controllability of the wave equation with mixed boundary conditions and the one of the Schrödinger equation, as well as the internal null-controllability of the heat equation. We show that (GGCC) provides a sufficient condition for the controllability of these equations and we provide explicit examples proving that (GGCC) is not necessary in these cases.

ArXiv.org
University of Monastir (TN), Institut Élie Cartan de Lorraine (FR), Institut Fourier (FR), Université de Lorraine (FR)
Openalex Percentile: Top 72%
Graph Theory and Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

The Graph Geometric Control Condition — Kaïs Ammari, Kévin Le Balc’h, et al. · ArXiv.org (2025) | TGRS Research Map | TGRS