相关论文: On Some Bounds on the Perturbation of Invariant Su…

A basic problem in operator theory is to estimate how a small perturbation effects the eigenspaces of a self-adjoint compact operator. In this paper, we prove upper bounds for the subspace distance, taylored for structured random…

We formulate and solve a class of finite-time transport and mixing problems in the set-oriented framework. The aim is to obtain optimal discrete-time perturbations in nonlinear dynamical systems to transport a specified initial measure on…

A (molecular) graph in which all vertices have the same degree is known as a regular graph. According to Gutman, Hansen, and M\'elot [J. Chem. Inf. Model. 45 (2005) 222-230], it is of interest to measure the irregularity of nonregular…

Imposing either Dirichlet or Neumann boundary conditions on the boundary of a smooth bounded domain $\Omega$, we study the perturbation incurred by the voltage potential when the conductivity is modified in a set of small measure. We…

The spectral properties of disordered fully-connected graphs with a special type of the node-node interactions are investigated. The approximate analytical expression for the ensemble-averaged spectral density for the Hamiltonian defined on…

Graph neural networks are experiencing a surge of popularity within the machine learning community due to their ability to adapt to non-Euclidean domains and instil inductive biases. Despite this, their stability, i.e., their robustness to…

Spectral graph convolutional networks are generalizations of standard convolutional networks for graph-structured data using the Laplacian operator. A common misconception is the instability of spectral filters, i.e. the impossibility to…

Understanding causal relationships among the variables of a system is paramount to explain and control its behavior. For many real-world systems, however, the true causal graph is not readily available and one must resort to predictions…

Based on a previous paper [Chr17] on Neumann data for Dirichlet eigenfunctions on triangles, we extend the study in two ways. First, we investigate the (semi-classical) Neumann data mass on perturbed triangles. Specifically, we replace one…

We focus on the new type perturbed metric spaces and introduce a contraction mapping namely new type perturbed Kannan mappings. For these mappings, we show that Banach's fixed point theorem holds. Moreover, this new generalization of…

We construct the general permutation invariant Gaussian 2-matrix model for matrices of arbitrary size $D$. The parameters of the model are given in terms of variables defined using the representation theory of the symmetric group $S_D$. A…

This article is dedicated to the following class of problems. Start with an $N\times N$ Hermitian matrix randomly picked from a matrix ensemble - the reference matrix. Applying a rank-$t$ perturbation to it, with $t$ taking the values $1\le…

String theory is the most promising candidate for the theory unifying all interactions including gravity. It has an extremely difficult dynamics. Therefore, it is useful to study some its simplifications. One of them is non-critical string…

This work develops a flexible and mathematically sound framework for the design and analysis of graph scattering networks with variable branching ratios and generic functional calculus filters. Spectrally-agnostic stability guarantees for…

Low-rank pseudoinverses are widely used to approximate matrix inverses in scalable machine learning, optimization, and scientific computing. However, real-world matrices are often observed with noise, arising from sampling, sketching, and…

We study a set of scattering matrices of quantum graphs containing minimal number of passbands, i.e., maximal number of zero elements. The cases of even and odd vertex degree are considered. Using a solution of inverse scattering problem,…

We study inverse boundary problems for third-order nonlinear tensorial perturbations of biharmonic operators on a bounded domain in $\mathbb{R}^n$, where $n\geq 3$. By imposing appropriate assumptions on the nonlinearity, we demonstrate…

Perturbation theory is an important tool in the analysis of oscillators and their response to external stimuli. It is predicated on the assumption that the perturbations in question are "sufficiently weak", an assumption that is not always…

Let $D$ be an oriented graph with skew adjacency matrix $S(D)$. Two oriented graphs $D$ and $C$ are said to share the same generalized skew spectrum if $S(D)$ and $S(C)$ have the same eigenvalues, and $J-S(D)$ and $J-S(C)$ also have the…

Graph editing problems offer an interesting perspective on sub- and supergraph identification problems for a large variety of target properties. They have also attracted significant attention in recent years, particularly in the area of…