Related papers: The Graph Geometric Control Condition
A box in Euclidean $k$-space is the Cartesian product of $k$ closed intervals on the real line. The boxicity of a graph $G$, denoted by $\text{box}(G)$, is the minimum nonnegative integer $k$ such that $G$ can be isomorphic to the…
In this paper we introduce a new dynamical condition, the comb geometric control condition, which is sufficient for observability of the Schr\"odinger equation in Euclidean space. We provide examples which show this condition is strictly…
We study the boundary control of solutions of the Helmholtz and Maxwell equations to enforce local non-zero constraints. These constraints may represent the local absence of nodal or critical points, or that certain functionals depending on…
We consider decomposition spaces $\R^3/G$ that are manifold factors and admit defining sequences consisting of cubes-with-handles. Metrics on $\R^3/G$ constructed via modular embeddings into Euclidean spaces promote the controlled topology…
Positive systems describing networks with inherently non-negative states and inputs arise naturally in routing, logistics, and compartmental modelling. We consider problems modelled as positive linear systems in incidence form with linear…
A necessary and sufficient condition is derived for the controllability of Kronecker product networks, where the factor networks are general directed graphs. The condition explicitly illustrates how the controllability of the factor…
A vertex coloring of a graph is said to be \textit{conflict-free} with respect to neighborhoods if for every non-isolated vertex there is a color appearing exactly once in its (open) neighborhood. As defined in [Fabrici et al.,…
This paper focuses on representation learning for dynamic graphs with temporal interactions. A fundamental issue is that both the graph structure and the nodes own their own dynamics, and their blending induces intractable complexity in the…
Let \( G \) be a finite simple undirected graph. Four graph parameters related to network monitoring are the \emph{geodetic set}, \emph{edge geodetic set}, \emph{strong edge geodetic set}, and \emph{monitoring edge geodetic set}, with…
A connected ordering $(v_1, v_2, \ldots, v_n)$ of $V(G)$ is an ordering of the vertices such that $v_i$ has at least one neighbour in $\{v_1, \ldots, v_{i - 1}\}$ for every $i \in \{2, \ldots, n\}$. A connected greedy coloring (CGC for…
We consider the 1D nonlinear Schr\"odinger equation with bilinear control. In the case of Neumann boundary conditions, local exact controllability of this equation near the ground state has been proved by Beauchard and Laurent in…
Graphene has generated a lot of research interest due to its special properties, which include a hydrodynamic regime. It is not yet clear however which boundary condition such a hydrodynamic current flow satisfies. The aim of this paper is…
We make a complete analysis of the controllability properties from the exterior of the (possible) strong damping wave equation with the fractional Laplace operator subject to the nonhomogeneous Dirichlet type exterior condition. In the…
In this paper we study the boundary controllability of the Gear-Grimshaw system posed on a finite domain $(0,L)$, with Neumann boundary conditions: \begin{equation} \label{abs} \begin{cases} u_t + uu_x+u_{xxx} + a v_{xxx} + a_1vv_x+a_2…
In this paper we consider a linear hybrid system which composed by two non-homogeneous rods connected by a point mass and generated by the equation\bea\left\{ \begin{array}{ll} \rho_{1}(x)u_{t}=(\sigma_{1}(x)u_{x})_{x}-q_{1}(x)u,&…
The article studies edge coverage for control flow graphs extended with explicit constraints. Achieving a given level of white-box coverage for a given code is a classic problem in software testing. We focus on designing test sets that…
We propose the Graph Context Encoder (GCE), a simple but efficient approach for graph representation learning based on graph feature masking and reconstruction. GCE models are trained to efficiently reconstruct input graphs similarly to a…
A connected undirected graph $G = (V,E)$ is lower conformally rigid if uniform edge weights maximize the second smallest Laplacian eigenvalue $\lambda_2(w)$ over all normalized edge weights $w$, and upper conformally rigid if uniform edge…
This paper proposes a novel notion for structural controllability under structured numerical perturbations, namely the perturbation-tolerant structural controllability (PTSC), on a single-input structured system whose entries can be…
The power domination problem focuses on finding the optimal placement of phase measurement units (PMUs) to monitor an electrical power network. In the context of graphs, the power domination number of a graph $G$, denoted $\gamma_P(G)$, is…