Related papers: Reducing graph subspaces and strong solutions to o…
The Bandwidth Problem seeks for a simultaneous permutation of the rows and columns of the adjacency matrix of a graph such that all nonzero entries are as close as possible to the main diagonal. This work focuses on investigating novel…
In this paper, we describe sufficient conditions when block-diagonal solutions to Lyapunov and $\mathcal{H}_{\infty}$ Riccati inequalities exist. In order to derive our results, we define a new type of comparison systems, which are positive…
A regularized optimization problem over a large unstructured graph is studied, where the regularization term is tied to the graph geometry. Typical regularization examples include the total variation and the Laplacian regularizations over…
The study of sorting permutations by block interchanges has recently been stimulated by a phenomenon observed in the genome maintenance of certain ciliate species. The result was the identification of a block interchange operation that…
Let $\mathcal{H}$ be a separable infinite-dimensional complex Hilbert space, $\mathcal{B}(\mathcal{H})$ the algebra of bounded linear operators acting on $\mathcal{H}$ and $\mathcal{J}$ a proper two-sided ideal of…
We develop an operator approach to the integration of linear differential equations based on intertwining relations between differential operators. Conditions for the existence of intertwining operators are obtained, and it is shown that,…
This paper establishes comprehensive stability results for quasi-variational inequalities (QVIs) under monotone perturbations of the governing operator. We prove strong convergence of both minimal and maximal solutions when sequences of…
We study the convergence of the Riemannian steepest descent algorithm on the Grassmann manifold for minimizing the block version of the Rayleigh quotient of a symmetric matrix. Even though this problem is non-convex in the Euclidean sense…
Operator learning has been highly successful for continuous mappings between infinite-dimensional spaces, such as PDE solution operators. However, many operators of interest-including differential operators-are discontinuous or set-valued,…
We give a simple approximation algorithm for a common generalization of many previously studied extensions of the maximum size stable matching problem with ties. These generalizations include the existence of critical vertices in the graph,…
In this paper, we consider some general properties of block graphs as well as the equitable coloring problem in this class of graphs. In the first part we establish the relation between two structural parameters for general block graphs. We…
We are concerned with the dependence of the lowest positive eigenvalue of the Dirac operator on the geometry of rectangles, subject to infinite-mass boundary conditions. We conjecture that the square is a global minimiser both under the…
In this article we discuss the convergence of first order operators on a thickened graph (a graph-like space) towards a similar operator on the underlying metric graph. On the graph-like space, the first order operator is of the form…
In this paper we consider a problem of the similarity of complex symmetric operators to perturbations of restrictions of normal operators. For a subclass of cyclic complex symmetric operators in a finite-dimensional Hilbert space we prove…
A contraction analysis of risk-sensitive Riccati equations is proposed. When the state-space model is reachable and observable, a block-update implementation of the risk-sensitive filter is used to show that the N-fold composition of the…
In the first part of this manuscript a relationship between the spectrum of self-adjoint operator matrices and the spectra of their diagonal entries is found. This leads to enclosures for spectral points and in particular, enclosures for…
In this work, we present an abstract theory for the approximation of operator-valued Riccati equations posed on Hilbert spaces. It is demonstrated here that the error of the approximate solution to the operator-valued Riccati equation is…
Let $G$ be a graph. A set $S$ of vertices in $G$ dominates the graph if every vertex of $G$ is either in $S$ or a neighbor of a vertex in $S$. Finding a minimal cardinality set which dominates the graph is an NP-complete problem. The graph…
For a given graph $\mathcal{G}$ of order $n$ with $m$ edges, and a real symmetric matrix associated to the graph, $M\left(\mathcal{G}\right)\in\mathbb{R}^{n\times n}$, the interlacing graph reduction problem is to find a graph…
An obstacle representation of a graph $G$ is a set of points in the plane representing the vertices of $G$, together with a set of polygonal obstacles such that two vertices of $G$ are connected by an edge in $G$ if and only if the line…