Related papers: Reducing graph subspaces and strong solutions to o…

We address the question of convergence of Schr\"odinger operators on metric graphs with general self-adjoint vertex conditions as lengths of some of graph's edges shrink to zero. We determine the limiting operator and study convergence in a…

We introduce and study a mathematical framework for a broad class of regularization functionals for ill-posed inverse problems: Regularization Graphs. Regularization graphs allow to construct functionals using as building blocks linear…

Let $\A$ and $\B$ be operator algebras with $c_0$-isomorphic diagonals and let $\K$ denote the compact operators. We show that if $\A\otimes\K$ and $\B\otimes\K$ are isometrically isomorphic, then $\A$ and $\B$ are isometrically isomorphic.…

In two earlier papers, we designed a distributed deterministic asynchronous algorithm for minimizing the sum of subdifferentiable and proximable functions and a regularizing quadratic on time-varying graphs based on Dykstra's algorithm, or…

As it is popular known, Riccati equation is the key basic tool for optimal control in the modern control theory. The solvability conditions of optimal control, stabilization conditions and controller design are all based on the Riccati…

Let $M=(m_{ij})$ be a symmetric matrix of order $n$ whose elements lie in an arbitrary field $\mathbb{F}$, and let $G$ be the graph with vertex set $\{1,\ldots,n\}$ such that distinct vertices $i$ and $j$ are adjacent if and only if $m_{ij}…

A method for compression of large graphs and matrices to a block structure is further developed. Szemer\'edi's regularity lemma is used as a generic motivation of the significance of stochastic block models. Another ingredient of the method…

We provide a solution to the problem of simultaneous $diagonalization$ $via$ $congruence$ of a given set of $m$ complex symmetric $n\times n$ matrices $\{A_{1},\ldots,A_{m}\}$, by showing that it can be reduced to a possibly…

In a graph $G = (V,E)$, a vertex subset $S\subseteq V(G)$ is said to be a dominating set of $G$ if every vertex not in $S$ is adjacent to a vertex in $S$. A dominating set $S$ of $G$ is called a paired-dominating set of $G$ if the induced…

Let X be a finite set of complex numbers and let A be a normal operator with spectrum X that acts on a separable Hilbert space H. Relative to a fixed orthonormal basis e_1,e_2, ... for H, A gives rise to a matrix whose diagonal is a…

Matrix-valued optimization tasks, including those involving symmetric positive definite (SPD) matrices, arise in a wide range of applications in machine learning, data science and statistics. Classically, such problems are solved via…

This paper is devoted to a structured perturbation analysis of the symmetric algebraic Riccati equations by exploiting the symmetry structure. Based on the analysis, the upper bounds for the structured normwise, mixed and componentwise…

A strong $s$-blocking set in a projective space is a set of points that intersects each codimension-$s$ subspace in a spanning set of the subspace. We present an explicit construction of such sets in a $(k - 1)$-dimensional projective space…

In this paper a geometric method based on Grassmann manifolds and matrix Riccati equations to make hermitian matrices diagonal is presented. We call it Riccati Diagonalization.

In the recent years, several polynomial algorithms of a dynamical nature have been proposed to address the graph isomorphism problem. In this paper we propose a generalization of an approach exposed in cond-mat/0209112 and find that this…

We study generalized solutions of an evolutionary equation related to some densely defined skew-symmetric operator in a real Hilbert space. We establish existence of a contractive semigroup, which provides generalized solutions, and suggest…

We propose a geometric framework to describe and analyze a wide array of operator splitting methods for solving monotone inclusion problems. The initial inclusion problem, which typically involves several operators combined through…

It is known for many algorithmic problems that if a tree decomposition of width $t$ is given in the input, then the problem can be solved with exponential dependence on $t$. A line of research by Lokshtanov, Marx, and Saurabh [SODA 2011]…

A method for compression of large graphs and non-negative matrices to a block structure is proposed. Szemer\'edi's regularity lemma is used as heuristic motivation of the significance of stochastic block models. Another ingredient of the…

These are notes on the method of normalized graph cuts and its applications to graph clustering. I provide a fairly thorough treatment of this deeply original method due to Shi and Malik, including complete proofs. I include the necessary…